./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 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_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW --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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- 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-4e7fbc6 [2022-11-23 14:50:04,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:50:04,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:50:04,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:50:04,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:50:04,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:50:04,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:50:04,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:50:04,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:50:04,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:50:04,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:50:04,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:50:04,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:50:04,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:50:04,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:50:04,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:50:04,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:50:04,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:50:04,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:50:04,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:50:04,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:50:04,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:50:04,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:50:04,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:50:04,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:50:04,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:50:04,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:50:04,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:50:04,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:50:04,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:50:04,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:50:04,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:50:04,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:50:04,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:50:04,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:50:04,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:50:04,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:50:04,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:50:04,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:50:04,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:50:04,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:50:04,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-23 14:50:04,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:50:04,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:50:04,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:50:04,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:50:04,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:50:04,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:50:04,783 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:50:04,783 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:50:04,784 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:50:04,784 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:50:04,784 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:50:04,785 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:50:04,785 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:50:04,786 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:50:04,786 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:50:04,786 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:50:04,787 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:50:04,787 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:50:04,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:50:04,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:50:04,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:50:04,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:50:04,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:50:04,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:50:04,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:50:04,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:50:04,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:50:04,790 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 14:50:04,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:50:04,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:50:04,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:50:04,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:50:04,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:50:04,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:50:04,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:50:04,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:50:04,793 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:50:04,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:50:04,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:50:04,794 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:50:04,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:50:04,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:50:04,795 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:50:04,795 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_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/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_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2022-11-23 14:50:05,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:50:05,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:50:05,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:50:05,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:50:05,110 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:50:05,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-23 14:50:08,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:50:08,567 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:50:08,578 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-23 14:50:08,598 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/data/f6b017f19/e1fb2b5c2a764cc1bc0a9706d4c4eaba/FLAGc1aaeee7c [2022-11-23 14:50:08,621 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/data/f6b017f19/e1fb2b5c2a764cc1bc0a9706d4c4eaba [2022-11-23 14:50:08,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:50:08,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:50:08,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:50:08,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:50:08,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:50:08,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:50:08" (1/1) ... [2022-11-23 14:50:08,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7526a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:08, skipping insertion in model container [2022-11-23 14:50:08,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:50:08" (1/1) ... [2022-11-23 14:50:08,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:50:08,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:50:09,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:50:09,082 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:50:09,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:50:09,168 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:50:09,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09 WrapperNode [2022-11-23 14:50:09,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:50:09,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:50:09,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:50:09,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:50:09,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,217 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 102 [2022-11-23 14:50:09,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:50:09,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:50:09,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:50:09,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:50:09,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,245 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:50:09,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:50:09,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:50:09,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:50:09,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (1/1) ... [2022-11-23 14:50:09,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:50:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:09,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:50:09,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:50:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-23 14:50:09,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-23 14:50:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:50:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:50:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:50:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:50:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:50:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 14:50:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:50:09,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:50:09,551 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:50:09,553 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:50:09,782 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:50:09,862 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:50:09,863 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 14:50:09,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:50:09 BoogieIcfgContainer [2022-11-23 14:50:09,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:50:09,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:50:09,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:50:09,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:50:09,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:50:08" (1/3) ... [2022-11-23 14:50:09,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a2ba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:50:09, skipping insertion in model container [2022-11-23 14:50:09,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:50:09" (2/3) ... [2022-11-23 14:50:09,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a2ba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:50:09, skipping insertion in model container [2022-11-23 14:50:09,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:50:09" (3/3) ... [2022-11-23 14:50:09,875 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2022-11-23 14:50:09,895 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:50:09,896 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-23 14:50:09,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:50:09,952 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;@62296323, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:50:09,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-23 14:50:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:50:09,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:09,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:09,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1760724867, now seen corresponding path program 1 times [2022-11-23 14:50:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:09,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412059494] [2022-11-23 14:50:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:10,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:10,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412059494] [2022-11-23 14:50:10,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412059494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:10,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:10,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:50:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450165134] [2022-11-23 14:50:10,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:50:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:50:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:50:10,495 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 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 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-23 14:50:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:10,679 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-23 14:50:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:50:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-23 14:50:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:10,690 INFO L225 Difference]: With dead ends: 66 [2022-11-23 14:50:10,691 INFO L226 Difference]: Without dead ends: 60 [2022-11-23 14:50:10,693 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-11-23 14:50:10,697 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:10,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:50:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-23 14:50:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2022-11-23 14:50:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.625) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-23 14:50:10,749 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2022-11-23 14:50:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:10,750 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-23 14:50:10,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-23 14:50:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-23 14:50:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:50:10,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:10,766 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:10,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:50:10,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 681145425, now seen corresponding path program 1 times [2022-11-23 14:50:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:10,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810075494] [2022-11-23 14:50:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:11,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810075494] [2022-11-23 14:50:11,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810075494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733342852] [2022-11-23 14:50:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:11,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:11,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:11,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:50:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:11,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:50:11,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:11,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:50:11,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733342852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:11,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:50:11,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 14:50:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772256444] [2022-11-23 14:50:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:11,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:50:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:50:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:50:11,220 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:11,321 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-11-23 14:50:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:50:11,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2022-11-23 14:50:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:11,323 INFO L225 Difference]: With dead ends: 60 [2022-11-23 14:50:11,323 INFO L226 Difference]: Without dead ends: 59 [2022-11-23 14:50:11,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:50:11,325 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 77 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:11,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 127 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:50:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-23 14:50:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-11-23 14:50:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-11-23 14:50:11,334 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2022-11-23 14:50:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:11,334 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-11-23 14:50:11,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-11-23 14:50:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:50:11,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:11,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:11,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:11,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:11,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 699757211, now seen corresponding path program 1 times [2022-11-23 14:50:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:11,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990258341] [2022-11-23 14:50:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:11,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:11,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990258341] [2022-11-23 14:50:11,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990258341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:11,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:11,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:50:11,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218881551] [2022-11-23 14:50:11,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:11,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:50:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:50:11,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:50:11,620 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:11,670 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-11-23 14:50:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:50:11,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2022-11-23 14:50:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:11,672 INFO L225 Difference]: With dead ends: 41 [2022-11-23 14:50:11,672 INFO L226 Difference]: Without dead ends: 39 [2022-11-23 14:50:11,672 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-11-23 14:50:11,673 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:11,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-23 14:50:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-23 14:50:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-11-23 14:50:11,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2022-11-23 14:50:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:11,682 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-11-23 14:50:11,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-11-23 14:50:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:50:11,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:11,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:11,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:50:11,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -359328235, now seen corresponding path program 1 times [2022-11-23 14:50:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:11,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864731783] [2022-11-23 14:50:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:11,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864731783] [2022-11-23 14:50:11,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864731783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211940130] [2022-11-23 14:50:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:11,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:11,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:50:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:11,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:50:11,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:11,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:50:12,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211940130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:12,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064318567] [2022-11-23 14:50:12,046 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 14:50:12,047 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:12,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:12,057 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:12,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:12,211 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 8 treesize of output 7 [2022-11-23 14:50:12,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:12,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:12,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 23 treesize of output 1 [2022-11-23 14:50:12,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:12,560 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 23 treesize of output 1 [2022-11-23 14:50:12,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:12,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:12,665 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 23 treesize of output 1 [2022-11-23 14:50:12,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:12,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:12,755 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-23 14:50:12,806 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:13,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2064318567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:13,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:13,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-11-23 14:50:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305325719] [2022-11-23 14:50:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:50:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:50:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-23 14:50:13,756 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:14,489 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-11-23 14:50:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 14:50:14,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-11-23 14:50:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:14,491 INFO L225 Difference]: With dead ends: 52 [2022-11-23 14:50:14,491 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 14:50:14,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:50:14,492 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 83 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:14,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 147 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:50:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 14:50:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-11-23 14:50:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-23 14:50:14,512 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2022-11-23 14:50:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:14,512 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-23 14:50:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-23 14:50:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:50:14,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:14,514 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:14,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:14,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:14,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash -245286596, now seen corresponding path program 1 times [2022-11-23 14:50:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:14,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049129790] [2022-11-23 14:50:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:14,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:14,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049129790] [2022-11-23 14:50:14,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049129790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:14,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:14,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:50:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411685221] [2022-11-23 14:50:14,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:14,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:50:14,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:50:14,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:50:14,806 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:14,865 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-23 14:50:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:50:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 14 [2022-11-23 14:50:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:14,871 INFO L225 Difference]: With dead ends: 66 [2022-11-23 14:50:14,871 INFO L226 Difference]: Without dead ends: 64 [2022-11-23 14:50:14,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:50:14,873 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:14,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-23 14:50:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-11-23 14:50:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:50:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-23 14:50:14,911 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 14 [2022-11-23 14:50:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:14,911 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-23 14:50:14,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-23 14:50:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:50:14,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:14,913 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:14,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:50:14,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -245284497, now seen corresponding path program 1 times [2022-11-23 14:50:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:14,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068135104] [2022-11-23 14:50:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:14,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:14,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068135104] [2022-11-23 14:50:14,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068135104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:14,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:50:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436000000] [2022-11-23 14:50:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:14,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:50:14,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:14,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:50:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:50:14,995 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:15,070 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-11-23 14:50:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:50:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2022-11-23 14:50:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:15,073 INFO L225 Difference]: With dead ends: 64 [2022-11-23 14:50:15,073 INFO L226 Difference]: Without dead ends: 62 [2022-11-23 14:50:15,074 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-11-23 14:50:15,076 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:15,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-23 14:50:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-23 14:50:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 42 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:50:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-11-23 14:50:15,113 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2022-11-23 14:50:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:15,113 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-11-23 14:50:15,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-11-23 14:50:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:50:15,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:15,115 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:15,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:50:15,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1304044262, now seen corresponding path program 1 times [2022-11-23 14:50:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:15,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253425841] [2022-11-23 14:50:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:50:15,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:15,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253425841] [2022-11-23 14:50:15,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253425841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:15,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:15,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:50:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338181591] [2022-11-23 14:50:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:15,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:50:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:50:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:50:15,204 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:15,305 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-23 14:50:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:50:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-11-23 14:50:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:15,308 INFO L225 Difference]: With dead ends: 82 [2022-11-23 14:50:15,308 INFO L226 Difference]: Without dead ends: 73 [2022-11-23 14:50:15,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:50:15,309 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:15,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:50:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-23 14:50:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-11-23 14:50:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 57 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:50:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-11-23 14:50:15,338 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 14 [2022-11-23 14:50:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:15,339 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-11-23 14:50:15,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-11-23 14:50:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:50:15,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:15,340 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:15,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:50:15,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:15,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1593505982, now seen corresponding path program 1 times [2022-11-23 14:50:15,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:15,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651702857] [2022-11-23 14:50:15,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:15,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651702857] [2022-11-23 14:50:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651702857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:15,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:15,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:50:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401837150] [2022-11-23 14:50:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:50:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:50:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:50:15,400 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:15,482 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2022-11-23 14:50:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:50:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2022-11-23 14:50:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:15,483 INFO L225 Difference]: With dead ends: 111 [2022-11-23 14:50:15,483 INFO L226 Difference]: Without dead ends: 91 [2022-11-23 14:50:15,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:50:15,484 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:15,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-23 14:50:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2022-11-23 14:50:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 56 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:50:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-23 14:50:15,507 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 17 [2022-11-23 14:50:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:15,507 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-23 14:50:15,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-23 14:50:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:50:15,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:15,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:15,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:50:15,509 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash 978495982, now seen corresponding path program 1 times [2022-11-23 14:50:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:15,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059241110] [2022-11-23 14:50:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:15,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:15,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059241110] [2022-11-23 14:50:15,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059241110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:15,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930305073] [2022-11-23 14:50:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:15,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:15,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:15,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:15,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:50:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:15,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:50:15,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:15,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:15,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930305073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:15,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840186330] [2022-11-23 14:50:15,769 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:50:15,769 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:15,770 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:15,770 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:15,770 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:15,846 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 8 treesize of output 7 [2022-11-23 14:50:15,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:16,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-23 14:50:16,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-23 14:50:16,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-23 14:50:16,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,202 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 23 treesize of output 1 [2022-11-23 14:50:16,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:16,255 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:50:16,281 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-23 14:50:16,318 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1840186330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:17,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 18 [2022-11-23 14:50:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243613800] [2022-11-23 14:50:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 14:50:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 14:50:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-23 14:50:17,403 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:18,311 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-11-23 14:50:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 14:50:18,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 17 [2022-11-23 14:50:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:18,313 INFO L225 Difference]: With dead ends: 82 [2022-11-23 14:50:18,313 INFO L226 Difference]: Without dead ends: 73 [2022-11-23 14:50:18,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:50:18,315 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 71 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:18,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 132 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:50:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-23 14:50:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-11-23 14:50:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 56 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:50:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-11-23 14:50:18,339 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 17 [2022-11-23 14:50:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:18,340 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-11-23 14:50:18,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:50:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-11-23 14:50:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:50:18,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:18,341 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:18,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:18,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash 904044068, now seen corresponding path program 1 times [2022-11-23 14:50:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:18,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248498357] [2022-11-23 14:50:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:50:18,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248498357] [2022-11-23 14:50:18,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248498357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:18,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293111820] [2022-11-23 14:50:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:18,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:18,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:18,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:50:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:18,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:50:18,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:50:18,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:50:18,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293111820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:18,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:50:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-23 14:50:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633632271] [2022-11-23 14:50:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:50:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:50:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:50:18,753 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:18,809 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-23 14:50:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:50:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-23 14:50:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:18,810 INFO L225 Difference]: With dead ends: 76 [2022-11-23 14:50:18,810 INFO L226 Difference]: Without dead ends: 49 [2022-11-23 14:50:18,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:50:18,812 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:18,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-23 14:50:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-23 14:50:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-23 14:50:18,829 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2022-11-23 14:50:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:18,830 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-23 14:50:18,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-23 14:50:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:50:18,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:18,833 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:18,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:19,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 14:50:19,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1125078776, now seen corresponding path program 1 times [2022-11-23 14:50:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:19,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599557903] [2022-11-23 14:50:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:50:19,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599557903] [2022-11-23 14:50:19,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599557903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029706215] [2022-11-23 14:50:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:19,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:19,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:50:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:19,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:50:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:50:19,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:50:19,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029706215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:19,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:50:19,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-23 14:50:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478888110] [2022-11-23 14:50:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:19,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:50:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:50:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:50:19,292 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:19,366 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-23 14:50:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:50:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 25 [2022-11-23 14:50:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:19,368 INFO L225 Difference]: With dead ends: 56 [2022-11-23 14:50:19,368 INFO L226 Difference]: Without dead ends: 54 [2022-11-23 14:50:19,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:50:19,369 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:19,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-23 14:50:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-11-23 14:50:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-11-23 14:50:19,387 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 25 [2022-11-23 14:50:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:19,388 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-11-23 14:50:19,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-11-23 14:50:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:50:19,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:19,390 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-11-23 14:50:19,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:19,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 14:50:19,596 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash -782412162, now seen corresponding path program 1 times [2022-11-23 14:50:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628508975] [2022-11-23 14:50:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:50:19,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:19,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628508975] [2022-11-23 14:50:19,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628508975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479583485] [2022-11-23 14:50:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:19,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:19,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:19,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:19,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:50:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:19,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:50:19,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:19,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:20,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479583485] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:20,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [81000700] [2022-11-23 14:50:20,051 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-23 14:50:20,051 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:20,052 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:20,052 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:20,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:20,115 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 8 treesize of output 7 [2022-11-23 14:50:20,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:20,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 15 treesize of output 11 [2022-11-23 14:50:20,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:20,270 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 23 treesize of output 1 [2022-11-23 14:50:20,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:20,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:20,338 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 23 treesize of output 1 [2022-11-23 14:50:20,377 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 23 treesize of output 1 [2022-11-23 14:50:20,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:20,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:20,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:20,741 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-23 14:50:20,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-11-23 14:50:20,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:20,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:21,116 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-23 14:50:21,202 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:24,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [81000700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:24,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:24,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5, 9, 9] total 32 [2022-11-23 14:50:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507608257] [2022-11-23 14:50:24,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:24,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 14:50:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 14:50:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:50:24,730 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:27,066 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-11-23 14:50:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 14:50:27,066 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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 25 [2022-11-23 14:50:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:27,068 INFO L225 Difference]: With dead ends: 54 [2022-11-23 14:50:27,068 INFO L226 Difference]: Without dead ends: 53 [2022-11-23 14:50:27,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 14:50:27,071 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:27,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 104 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:50:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-23 14:50:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-23 14:50:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 46 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-11-23 14:50:27,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 25 [2022-11-23 14:50:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:27,089 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-11-23 14:50:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-11-23 14:50:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:50:27,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:27,090 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:27,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:27,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 14:50:27,296 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 517703792, now seen corresponding path program 1 times [2022-11-23 14:50:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:27,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751773279] [2022-11-23 14:50:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:50:27,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751773279] [2022-11-23 14:50:27,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751773279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052906864] [2022-11-23 14:50:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:27,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:27,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:50:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:27,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:50:27,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:50:27,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:50:27,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052906864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:27,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:50:27,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-23 14:50:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329081664] [2022-11-23 14:50:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:50:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:50:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:50:27,529 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:50:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:27,586 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-11-23 14:50:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:50:27,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-23 14:50:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:27,587 INFO L225 Difference]: With dead ends: 52 [2022-11-23 14:50:27,588 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 14:50:27,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:50:27,589 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:27,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 14:50:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-23 14:50:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-11-23 14:50:27,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2022-11-23 14:50:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:27,603 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-11-23 14:50:27,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:50:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-11-23 14:50:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:50:27,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:27,605 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:27,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:27,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 14:50:27,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 517768852, now seen corresponding path program 1 times [2022-11-23 14:50:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:27,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614156494] [2022-11-23 14:50:27,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:50:27,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614156494] [2022-11-23 14:50:27,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614156494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906641328] [2022-11-23 14:50:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:27,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:27,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:50:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:28,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:50:28,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:28,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:50:28,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906641328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:28,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027837109] [2022-11-23 14:50:28,190 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 14:50:28,191 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:28,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:28,191 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:28,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:28,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:28,251 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 8 treesize of output 7 [2022-11-23 14:50:28,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-23 14:50:28,414 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 23 treesize of output 1 [2022-11-23 14:50:28,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,482 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 23 treesize of output 1 [2022-11-23 14:50:28,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,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 23 treesize of output 1 [2022-11-23 14:50:28,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:28,964 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 23 treesize of output 1 [2022-11-23 14:50:28,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:29,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:29,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:29,251 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 23 treesize of output 1 [2022-11-23 14:50:29,356 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-23 14:50:29,469 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:32,124 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2939#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) |ULTIMATE.start_alloc_17_~array#1.offset|)) |ULTIMATE.start_alloc_17_~p~0#1.offset|) (not (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (= |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_#t~post38#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:50:32,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:50:32,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:32,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-11-23 14:50:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266658095] [2022-11-23 14:50:32,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:50:32,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 14:50:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 14:50:32,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-11-23 14:50:32,127 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-23 14:50:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:32,494 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2022-11-23 14:50:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 14:50:32,495 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 26 [2022-11-23 14:50:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:32,496 INFO L225 Difference]: With dead ends: 149 [2022-11-23 14:50:32,496 INFO L226 Difference]: Without dead ends: 124 [2022-11-23 14:50:32,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 14:50:32,497 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:32,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 285 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:50:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-23 14:50:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2022-11-23 14:50:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 59 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:50:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-11-23 14:50:32,518 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 26 [2022-11-23 14:50:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:32,519 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-11-23 14:50:32,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-11-23 14:50:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-11-23 14:50:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:50:32,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:32,520 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-11-23 14:50:32,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:32,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 14:50:32,726 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash 66321110, now seen corresponding path program 1 times [2022-11-23 14:50:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:32,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953052905] [2022-11-23 14:50:32,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:32,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:50:32,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953052905] [2022-11-23 14:50:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953052905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851227368] [2022-11-23 14:50:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:32,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:32,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:50:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:32,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:50:32,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:50:33,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:50:33,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851227368] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:33,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877264529] [2022-11-23 14:50:33,164 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-23 14:50:33,164 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:33,165 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:33,165 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:33,165 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:33,204 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 8 treesize of output 7 [2022-11-23 14:50:33,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:33,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,350 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 23 treesize of output 1 [2022-11-23 14:50:33,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,397 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 23 treesize of output 1 [2022-11-23 14:50:33,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,433 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 23 treesize of output 1 [2022-11-23 14:50:33,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,592 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 23 treesize of output 1 [2022-11-23 14:50:33,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,892 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 23 treesize of output 1 [2022-11-23 14:50:33,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:33,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:34,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:34,125 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 23 treesize of output 1 [2022-11-23 14:50:34,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:34,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:34,274 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-23 14:50:34,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-11-23 14:50:34,459 INFO L321 Elim1Store]: treesize reduction 120, result has 16.7 percent of original size [2022-11-23 14:50:34,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 139 [2022-11-23 14:50:34,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:34,688 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-23 14:50:34,791 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:38,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [877264529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:38,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:38,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 9, 9] total 31 [2022-11-23 14:50:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729330353] [2022-11-23 14:50:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:38,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:50:38,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:50:38,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-11-23 14:50:38,279 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:41,245 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-11-23 14:50:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:50:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 25 [2022-11-23 14:50:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:41,246 INFO L225 Difference]: With dead ends: 76 [2022-11-23 14:50:41,246 INFO L226 Difference]: Without dead ends: 74 [2022-11-23 14:50:41,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 14:50:41,248 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:41,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 86 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:50:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-23 14:50:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2022-11-23 14:50:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:50:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-11-23 14:50:41,269 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 25 [2022-11-23 14:50:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:41,269 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-11-23 14:50:41,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-11-23 14:50:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:50:41,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:41,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:41,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:41,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 14:50:41,476 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1515026892, now seen corresponding path program 1 times [2022-11-23 14:50:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:41,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067992784] [2022-11-23 14:50:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:50:41,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:41,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067992784] [2022-11-23 14:50:41,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067992784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122504229] [2022-11-23 14:50:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:41,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:41,588 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:41,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 14:50:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:41,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:50:41,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:41,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:41,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122504229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:41,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [555893964] [2022-11-23 14:50:41,924 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-23 14:50:41,924 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:41,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:41,925 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:41,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:41,969 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 8 treesize of output 7 [2022-11-23 14:50:41,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:42,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:42,083 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 23 treesize of output 1 [2022-11-23 14:50:42,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:42,131 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 23 treesize of output 1 [2022-11-23 14:50:42,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:42,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:42,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:42,182 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 23 treesize of output 1 [2022-11-23 14:50:42,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:42,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:42,488 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-23 14:50:42,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-11-23 14:50:42,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:42,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:42,814 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-23 14:50:42,886 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:46,443 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3811#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_free_17_#t~post42#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (<= |ULTIMATE.start_free_17_~array#1.offset| 0) (<= 0 |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= |~#ldv_global_msg_list~0.base| 1) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (<= (+ |ULTIMATE.start_alloc_17_~j~0#1| 1) 0) (= 3 |ULTIMATE.start_alloc_17_#res#1|) (= |#NULL.offset| 0) (<= 1 |~#ldv_global_msg_list~0.base|) (<= 0 |ULTIMATE.start_free_17_~array#1.offset|) (<= |ULTIMATE.start_free_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 14:50:46,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:50:46,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:46,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2022-11-23 14:50:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517865545] [2022-11-23 14:50:46,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:50:46,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 14:50:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:46,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 14:50:46,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 14:50:46,446 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:50:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:46,763 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-11-23 14:50:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 14:50:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-23 14:50:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:46,765 INFO L225 Difference]: With dead ends: 79 [2022-11-23 14:50:46,765 INFO L226 Difference]: Without dead ends: 60 [2022-11-23 14:50:46,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 14:50:46,766 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:46,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:50:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-23 14:50:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-11-23 14:50:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-11-23 14:50:46,788 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 26 [2022-11-23 14:50:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:46,788 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-11-23 14:50:46,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:50:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-11-23 14:50:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 14:50:46,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:46,789 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:46,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:46,990 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1685648934, now seen corresponding path program 1 times [2022-11-23 14:50:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119464599] [2022-11-23 14:50:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 14:50:47,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:47,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119464599] [2022-11-23 14:50:47,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119464599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:47,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:50:47,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:50:47,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845000992] [2022-11-23 14:50:47,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:47,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:50:47,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:47,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:50:47,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:50:47,043 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:50:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:47,083 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-11-23 14:50:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:50:47,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-23 14:50:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:47,084 INFO L225 Difference]: With dead ends: 57 [2022-11-23 14:50:47,084 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 14:50:47,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:50:47,085 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:47,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:50:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 14:50:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-23 14:50:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 50 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-11-23 14:50:47,106 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 31 [2022-11-23 14:50:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:47,107 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-11-23 14:50:47,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:50:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-11-23 14:50:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:50:47,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:47,108 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:47,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 14:50:47,109 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash -715509284, now seen corresponding path program 1 times [2022-11-23 14:50:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:47,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376766790] [2022-11-23 14:50:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:47,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:50:47,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376766790] [2022-11-23 14:50:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376766790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842644867] [2022-11-23 14:50:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:47,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:47,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:47,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:47,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 14:50:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:47,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:50:47,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:50:47,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:50:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842644867] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [410445008] [2022-11-23 14:50:47,484 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-23 14:50:47,485 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:47,485 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:47,485 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:47,485 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:47,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:47,541 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 8 treesize of output 7 [2022-11-23 14:50:47,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,650 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 23 treesize of output 1 [2022-11-23 14:50:47,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,712 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 23 treesize of output 1 [2022-11-23 14:50:47,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,763 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 23 treesize of output 1 [2022-11-23 14:50:47,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:47,923 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 23 treesize of output 1 [2022-11-23 14:50:47,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:48,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:48,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:48,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-23 14:50:48,432 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 23 treesize of output 1 [2022-11-23 14:50:48,442 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 30 treesize of output 18 [2022-11-23 14:50:48,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:50:48,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:48,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:48,561 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 23 treesize of output 1 [2022-11-23 14:50:48,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:48,653 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-23 14:50:48,755 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:51,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [410445008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:50:51,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:51,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 6, 6] total 28 [2022-11-23 14:50:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783806202] [2022-11-23 14:50:51,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:50:51,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:50:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:51,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:50:51,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:50:51,678 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:53,653 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-11-23 14:50:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:50:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-11-23 14:50:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:53,654 INFO L225 Difference]: With dead ends: 83 [2022-11-23 14:50:53,654 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 14:50:53,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 14:50:53,656 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 127 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:53,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 59 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:50:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 14:50:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-11-23 14:50:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 53 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:50:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-11-23 14:50:53,684 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 32 [2022-11-23 14:50:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:53,684 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-11-23 14:50:53,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:50:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-11-23 14:50:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:50:53,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:53,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:53,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 14:50:53,891 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2046791233, now seen corresponding path program 2 times [2022-11-23 14:50:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:53,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907288290] [2022-11-23 14:50:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:50:54,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:54,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907288290] [2022-11-23 14:50:54,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907288290] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:54,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951264726] [2022-11-23 14:50:54,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:50:54,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:54,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:54,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:54,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 14:50:54,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 14:50:54,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:50:54,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:50:54,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 14:50:54,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 14:50:54,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951264726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:54,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929406460] [2022-11-23 14:50:54,368 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-23 14:50:54,368 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:54,368 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:54,368 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:54,369 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:54,402 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 8 treesize of output 7 [2022-11-23 14:50:54,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:54,513 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 23 treesize of output 1 [2022-11-23 14:50:54,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:54,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:54,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:54,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:54,590 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 23 treesize of output 1 [2022-11-23 14:50:54,616 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 23 treesize of output 1 [2022-11-23 14:50:54,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:54,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:54,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:54,922 INFO L321 Elim1Store]: treesize reduction 58, result has 19.4 percent of original size [2022-11-23 14:50:54,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:50:55,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-23 14:50:55,127 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-23 14:50:55,191 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:50:58,785 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4836#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_free_17_#t~post42#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (<= |ULTIMATE.start_free_17_~array#1.offset| 0) (<= 0 |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (<= (+ |ULTIMATE.start_alloc_17_~j~0#1| 1) 0) (= |~#ldv_global_msg_list~0.base| 1) (= 3 |ULTIMATE.start_alloc_17_#res#1|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_free_17_~array#1.offset|) (<= |ULTIMATE.start_free_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 14:50:58,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:50:58,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:50:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 19 [2022-11-23 14:50:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569879395] [2022-11-23 14:50:58,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:50:58,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 14:50:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:50:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 14:50:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 14:50:58,788 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 14:50:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:50:59,213 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-11-23 14:50:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 14:50:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-11-23 14:50:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:50:59,215 INFO L225 Difference]: With dead ends: 110 [2022-11-23 14:50:59,215 INFO L226 Difference]: Without dead ends: 76 [2022-11-23 14:50:59,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 14:50:59,217 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 90 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:50:59,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 167 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:50:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-23 14:50:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-11-23 14:50:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:50:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-11-23 14:50:59,236 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 32 [2022-11-23 14:50:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:50:59,236 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-11-23 14:50:59,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 14:50:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-11-23 14:50:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:50:59,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:50:59,237 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:50:59,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 14:50:59,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:59,438 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:50:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:50:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash 185765956, now seen corresponding path program 1 times [2022-11-23 14:50:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:50:59,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876763517] [2022-11-23 14:50:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:50:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:50:59,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:50:59,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876763517] [2022-11-23 14:50:59,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876763517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:50:59,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917037559] [2022-11-23 14:50:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:50:59,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:50:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:50:59,564 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:50:59,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 14:50:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:50:59,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:50:59,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:50:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:50:59,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:50:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:50:59,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917037559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:50:59,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1761453534] [2022-11-23 14:50:59,810 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-23 14:50:59,810 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:50:59,811 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:50:59,811 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:50:59,811 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:50:59,851 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 8 treesize of output 7 [2022-11-23 14:50:59,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:50:59,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:50:59,980 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 23 treesize of output 1 [2022-11-23 14:50:59,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-23 14:51:00,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,066 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 23 treesize of output 1 [2022-11-23 14:51:00,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,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 15 treesize of output 11 [2022-11-23 14:51:00,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,254 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 23 treesize of output 1 [2022-11-23 14:51:00,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,509 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 23 treesize of output 1 [2022-11-23 14:51:00,744 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 30 treesize of output 18 [2022-11-23 14:51:00,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:51:00,761 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 23 treesize of output 1 [2022-11-23 14:51:00,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:00,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:51:00,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:51:00,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2022-11-23 14:51:00,885 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:51:00,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:51:00,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:51:00,900 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 28 treesize of output 27 [2022-11-23 14:51:00,918 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 23 treesize of output 1 [2022-11-23 14:51:00,987 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 30 treesize of output 18 [2022-11-23 14:51:00,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:51:01,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:01,012 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 23 treesize of output 1 [2022-11-23 14:51:01,060 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 23 treesize of output 1 [2022-11-23 14:51:01,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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-23 14:51:01,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:51:01,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:01,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:01,139 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 23 treesize of output 1 [2022-11-23 14:51:01,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 14:51:01,224 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-23 14:51:01,316 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:51:03,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1761453534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:51:03,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:51:03,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 8, 8] total 25 [2022-11-23 14:51:03,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389670047] [2022-11-23 14:51:03,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:51:03,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:51:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:51:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:51:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-11-23 14:51:03,753 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:51:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:51:05,602 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-11-23 14:51:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:51:05,602 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-11-23 14:51:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:51:05,603 INFO L225 Difference]: With dead ends: 68 [2022-11-23 14:51:05,603 INFO L226 Difference]: Without dead ends: 67 [2022-11-23 14:51:05,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 14:51:05,604 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:51:05,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 30 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:51:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-23 14:51:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2022-11-23 14:51:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:51:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-11-23 14:51:05,625 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 35 [2022-11-23 14:51:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:51:05,626 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-11-23 14:51:05,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:51:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-11-23 14:51:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 14:51:05,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:51:05,627 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:51:05,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 14:51:05,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:51:05,833 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:51:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:51:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2013297170, now seen corresponding path program 1 times [2022-11-23 14:51:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:51:05,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478939243] [2022-11-23 14:51:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:51:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:51:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:51:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:51:05,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:51:05,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478939243] [2022-11-23 14:51:05,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478939243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:51:05,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730378587] [2022-11-23 14:51:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:51:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:51:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:51:05,944 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:51:05,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 14:51:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:51:06,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:51:06,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:51:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:51:06,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:51:06,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730378587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:51:06,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:51:06,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-11-23 14:51:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011448800] [2022-11-23 14:51:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:51:06,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:51:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:51:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:51:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:51:06,116 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:51:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:51:06,206 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-11-23 14:51:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:51:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 36 [2022-11-23 14:51:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:51:06,208 INFO L225 Difference]: With dead ends: 80 [2022-11-23 14:51:06,208 INFO L226 Difference]: Without dead ends: 67 [2022-11-23 14:51:06,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-23 14:51:06,210 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:51:06,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 64 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:51:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-23 14:51:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-11-23 14:51:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:51:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-11-23 14:51:06,232 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 36 [2022-11-23 14:51:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:51:06,232 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-11-23 14:51:06,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:51:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-11-23 14:51:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 14:51:06,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:51:06,234 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:51:06,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:51:06,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:51:06,440 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-23 14:51:06,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:51:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1142121594, now seen corresponding path program 1 times [2022-11-23 14:51:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:51:06,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658055755] [2022-11-23 14:51:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:51:06,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:51:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:51:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 14:51:06,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:51:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658055755] [2022-11-23 14:51:06,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658055755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:51:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174908666] [2022-11-23 14:51:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:51:06,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:51:06,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:51:06,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:51:06,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 14:51:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:51:06,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:51:06,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:51:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 14:51:06,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:51:06,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174908666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:51:06,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:51:06,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 14:51:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987236417] [2022-11-23 14:51:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:51:06,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:51:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:51:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:51:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:51:06,698 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:51:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:51:06,763 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-11-23 14:51:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:51:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 39 [2022-11-23 14:51:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:51:06,764 INFO L225 Difference]: With dead ends: 64 [2022-11-23 14:51:06,764 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 14:51:06,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:51:06,765 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:51:06,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:51:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 14:51:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 14:51:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:51:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 14:51:06,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-11-23 14:51:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:51:06,767 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 14:51:06,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:51:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 14:51:06,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 14:51:06,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-23 14:51:06,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-23 14:51:06,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-23 14:51:06,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-23 14:51:06,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-23 14:51:06,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-23 14:51:06,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-23 14:51:06,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-23 14:51:06,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-23 14:51:06,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-23 14:51:06,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:51:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 14:51:06,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 14:52:28,372 WARN L233 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 262 DAG size of output: 260 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 14:53:13,637 WARN L233 SmtUtils]: Spent 45.16s on a formula simplification. DAG size of input: 165 DAG size of output: 165 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 14:53:21,296 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (or (not (<= 0 |#NULL.offset|)) (not (<= |~#ldv_global_msg_list~0.base| 1)) (not (<= 0 |~#ldv_global_msg_list~0.offset|)) (not (<= 1 |~#ldv_global_msg_list~0.base|)) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= 0 |#StackHeapBarrier|)) (and (not (= |ldv_malloc_#in~size| 4)) (let ((.cse0 (div (- |ldv_malloc_#in~size|) (- 4))) (.cse2 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|)) (.cse3 (+ |~#ldv_global_msg_list~0.offset| 4))) (or (not (= (select |old(#valid)| 1) 1)) (not (= (mod (* |ldv_malloc_#in~size| 3) 4) 0)) (not (< 0 |#StackHeapBarrier|)) (not (< 0 .cse0)) (not (= (select |old(#length)| 1) 8)) (not (= (select .cse1 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (< .cse0 16777216)) (not (= |~#ldv_global_msg_list~0.base| (select .cse2 .cse3))) (not (= (select |old(#valid)| 0) 0)) (not (= |~#ldv_global_msg_list~0.base| (select .cse2 |~#ldv_global_msg_list~0.offset|))) (not (= |~#ldv_global_msg_list~0.offset| (select .cse1 .cse3)))))) (not (<= |~#ldv_global_msg_list~0.offset| 0)) (not (<= |#NULL.base| 0))) [2022-11-23 14:53:21,296 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-23 14:53:21,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-23 14:53:21,297 INFO L895 garLoopResultBuilder]: At program point L787-2(line 787) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) (let ((.cse3 (< 0 |ULTIMATE.start_ldv_positive_~r~1#1|))) (or (and (= |ULTIMATE.start_ldv_positive_~r~1#1| |ULTIMATE.start_ldv_positive_#res#1|) .cse3) (and (not .cse3) (= |ULTIMATE.start_ldv_positive_#res#1| 1)))) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-23 14:53:21,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-23 14:53:21,297 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-23 14:53:21,298 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2022-11-23 14:53:21,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-23 14:53:21,298 INFO L899 garLoopResultBuilder]: For program point L780-3(line 780) no Hoare annotation was computed. [2022-11-23 14:53:21,298 INFO L899 garLoopResultBuilder]: For program point L780-4(line 780) no Hoare annotation was computed. [2022-11-23 14:53:21,299 INFO L895 garLoopResultBuilder]: At program point L780-5(lines 780 782) the Hoare annotation is: (let ((.cse57 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1))) (let ((.cse35 (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647)) (.cse38 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse42 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse37 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216)) (.cse7 (= |ULTIMATE.start_free_17_~array#1.base| |ULTIMATE.start_free_17_#in~array#1.base|)) (.cse15 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_free_17_#in~array#1.base|)) (.cse18 (= |ULTIMATE.start_free_17_#in~len#1| |ULTIMATE.start_free_17_~len#1|)) (.cse21 (= |ULTIMATE.start_free_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse45 (<= 1 |ULTIMATE.start_free_17_~i~1#1|)) (.cse26 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse29 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse30 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse31 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216)) (.cse32 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse34 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse27 (<= 0 .cse57)) (.cse28 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse41 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse33 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse36 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse13 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse14 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse43 (= |~#ldv_global_msg_list~0.base| 1)) (.cse44 (= |#NULL.offset| 0)) (.cse17 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse19 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse24 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse39 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse40 (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (<= |#NULL.offset| 0)) (.cse11 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse12 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse16 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse20 (<= 0 |#NULL.offset|)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (= |ULTIMATE.start_free_17_~i~1#1| 0)) (.cse25 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~len#1| |ULTIMATE.start_alloc_17_~i~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_alloc_17_#res#1| 0) .cse9 (= |ULTIMATE.start_free_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= |ULTIMATE.start_free_17_#in~array#1.offset| |ULTIMATE.start_free_17_~array#1.offset|) .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse27 .cse28 .cse29 .cse30 .cse6 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse9 .cse36 .cse11 .cse37 .cse12 .cse38 .cse39 .cse40 .cse16 .cse20 .cse22 .cse23 .cse25) (and .cse0 (<= |ULTIMATE.start_entry_point_~len~0#1| 2) .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse28 .cse29 .cse30 .cse6 .cse41 .cse31 .cse32 .cse42 .cse8 .cse33 .cse34 (<= |ULTIMATE.start_entry_point_~i~2#1| 2) .cse36 .cse11 .cse37 (<= |ULTIMATE.start_free_17_~len#1| |ULTIMATE.start_free_17_~i~1#1|) .cse43 .cse40 .cse44 .cse22 .cse25) (and .cse0 .cse45 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse27 .cse28 .cse29 .cse30 .cse6 .cse41 .cse31 .cse32 .cse42 .cse8 .cse33 .cse34 .cse35 .cse36 .cse11 .cse37 .cse38 .cse39 .cse43 .cse40 .cse44 .cse22 .cse25) (and (let ((.cse46 (<= |ULTIMATE.start_free_17_~array#1.offset| 0)) (.cse47 (<= 0 |ULTIMATE.start_free_17_~len#1|)) (.cse49 (<= |ULTIMATE.start_free_17_#in~len#1| 16777216)) (.cse51 (<= 0 |ULTIMATE.start_free_17_#in~len#1|)) (.cse52 (<= |ULTIMATE.start_free_17_~i~1#1| 2147483647)) (.cse56 (<= 0 |ULTIMATE.start_free_17_~i~1#1|)) (.cse53 (<= 0 |ULTIMATE.start_free_17_~array#1.offset|)) (.cse54 (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|)) (.cse55 (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0))) (or (and (not .cse36) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse41 .cse42 .cse8 .cse11 .cse37 (<= 0 |ULTIMATE.start_alloc_17_~len#1|) .cse43 (or .cse45 (and .cse7 .cse15 .cse18 .cse21)) .cse44 .cse22 (let ((.cse48 (<= |ULTIMATE.start_alloc_17_#res#1| 0)) (.cse50 (<= 0 |ULTIMATE.start_alloc_17_#res#1|))) (or (and .cse45 .cse26 .cse46 .cse47 .cse48 .cse29 .cse30 .cse31 .cse32 .cse34 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55) (and .cse26 .cse46 .cse48 .cse29 .cse30 .cse31 .cse32 .cse34 .cse50 (<= |ULTIMATE.start_free_17_~i~1#1| 0) .cse56 .cse53 .cse54 .cse55))) .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse46 .cse47 .cse5 .cse27 .cse28 .cse6 .cse41 .cse8 .cse33 .cse49 .cse51 .cse52 .cse36 .cse56 .cse10 .cse11 .cse13 (<= .cse57 0) .cse14 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse43 (= 3 |ULTIMATE.start_alloc_17_#res#1|) .cse44 .cse53 .cse17 .cse19 .cse54 .cse22 .cse24 .cse55 .cse25))) .cse39 .cse40) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse8 (<= |ULTIMATE.start_free_17_~len#1| 0) .cse9 .cse11 .cse12 .cse16 .cse20 .cse22 .cse23 .cse25)))) [2022-11-23 14:53:21,299 INFO L899 garLoopResultBuilder]: For program point L772(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-23 14:53:21,299 INFO L899 garLoopResultBuilder]: For program point L772-4(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,300 INFO L899 garLoopResultBuilder]: For program point L772-5(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,300 INFO L895 garLoopResultBuilder]: At program point L772-6(lines 772 775) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse12 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse17 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse18 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse9 (<= |#NULL.offset| 0)) (.cse19 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse20 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse13 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse14 (<= 0 |#NULL.offset|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse12 0) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 (= .cse12 |ULTIMATE.start_alloc_17_~i~0#1|) .cse9 .cse19 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse10 .cse11 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse20 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse13 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse14 .cse15 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse16) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (<= 0 .cse12) .cse17 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse6 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) .cse7 .cse18 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) .cse9 .cse19 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse11 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse20 .cse13 .cse14 .cse15 .cse16))) [2022-11-23 14:53:21,300 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 796) no Hoare annotation was computed. [2022-11-23 14:53:21,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-23 14:53:21,301 INFO L899 garLoopResultBuilder]: For program point L765-3(line 765) no Hoare annotation was computed. [2022-11-23 14:53:21,301 INFO L899 garLoopResultBuilder]: For program point L765-4(line 765) no Hoare annotation was computed. [2022-11-23 14:53:21,301 INFO L895 garLoopResultBuilder]: At program point L765-5(lines 765 769) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse1 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse2 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse4 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse6 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse7 (<= 0 |ULTIMATE.start_alloc_17_~len#1|)) (.cse8 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (= |~#ldv_global_msg_list~0.base| 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) .cse0 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse1 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse2 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse3 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse4 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse5 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse6 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse7 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse6 .cse7 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse8 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse9 .cse10 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse11 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse12))) [2022-11-23 14:53:21,301 INFO L899 garLoopResultBuilder]: For program point L790-3(line 790) no Hoare annotation was computed. [2022-11-23 14:53:21,301 INFO L899 garLoopResultBuilder]: For program point L790-4(line 790) no Hoare annotation was computed. [2022-11-23 14:53:21,302 INFO L895 garLoopResultBuilder]: At program point L790-5(lines 790 792) the Hoare annotation is: (let ((.cse0 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse1 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (<= 1 |ULTIMATE.start_entry_point_~i~2#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) .cse0 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) .cse1 .cse2 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) .cse3 .cse4 .cse5 (<= 0 |#StackHeapBarrier|) .cse6) (let ((.cse7 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse8 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse9 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (= |~#ldv_global_msg_list~0.base| (select .cse7 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) .cse0 (= |~#ldv_global_msg_list~0.base| (select .cse7 .cse8)) .cse1 .cse2 (= |~#ldv_global_msg_list~0.offset| (select .cse9 .cse8)) (= (select |#valid| 1) 1) .cse3 (let ((.cse10 (< 0 |ULTIMATE.start_ldv_positive_~r~1#1|))) (or (and (= |ULTIMATE.start_ldv_positive_~r~1#1| |ULTIMATE.start_ldv_positive_#res#1|) .cse10) (and (not .cse10) (= |ULTIMATE.start_ldv_positive_#res#1| 1)))) .cse4 (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse5 (< 0 |#StackHeapBarrier|) .cse6 (= (select .cse9 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))))) [2022-11-23 14:53:21,302 INFO L895 garLoopResultBuilder]: At program point L766(line 766) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse1 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse2 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse4 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse6 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse7 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse8 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (= |~#ldv_global_msg_list~0.base| 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse6 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse7 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse8 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse9 .cse10 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse11 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse12) (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) .cse0 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse1 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse2 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse3 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse4 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse5 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse6 .cse7 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-23 14:53:21,302 INFO L899 garLoopResultBuilder]: For program point L766-1(line 766) no Hoare annotation was computed. [2022-11-23 14:53:21,303 INFO L899 garLoopResultBuilder]: For program point L767(line 767) no Hoare annotation was computed. [2022-11-23 14:53:21,303 INFO L895 garLoopResultBuilder]: At program point L767-1(lines 761 777) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse14 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse0 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse1 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse15 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse2 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse16 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse5 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse6 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse17 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse7 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse18 (<= |#NULL.offset| 0)) (.cse9 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse19 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse11 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse20 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse21 (<= 0 |#NULL.offset|)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse10 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse11 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse12 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse13) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse14 .cse0 .cse1 .cse15 .cse2 .cse16 .cse5 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse17 .cse8 .cse18 .cse10 .cse19 .cse20 .cse21 .cse12 .cse13) (and .cse14 .cse0 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse1 .cse15 .cse2 .cse16 .cse3 .cse4 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse5 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse6 .cse17 .cse7 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse18 .cse9 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse19 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse11 .cse20 .cse21 .cse12 .cse13))) [2022-11-23 14:53:21,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,303 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 797) no Hoare annotation was computed. [2022-11-23 14:53:21,304 INFO L895 garLoopResultBuilder]: At program point L776(lines 761 777) the Hoare annotation is: (let ((.cse20 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|))) (let ((.cse17 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse7 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse31 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse32 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse33 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse34 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse35 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse36 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse29 (not .cse20)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse3 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse4 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse5 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse10 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse11 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse12 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse13 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216)) (.cse14 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse15 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse16 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse18 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse30 (= |ULTIMATE.start_alloc_17_#res#1| 0)) (.cse19 (<= |#NULL.offset| 0)) (.cse21 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse22 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216)) (.cse23 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse25 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse26 (<= 0 |#NULL.offset|)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (= |#NULL.base| 0)) (.cse24 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) .cse19 .cse20 .cse21 .cse22 .cse23 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse24 .cse25 .cse26 .cse27 .cse28) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse16 .cse19 .cse21 .cse23 .cse25 .cse26 .cse27 .cse28) (and .cse29 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 .cse16 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse30 .cse19 .cse31 .cse21 .cse23 .cse32 .cse33 .cse25 .cse34 .cse35 .cse26 .cse27 .cse36 .cse28) (and (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 .cse16 .cse17 (= .cse7 |ULTIMATE.start_alloc_17_~i~0#1|) .cse19 .cse20 .cse31 .cse21 .cse23 .cse32 .cse33 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) (= 3 |ULTIMATE.start_alloc_17_#res#1|) .cse25 .cse34 .cse35 .cse26 .cse27 .cse36 .cse28) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse30 .cse19 .cse21 .cse22 .cse23 (<= 0 |ULTIMATE.start_alloc_17_~len#1|) .cse25 .cse26 .cse27 .cse28)) .cse24)))) [2022-11-23 14:53:21,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 14:53:21,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-23 14:53:21,305 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-23 14:53:21,308 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:53:21,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:53:21,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:53:21 BoogieIcfgContainer [2022-11-23 14:53:21,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:53:21,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:53:21,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:53:21,393 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:53:21,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:50:09" (3/4) ... [2022-11-23 14:53:21,396 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 14:53:21,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-23 14:53:21,411 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-23 14:53:21,413 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-23 14:53:21,414 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 14:53:21,442 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && r <= 16777216) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((i == 0 && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[1] == 8) && 0 <= r + 2147483648) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && ldv_global_msg_list == 0) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && \valid[1] == 1) && len < 16777216) && ((r == \result && 0 < r) || (!(0 < r) && \result == 1))) && ldv_global_msg_list == 1) && \valid[0] == 0) && \result == len) && #NULL == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list) [2022-11-23 14:53:21,444 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && #in~array <= 0) && ldv_global_msg_list == 0) && 0 <= #in~array) && p == 0) && i == 0) && i < len) && #in~array == array) && r <= 16777216) && array == #in~array) && len < 16777216) && #in~array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0) || (((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-23 14:53:21,444 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && j + 1 <= 0) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && j + 1 == i) && #NULL <= 0) && i < len) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && len < 16777216) && #in~array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-23 14:53:21,444 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && 0 <= unknown-#in~len-unknown) && r <= 16777216) && len <= 16777216) && 0 <= len) && 1 <= i) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && #in~array <= 0) && ldv_global_msg_list == 0) && 0 <= #in~array) && i == 0) && #in~array == array) && r <= 16777216) && 0 <= len) && array == #in~array) && len < 16777216) && #in~array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0) [2022-11-23 14:53:21,444 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && #in~array == array) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0)) || (((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && len <= 16777216) && p == 0) && j + 1 == i) && #NULL <= 0) && i < len) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && #in~array == array) && len <= i) && 3 == \result) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0) || (((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && 0 <= unknown-#in~len-unknown) && \result == 0) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && len < 16777216) [2022-11-23 14:53:21,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && len <= i) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && array == #in~array) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && #in~array == array) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && #in~array == array) && array == #in~array) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && unknown-#in~len-unknown == len) && 0 <= #NULL) && unknown-#in~len-unknown == len) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && unknown-#in~len-unknown == len) && #in~array == array) && #NULL == 0) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && len <= 2) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && i <= 2) && i < len) && r <= 16777216) && len <= 16777216) && len <= i) && ldv_global_msg_list == 1) && len <= 16777215) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && i < len) && r <= 16777216) && len <= 16777216) && 1 <= i) && len < 16777216) && ldv_global_msg_list == 1) && len <= 16777215) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && r <= 16777216) && len <= 16777216) && 0 <= len) && ldv_global_msg_list == 1) && (1 <= i || (((array == #in~array && array == #in~array) && unknown-#in~len-unknown == len) && unknown-#in~len-unknown == len))) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && (((((((((((((((((1 <= i && array <= 0) && array <= 0) && 0 <= len) && \result <= 0) && #in~array <= 0) && 0 <= array) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && 0 <= unknown-#in~len-unknown) && unknown-#in~len-unknown <= 16777216) && 0 <= \result) && 0 <= unknown-#in~len-unknown) && i <= 2147483647) && 0 <= array) && 0 <= #in~array) && #in~array <= 0) || (((((((((((((array <= 0 && array <= 0) && \result <= 0) && #in~array <= 0) && 0 <= array) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && 0 <= unknown-#in~len-unknown) && 0 <= \result) && i <= 0) && 0 <= i) && 0 <= array) && 0 <= #in~array) && #in~array <= 0))) && #NULL == 0) || (((((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array <= 0) && 0 <= len) && array == 0) && 0 <= j + 1) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && len <= 16777216) && p == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= unknown-#in~len-unknown) && i <= 2147483647) && i < len) && 0 <= i) && #in~array == array) && r <= 16777216) && array == #in~array) && j + 1 <= 0) && #in~array == array) && len <= i) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && 0 <= array) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #in~array) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #in~array <= 0) && #NULL == 0)) && len < 16777216) && len <= 16777215)) || ((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && len <= 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0) [2022-11-23 14:53:21,466 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:53:21,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:53:21,468 INFO L158 Benchmark]: Toolchain (without parser) took 192839.10ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 118.8MB in the beginning and 259.6MB in the end (delta: -140.8MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,468 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 107.0MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:53:21,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.57ms. Allocated memory is still 151.0MB. Free memory was 118.4MB in the beginning and 96.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.22ms. Allocated memory is still 151.0MB. Free memory was 96.4MB in the beginning and 93.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,471 INFO L158 Benchmark]: Boogie Preprocessor took 30.60ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 92.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,471 INFO L158 Benchmark]: RCFGBuilder took 615.92ms. Allocated memory is still 151.0MB. Free memory was 92.2MB in the beginning and 73.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,472 INFO L158 Benchmark]: TraceAbstraction took 191523.70ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 72.8MB in the beginning and 262.7MB in the end (delta: -189.9MB). Peak memory consumption was 232.5MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,472 INFO L158 Benchmark]: Witness Printer took 74.91ms. Allocated memory is still 461.4MB. Free memory was 262.7MB in the beginning and 259.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:53:21,474 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.72ms. Allocated memory is still 107.0MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.57ms. Allocated memory is still 151.0MB. Free memory was 118.4MB in the beginning and 96.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.22ms. Allocated memory is still 151.0MB. Free memory was 96.4MB in the beginning and 93.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.60ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 92.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.92ms. Allocated memory is still 151.0MB. Free memory was 92.2MB in the beginning and 73.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 191523.70ms. Allocated memory was 151.0MB in the beginning and 461.4MB in the end (delta: 310.4MB). Free memory was 72.8MB in the beginning and 262.7MB in the end (delta: -189.9MB). Peak memory consumption was 232.5MB. Max. memory is 16.1GB. * Witness Printer took 74.91ms. Allocated memory is still 461.4MB. Free memory was 262.7MB in the beginning and 259.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * 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: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: 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, 36 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 191.4s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 134.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 2182 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1673 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2588 IncrementalHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 509 mSDtfsCounter, 2588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 611 SyntacticMatches, 44 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=19, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 262 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 69 NumberOfFragments, 2250 HoareAnnotationTreeSize, 18 FomulaSimplifications, 148437 FormulaSimplificationTreeSizeReduction, 127.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1510439 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 887 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 2169 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2462 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 322/416 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: 6.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 110, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 196, TOOLS_POST_TIME: 4.0s, TOOLS_POST_CALL_APPLICATIONS: 42, TOOLS_POST_CALL_TIME: 1.3s, TOOLS_POST_RETURN_APPLICATIONS: 32, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 267, TOOLS_QUANTIFIERELIM_TIME: 5.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 436, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 38, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 15, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 28, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 110, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 13, LOOP_SUMMARIZER_CACHE_MISSES: 13, LOOP_SUMMARIZER_OVERALL_TIME: 3.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 28, CALL_SUMMARIZER_APPLICATIONS: 32, CALL_SUMMARIZER_CACHE_MISSES: 6, 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: 1606, DAG_COMPRESSION_RETAINED_NODES: 360, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 765]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && 0 <= unknown-#in~len-unknown) && r <= 16777216) && len <= 16777216) && 0 <= len) && 1 <= i) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && #in~array <= 0) && ldv_global_msg_list == 0) && 0 <= #in~array) && i == 0) && #in~array == array) && r <= 16777216) && 0 <= len) && array == #in~array) && len < 16777216) && #in~array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && len <= i) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && array == #in~array) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && #in~array == array) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && #in~array == array) && array == #in~array) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && unknown-#in~len-unknown == len) && 0 <= #NULL) && unknown-#in~len-unknown == len) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && unknown-#in~len-unknown == len) && #in~array == array) && #NULL == 0) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && len <= 2) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && i <= 2) && i < len) && r <= 16777216) && len <= 16777216) && len <= i) && ldv_global_msg_list == 1) && len <= 16777215) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && i < len) && r <= 16777216) && len <= 16777216) && 1 <= i) && len < 16777216) && ldv_global_msg_list == 1) && len <= 16777215) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && i <= 2147483647) && len <= 16777216) && r <= 16777216) && len <= 16777216) && 0 <= len) && ldv_global_msg_list == 1) && (1 <= i || (((array == #in~array && array == #in~array) && unknown-#in~len-unknown == len) && unknown-#in~len-unknown == len))) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && (((((((((((((((((1 <= i && array <= 0) && array <= 0) && 0 <= len) && \result <= 0) && #in~array <= 0) && 0 <= array) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && 0 <= unknown-#in~len-unknown) && unknown-#in~len-unknown <= 16777216) && 0 <= \result) && 0 <= unknown-#in~len-unknown) && i <= 2147483647) && 0 <= array) && 0 <= #in~array) && #in~array <= 0) || (((((((((((((array <= 0 && array <= 0) && \result <= 0) && #in~array <= 0) && 0 <= array) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && 0 <= unknown-#in~len-unknown) && 0 <= \result) && i <= 0) && 0 <= i) && 0 <= array) && 0 <= #in~array) && #in~array <= 0))) && #NULL == 0) || (((((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array <= 0) && 0 <= len) && array == 0) && 0 <= j + 1) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && len <= 16777216) && p == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= unknown-#in~len-unknown) && i <= 2147483647) && i < len) && 0 <= i) && #in~array == array) && r <= 16777216) && array == #in~array) && j + 1 <= 0) && #in~array == array) && len <= i) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && 0 <= array) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #in~array) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #in~array <= 0) && #NULL == 0)) && len < 16777216) && len <= 16777215)) || ((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && len <= 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && #in~array <= 0) && ldv_global_msg_list == 0) && 0 <= #in~array) && p == 0) && i == 0) && i < len) && #in~array == array) && r <= 16777216) && array == #in~array) && len < 16777216) && #in~array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0) || (((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && #in~array == array) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0)) || (((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && len <= 16777216) && p == 0) && j + 1 == i) && #NULL <= 0) && i < len) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && #in~array == array) && len <= i) && 3 == \result) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0) || (((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && i <= 2147483647) && len <= 16777216) && 0 <= unknown-#in~len-unknown) && \result == 0) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && len < 16777216) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && j + 1 <= 0) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && j + 1 == i) && #NULL <= 0) && i < len) && #in~array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == #in~array) && len < 16777216) && #in~array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == #in~array) && unknown-#in~len-unknown == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#in~len-unknown == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && #in~array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && unknown-#in~len-unknown <= 16777216) && 0 <= #in~array) && len <= 16777216) && p == 0) && 0 <= unknown-#in~len-unknown) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 790]: Loop Invariant [2022-11-23 14:53:21,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:53:21,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:53:21,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && r <= 16777216) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((i == 0 && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[1] == 8) && 0 <= r + 2147483648) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && ldv_global_msg_list == 0) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && \valid[1] == 1) && len < 16777216) && ((r == \result && 0 < r) || (!(0 < r) && \result == 1))) && ldv_global_msg_list == 1) && \valid[0] == 0) && \result == len) && #NULL == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list) RESULT: Ultimate proved your program to be correct! [2022-11-23 14:53:21,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e1594dd-46d3-4c87-9eba-e59ca7b85fca/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE