./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 38b53e6a 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_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/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_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur --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-38b53e6 [2022-11-26 01:10:36,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:10:36,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:10:36,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:10:36,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:10:36,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:10:36,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:10:36,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:10:36,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:10:36,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:10:36,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:10:36,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:10:36,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:10:36,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:10:36,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:10:36,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:10:36,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:10:36,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:10:36,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:10:36,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:10:36,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:10:36,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:10:36,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:10:36,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:10:36,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:10:36,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:10:36,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:10:36,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:10:36,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:10:36,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:10:36,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:10:36,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:10:36,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:10:36,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:10:36,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:10:36,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:10:36,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:10:36,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:10:36,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:10:36,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:10:36,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:10:36,760 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 01:10:36,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:10:36,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:10:36,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:10:36,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:10:36,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:10:36,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:10:36,797 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:10:36,798 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:10:36,798 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:10:36,798 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:10:36,799 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:10:36,799 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:10:36,800 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:10:36,800 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:10:36,800 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:10:36,800 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:10:36,801 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:10:36,801 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:10:36,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:10:36,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:10:36,802 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:10:36,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:10:36,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:10:36,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:10:36,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:10:36,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:10:36,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:10:36,804 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 01:10:36,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:10:36,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:10:36,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:10:36,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:10:36,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:10:36,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:10:36,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:10:36,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:10:36,806 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:10:36,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:10:36,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:10:36,807 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:10:36,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:10:36,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:10:36,808 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:10:36,808 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_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/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_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur 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-26 01:10:37,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:10:37,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:10:37,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:10:37,128 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:10:37,128 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:10:37,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-26 01:10:40,263 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:10:40,551 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:10:40,552 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-26 01:10:40,576 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/data/f5dc76ac0/93e694ceda904b9aa98124ca0f45a30a/FLAGa44877409 [2022-11-26 01:10:40,596 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/data/f5dc76ac0/93e694ceda904b9aa98124ca0f45a30a [2022-11-26 01:10:40,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:10:40,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:10:40,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:10:40,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:10:40,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:10:40,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:10:40" (1/1) ... [2022-11-26 01:10:40,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2486aa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:40, skipping insertion in model container [2022-11-26 01:10:40,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:10:40" (1/1) ... [2022-11-26 01:10:40,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:10:40,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:10:41,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:10:41,182 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:10:41,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:10:41,272 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:10:41,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41 WrapperNode [2022-11-26 01:10:41,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:10:41,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:10:41,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:10:41,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:10:41,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,323 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 102 [2022-11-26 01:10:41,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:10:41,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:10:41,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:10:41,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:10:41,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:10:41,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:10:41,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:10:41,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:10:41,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (1/1) ... [2022-11-26 01:10:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:10:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:41,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:10:41,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:10:41,452 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-26 01:10:41,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-26 01:10:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:10:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:10:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 01:10:41,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 01:10:41,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:10:41,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 01:10:41,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:10:41,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:10:41,696 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:10:41,698 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:10:41,911 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:10:42,008 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:10:42,008 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-26 01:10:42,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:42 BoogieIcfgContainer [2022-11-26 01:10:42,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:10:42,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:10:42,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:10:42,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:10:42,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:10:40" (1/3) ... [2022-11-26 01:10:42,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725a6685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:10:42, skipping insertion in model container [2022-11-26 01:10:42,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:41" (2/3) ... [2022-11-26 01:10:42,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725a6685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:10:42, skipping insertion in model container [2022-11-26 01:10:42,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:42" (3/3) ... [2022-11-26 01:10:42,031 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2022-11-26 01:10:42,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:10:42,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-26 01:10:42,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:10:42,114 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;@7913de37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:10:42,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-26 01:10:42,119 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-26 01:10:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:10:42,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:42,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:42,128 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-26 01:10:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1760724867, now seen corresponding path program 1 times [2022-11-26 01:10:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837013572] [2022-11-26 01:10:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:42,438 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-26 01:10:42,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:42,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837013572] [2022-11-26 01:10:42,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837013572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:42,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:42,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:10:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712832346] [2022-11-26 01:10:42,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:42,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:10:42,509 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-26 01:10:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:42,674 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-26 01:10:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:10:42,677 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-26 01:10:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:42,685 INFO L225 Difference]: With dead ends: 66 [2022-11-26 01:10:42,685 INFO L226 Difference]: Without dead ends: 60 [2022-11-26 01:10:42,688 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-26 01:10:42,695 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-26 01:10:42,697 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-26 01:10:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-26 01:10:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2022-11-26 01:10:42,740 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-26 01:10:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-26 01:10:42,744 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2022-11-26 01:10:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:42,745 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-26 01:10:42,745 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-26 01:10:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-26 01:10:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:10:42,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:42,749 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:42,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:10:42,750 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-26 01:10:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 681145425, now seen corresponding path program 1 times [2022-11-26 01:10:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:42,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973616151] [2022-11-26 01:10:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:43,015 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-26 01:10:43,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:43,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973616151] [2022-11-26 01:10:43,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973616151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:43,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251123684] [2022-11-26 01:10:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:43,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:43,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:10:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:43,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:10:43,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:43,259 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-26 01:10:43,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:10:43,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251123684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:43,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:10:43,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 01:10:43,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342236998] [2022-11-26 01:10:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:10:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:10:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:10:43,266 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-26 01:10:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:43,361 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-11-26 01:10:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:10:43,361 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-26 01:10:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:43,363 INFO L225 Difference]: With dead ends: 60 [2022-11-26 01:10:43,363 INFO L226 Difference]: Without dead ends: 59 [2022-11-26 01:10:43,363 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-26 01:10:43,365 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 77 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:43,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 127 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-26 01:10:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-11-26 01:10:43,378 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-26 01:10:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-11-26 01:10:43,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2022-11-26 01:10:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:43,380 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-11-26 01:10:43,381 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-26 01:10:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-11-26 01:10:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:10:43,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:43,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:43,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:43,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-26 01:10:43,589 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-26 01:10:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 699757211, now seen corresponding path program 1 times [2022-11-26 01:10:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:43,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090839517] [2022-11-26 01:10:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:43,694 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-26 01:10:43,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:43,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090839517] [2022-11-26 01:10:43,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090839517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:43,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:43,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:10:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312089923] [2022-11-26 01:10:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:43,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:43,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:10:43,699 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-26 01:10:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:43,770 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-11-26 01:10:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:10:43,771 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-26 01:10:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:43,772 INFO L225 Difference]: With dead ends: 41 [2022-11-26 01:10:43,773 INFO L226 Difference]: Without dead ends: 39 [2022-11-26 01:10:43,773 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-26 01:10:43,774 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-26 01:10:43,775 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-26 01:10:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-26 01:10:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-26 01:10:43,782 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-26 01:10:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-11-26 01:10:43,783 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2022-11-26 01:10:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:43,784 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-11-26 01:10:43,784 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-26 01:10:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-11-26 01:10:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 01:10:43,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:43,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:10:43,786 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-26 01:10:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash -359328235, now seen corresponding path program 1 times [2022-11-26 01:10:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:43,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344479119] [2022-11-26 01:10:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:43,907 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-26 01:10:43,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344479119] [2022-11-26 01:10:43,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344479119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75406656] [2022-11-26 01:10:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:43,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:43,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:10:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:44,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:10:44,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:44,066 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-26 01:10:44,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:44,135 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-26 01:10:44,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75406656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067775199] [2022-11-26 01:10:44,158 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 01:10:44,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:44,162 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:44,168 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:44,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:44,312 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-26 01:10:44,321 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-26 01:10:44,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:10:44,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:44,839 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-26 01:10:44,898 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:45,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2067775199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:45,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:10:45,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-11-26 01:10:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889466054] [2022-11-26 01:10:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:45,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 01:10:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 01:10:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:10:45,855 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-26 01:10:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:46,600 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-11-26 01:10:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:10:46,603 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-26 01:10:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:46,604 INFO L225 Difference]: With dead ends: 52 [2022-11-26 01:10:46,604 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 01:10:46,604 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-26 01:10:46,605 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 75 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 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-26 01:10:46,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 147 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:10:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 01:10:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-11-26 01:10:46,622 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-26 01:10:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-26 01:10:46,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2022-11-26 01:10:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:46,626 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-26 01:10:46,627 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-26 01:10:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-26 01:10:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:10:46,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:46,630 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:46,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:46,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:46,836 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-26 01:10:46,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -245286596, now seen corresponding path program 1 times [2022-11-26 01:10:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:46,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556267359] [2022-11-26 01:10:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:46,928 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-26 01:10:46,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:46,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556267359] [2022-11-26 01:10:46,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556267359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:46,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:46,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:10:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130744942] [2022-11-26 01:10:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:46,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:10:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:10:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:10:46,931 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-26 01:10:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:46,997 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-26 01:10:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:10:46,998 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-26 01:10:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:47,000 INFO L225 Difference]: With dead ends: 66 [2022-11-26 01:10:47,000 INFO L226 Difference]: Without dead ends: 64 [2022-11-26 01:10:47,001 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-26 01:10:47,002 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-26 01:10:47,002 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-26 01:10:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-26 01:10:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-11-26 01:10:47,019 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-26 01:10:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-26 01:10:47,020 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 14 [2022-11-26 01:10:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:47,021 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-26 01:10:47,021 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-26 01:10:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-26 01:10:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:10:47,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:47,022 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:47,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:10:47,023 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-26 01:10:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash -245284497, now seen corresponding path program 1 times [2022-11-26 01:10:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:47,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986714263] [2022-11-26 01:10:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:47,089 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-26 01:10:47,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:47,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986714263] [2022-11-26 01:10:47,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986714263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:47,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:47,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:10:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2589076] [2022-11-26 01:10:47,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:47,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:47,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:10:47,092 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-26 01:10:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:47,163 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-11-26 01:10:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:10:47,164 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-26 01:10:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:47,165 INFO L225 Difference]: With dead ends: 64 [2022-11-26 01:10:47,165 INFO L226 Difference]: Without dead ends: 62 [2022-11-26 01:10:47,165 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-26 01:10:47,166 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-26 01:10:47,167 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-26 01:10:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-26 01:10:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-26 01:10:47,181 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-26 01:10:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-11-26 01:10:47,182 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2022-11-26 01:10:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:47,183 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-11-26 01:10:47,183 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-26 01:10:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-11-26 01:10:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:10:47,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:47,184 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:47,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:10:47,185 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-26 01:10:47,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1304044262, now seen corresponding path program 1 times [2022-11-26 01:10:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:47,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575514617] [2022-11-26 01:10:47,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:47,275 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-26 01:10:47,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575514617] [2022-11-26 01:10:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575514617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:47,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:47,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:10:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699688912] [2022-11-26 01:10:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:47,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:10:47,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:10:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:10:47,278 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-26 01:10:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:47,369 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-26 01:10:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:10:47,370 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-26 01:10:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:47,371 INFO L225 Difference]: With dead ends: 82 [2022-11-26 01:10:47,371 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 01:10:47,372 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-26 01:10:47,372 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-26 01:10:47,373 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-26 01:10:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 01:10:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-11-26 01:10:47,392 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-26 01:10:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-11-26 01:10:47,393 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 14 [2022-11-26 01:10:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:47,394 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-11-26 01:10:47,394 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-26 01:10:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-11-26 01:10:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 01:10:47,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:47,395 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:47,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:10:47,396 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-26 01:10:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1593505982, now seen corresponding path program 1 times [2022-11-26 01:10:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:47,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944903368] [2022-11-26 01:10:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:47,448 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-26 01:10:47,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944903368] [2022-11-26 01:10:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944903368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:47,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:47,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:10:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671456976] [2022-11-26 01:10:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:47,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:10:47,451 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-26 01:10:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:47,529 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2022-11-26 01:10:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:10:47,529 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-26 01:10:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:47,530 INFO L225 Difference]: With dead ends: 111 [2022-11-26 01:10:47,530 INFO L226 Difference]: Without dead ends: 91 [2022-11-26 01:10:47,531 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-26 01:10:47,532 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-26 01:10:47,532 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-26 01:10:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-26 01:10:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2022-11-26 01:10:47,553 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-26 01:10:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-26 01:10:47,554 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 17 [2022-11-26 01:10:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:47,554 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-26 01:10:47,555 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-26 01:10:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-26 01:10:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 01:10:47,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:47,556 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:47,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:10:47,556 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-26 01:10:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 978495982, now seen corresponding path program 1 times [2022-11-26 01:10:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:47,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294379136] [2022-11-26 01:10:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:47,633 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-26 01:10:47,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294379136] [2022-11-26 01:10:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294379136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633223816] [2022-11-26 01:10:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:47,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:47,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:47,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:10:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:47,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:10:47,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:47,756 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-26 01:10:47,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:47,787 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-26 01:10:47,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633223816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:47,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1113616093] [2022-11-26 01:10:47,790 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 01:10:47,790 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:47,790 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:47,791 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:47,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:47,841 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-26 01:10:47,847 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-26 01:10:48,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:10:48,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:10:48,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:48,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 23 treesize of output 1 [2022-11-26 01:10:48,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 15 treesize of output 11 [2022-11-26 01:10:48,308 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:10:48,335 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-26 01:10:48,368 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:49,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1113616093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:49,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:10:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 18 [2022-11-26 01:10:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144822036] [2022-11-26 01:10:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:49,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:10:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:49,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:10:49,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:10:49,476 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-26 01:10:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:50,486 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-11-26 01:10:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:10:50,486 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-26 01:10:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:50,487 INFO L225 Difference]: With dead ends: 82 [2022-11-26 01:10:50,487 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 01:10:50,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-11-26 01:10:50,488 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 61 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 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-26 01:10:50,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 132 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:10:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 01:10:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-11-26 01:10:50,507 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-26 01:10:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-11-26 01:10:50,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 17 [2022-11-26 01:10:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:50,509 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-11-26 01:10:50,509 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-26 01:10:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-11-26 01:10:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:10:50,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:50,510 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:50,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:50,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:50,716 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-26 01:10:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash 904044068, now seen corresponding path program 1 times [2022-11-26 01:10:50,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:50,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535728029] [2022-11-26 01:10:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:50,799 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-26 01:10:50,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:50,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535728029] [2022-11-26 01:10:50,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535728029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:50,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250156840] [2022-11-26 01:10:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:50,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:50,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:50,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:10:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:50,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:10:50,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:50,935 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-26 01:10:50,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:10:50,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250156840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:50,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:10:50,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-26 01:10:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121183435] [2022-11-26 01:10:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:50,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:10:50,938 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-26 01:10:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:50,988 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-26 01:10:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:10:50,989 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-26 01:10:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:50,990 INFO L225 Difference]: With dead ends: 76 [2022-11-26 01:10:50,990 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 01:10:50,991 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-26 01:10:50,992 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-26 01:10:50,993 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-26 01:10:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 01:10:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-26 01:10:51,009 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-26 01:10:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-26 01:10:51,010 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2022-11-26 01:10:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:51,012 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-26 01:10:51,012 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-26 01:10:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-26 01:10:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 01:10:51,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:51,014 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-26 01:10:51,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:51,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 01:10:51,220 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-26 01:10:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1125078776, now seen corresponding path program 1 times [2022-11-26 01:10:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:51,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516172734] [2022-11-26 01:10:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:51,303 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-26 01:10:51,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:51,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516172734] [2022-11-26 01:10:51,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516172734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:51,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832100291] [2022-11-26 01:10:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:51,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:51,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:10:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:51,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:10:51,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:51,436 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-26 01:10:51,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:10:51,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832100291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:51,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:10:51,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-26 01:10:51,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145318017] [2022-11-26 01:10:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:51,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:10:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:10:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:10:51,441 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-26 01:10:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:51,511 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-26 01:10:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:10:51,511 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-26 01:10:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:51,512 INFO L225 Difference]: With dead ends: 56 [2022-11-26 01:10:51,513 INFO L226 Difference]: Without dead ends: 54 [2022-11-26 01:10:51,513 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-26 01:10:51,514 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:51,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 71 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:10:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-26 01:10:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-11-26 01:10:51,529 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-26 01:10:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-11-26 01:10:51,530 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 25 [2022-11-26 01:10:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:51,531 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-11-26 01:10:51,531 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-26 01:10:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-11-26 01:10:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 01:10:51,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:51,533 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-26 01:10:51,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:51,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 01:10:51,740 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-26 01:10:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -782412162, now seen corresponding path program 1 times [2022-11-26 01:10:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:51,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548549386] [2022-11-26 01:10:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:51,874 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-26 01:10:51,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:51,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548549386] [2022-11-26 01:10:51,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548549386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:51,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154282627] [2022-11-26 01:10:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:51,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:51,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:51,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:10:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:51,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:10:51,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:52,081 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-26 01:10:52,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:52,186 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-26 01:10:52,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154282627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:52,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722561854] [2022-11-26 01:10:52,189 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-26 01:10:52,190 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:52,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:52,190 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:52,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:52,252 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-26 01:10:52,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:10:52,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:10:52,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:10:52,779 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-26 01:10:52,866 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-26 01:10:52,866 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-26 01:10:52,986 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-26 01:10:53,092 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-26 01:10:53,238 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-26 01:10:53,332 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1722561854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:56,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:10:56,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5, 9, 9] total 32 [2022-11-26 01:10:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801998274] [2022-11-26 01:10:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:56,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 01:10:56,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 01:10:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2022-11-26 01:10:56,771 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-26 01:10:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:59,044 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-11-26 01:10:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 01:10:59,045 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-26 01:10:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:59,046 INFO L225 Difference]: With dead ends: 54 [2022-11-26 01:10:59,046 INFO L226 Difference]: Without dead ends: 53 [2022-11-26 01:10:59,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2022-11-26 01:10:59,048 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:59,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 104 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:10:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-26 01:10:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-26 01:10:59,063 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-26 01:10:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-11-26 01:10:59,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 25 [2022-11-26 01:10:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:59,064 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-11-26 01:10:59,064 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-26 01:10:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-11-26 01:10:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 01:10:59,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:59,065 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-26 01:10:59,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:59,271 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-26 01:10:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash 517703792, now seen corresponding path program 1 times [2022-11-26 01:10:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:59,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212578907] [2022-11-26 01:10:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:59,343 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-26 01:10:59,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:59,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212578907] [2022-11-26 01:10:59,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212578907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:59,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945525274] [2022-11-26 01:10:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:59,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:59,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:59,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:10:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:59,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:10:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:59,469 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-26 01:10:59,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:10:59,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945525274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:59,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:10:59,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-26 01:10:59,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191283536] [2022-11-26 01:10:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:59,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:10:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:59,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:10:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:10:59,473 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-26 01:10:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:59,505 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-11-26 01:10:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:10:59,506 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-26 01:10:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:59,507 INFO L225 Difference]: With dead ends: 52 [2022-11-26 01:10:59,507 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 01:10:59,507 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-26 01:10:59,508 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-26 01:10:59,509 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-26 01:10:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 01:10:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-26 01:10:59,533 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-26 01:10:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-11-26 01:10:59,533 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2022-11-26 01:10:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:59,534 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-11-26 01:10:59,534 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-26 01:10:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-11-26 01:10:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 01:10:59,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:59,537 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-26 01:10:59,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:59,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:10:59,750 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-26 01:10:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 517768852, now seen corresponding path program 1 times [2022-11-26 01:10:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:59,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934019256] [2022-11-26 01:10:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:59,863 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-26 01:10:59,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934019256] [2022-11-26 01:10:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934019256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826605588] [2022-11-26 01:10:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:59,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:59,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:59,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:10:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:59,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:10:59,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:00,055 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-26 01:11:00,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:00,166 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-26 01:11:00,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826605588] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:00,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581331421] [2022-11-26 01:11:00,171 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-26 01:11:00,172 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:00,172 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:00,172 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:00,172 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:00,218 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-26 01:11:00,225 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-26 01:11:00,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,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-26 01:11:00,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-26 01:11:00,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,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-26 01:11:00,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:11:00,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:00,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:00,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-26 01:11:00,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-26 01:11:01,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:01,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-26 01:11:01,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:01,249 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-26 01:11:01,379 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:03,836 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-26 01:11:03,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:03,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:03,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-11-26 01:11:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108002246] [2022-11-26 01:11:03,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:03,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:11:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:11:03,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-11-26 01:11:03,839 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-26 01:11:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:04,274 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2022-11-26 01:11:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:11:04,275 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-26 01:11:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:04,278 INFO L225 Difference]: With dead ends: 149 [2022-11-26 01:11:04,278 INFO L226 Difference]: Without dead ends: 124 [2022-11-26 01:11:04,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 01:11:04,279 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:04,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 285 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:11:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-26 01:11:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2022-11-26 01:11:04,301 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-26 01:11:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-11-26 01:11:04,302 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 26 [2022-11-26 01:11:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:04,302 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-11-26 01:11:04,303 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-26 01:11:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-11-26 01:11:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 01:11:04,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:04,305 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-26 01:11:04,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:04,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 01:11:04,510 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-26 01:11:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 66321110, now seen corresponding path program 1 times [2022-11-26 01:11:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:04,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518003937] [2022-11-26 01:11:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:04,594 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-26 01:11:04,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:04,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518003937] [2022-11-26 01:11:04,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518003937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:04,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754295600] [2022-11-26 01:11:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:04,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:04,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:04,609 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:04,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:11:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:04,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:11:04,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:04,822 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-26 01:11:04,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:04,913 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-26 01:11:04,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754295600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1737846803] [2022-11-26 01:11:04,915 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-26 01:11:04,916 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:04,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:04,916 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:04,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:04,950 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-26 01:11:04,956 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-26 01:11:05,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,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 23 treesize of output 1 [2022-11-26 01:11:05,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,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 23 treesize of output 1 [2022-11-26 01:11:05,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:11:05,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:05,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:05,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:05,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:05,960 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-26 01:11:06,003 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-26 01:11:06,003 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-26 01:11:06,177 INFO L321 Elim1Store]: treesize reduction 120, result has 16.7 percent of original size [2022-11-26 01:11:06,177 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-26 01:11:06,280 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-26 01:11:06,381 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-26 01:11:06,476 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:09,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1737846803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:09,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:09,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 9, 9] total 31 [2022-11-26 01:11:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225233229] [2022-11-26 01:11:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:09,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:11:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:11:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2022-11-26 01:11:09,923 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-26 01:11:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:12,872 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-11-26 01:11:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 01:11:12,873 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-26 01:11:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:12,874 INFO L225 Difference]: With dead ends: 76 [2022-11-26 01:11:12,874 INFO L226 Difference]: Without dead ends: 74 [2022-11-26 01:11:12,874 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-26 01:11:12,875 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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-26 01:11:12,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:11:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-26 01:11:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2022-11-26 01:11:12,905 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-26 01:11:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-11-26 01:11:12,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 25 [2022-11-26 01:11:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:12,906 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-11-26 01:11:12,906 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-26 01:11:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-11-26 01:11:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 01:11:12,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:12,907 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-26 01:11:12,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-26 01:11:13,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 01:11:13,112 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-26 01:11:13,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1515026892, now seen corresponding path program 1 times [2022-11-26 01:11:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:13,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826985747] [2022-11-26 01:11:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:13,203 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-26 01:11:13,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826985747] [2022-11-26 01:11:13,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826985747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653842621] [2022-11-26 01:11:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:13,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:13,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:13,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:13,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 01:11:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:13,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:11:13,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:13,433 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-26 01:11:13,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:13,528 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-26 01:11:13,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653842621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:13,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [819021361] [2022-11-26 01:11:13,531 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-26 01:11:13,531 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:13,532 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:13,533 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:13,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:13,577 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-26 01:11:13,582 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-26 01:11:13,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:13,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:13,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:13,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:13,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 15 treesize of output 11 [2022-11-26 01:11:13,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:13,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:13,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:13,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:14,037 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-26 01:11:14,114 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-26 01:11:14,114 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-26 01:11:14,210 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-26 01:11:14,306 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-26 01:11:14,458 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-26 01:11:14,535 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:18,058 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-26 01:11:18,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:18,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:18,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2022-11-26 01:11:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611429242] [2022-11-26 01:11:18,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:18,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 01:11:18,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:18,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 01:11:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 01:11:18,061 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-26 01:11:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:18,366 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-11-26 01:11:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:11:18,366 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-26 01:11:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:18,367 INFO L225 Difference]: With dead ends: 79 [2022-11-26 01:11:18,367 INFO L226 Difference]: Without dead ends: 60 [2022-11-26 01:11:18,368 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-26 01:11:18,369 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:18,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:11:18,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-26 01:11:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-11-26 01:11:18,390 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-26 01:11:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-11-26 01:11:18,391 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 26 [2022-11-26 01:11:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:18,391 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-11-26 01:11:18,391 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-26 01:11:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-11-26 01:11:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 01:11:18,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:18,392 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-26 01:11:18,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:18,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:18,598 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-26 01:11:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1685648934, now seen corresponding path program 1 times [2022-11-26 01:11:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:18,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976239369] [2022-11-26 01:11:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:18,656 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-26 01:11:18,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:18,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976239369] [2022-11-26 01:11:18,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976239369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:18,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:11:18,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:11:18,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260031893] [2022-11-26 01:11:18,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:18,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:11:18,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:18,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:11:18,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:11:18,659 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-26 01:11:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:18,698 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-11-26 01:11:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:11:18,698 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-26 01:11:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:18,699 INFO L225 Difference]: With dead ends: 57 [2022-11-26 01:11:18,699 INFO L226 Difference]: Without dead ends: 56 [2022-11-26 01:11:18,700 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-26 01:11:18,700 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-26 01:11:18,700 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-26 01:11:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-26 01:11:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-26 01:11:18,720 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-26 01:11:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-11-26 01:11:18,721 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 31 [2022-11-26 01:11:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:18,721 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-11-26 01:11:18,722 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-26 01:11:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-11-26 01:11:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 01:11:18,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:18,723 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-26 01:11:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 01:11:18,723 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-26 01:11:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash -715509284, now seen corresponding path program 1 times [2022-11-26 01:11:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:18,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110220775] [2022-11-26 01:11:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:18,819 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-26 01:11:18,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:18,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110220775] [2022-11-26 01:11:18,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110220775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:18,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474212053] [2022-11-26 01:11:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:18,822 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:18,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:11:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:18,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:11:18,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:18,985 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-26 01:11:18,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:19,051 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-26 01:11:19,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474212053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:19,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1622833782] [2022-11-26 01:11:19,053 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-26 01:11:19,053 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:19,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:19,054 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:19,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:19,106 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-26 01:11:19,110 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-26 01:11:19,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:19,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:11:19,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:19,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 15 treesize of output 11 [2022-11-26 01:11:19,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:19,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-26 01:11:19,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:19,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:11:19,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:19,972 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-26 01:11:19,979 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-26 01:11:19,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:20,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-26 01:11:20,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:20,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:20,196 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-26 01:11:20,303 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1622833782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:23,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:23,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 6, 6] total 28 [2022-11-26 01:11:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812342597] [2022-11-26 01:11:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:23,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:11:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:11:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2022-11-26 01:11:23,317 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-26 01:11:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:25,339 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-11-26 01:11:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 01:11:25,340 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-26 01:11:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:25,341 INFO L225 Difference]: With dead ends: 83 [2022-11-26 01:11:25,341 INFO L226 Difference]: Without dead ends: 82 [2022-11-26 01:11:25,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2022-11-26 01:11:25,342 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 104 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 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-26 01:11:25,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 59 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:11:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-26 01:11:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-11-26 01:11:25,363 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-26 01:11:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-11-26 01:11:25,364 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 32 [2022-11-26 01:11:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:25,365 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-11-26 01:11:25,365 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-26 01:11:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-11-26 01:11:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 01:11:25,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:25,366 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-26 01:11:25,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:25,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 01:11:25,569 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-26 01:11:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:25,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2046791233, now seen corresponding path program 2 times [2022-11-26 01:11:25,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:25,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97673294] [2022-11-26 01:11:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:25,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:25,779 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-26 01:11:25,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97673294] [2022-11-26 01:11:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97673294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:25,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785231365] [2022-11-26 01:11:25,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:11:25,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:25,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:25,781 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:25,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 01:11:25,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 01:11:25,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:11:25,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:11:25,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:25,967 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-26 01:11:25,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:26,053 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-26 01:11:26,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785231365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:26,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805952946] [2022-11-26 01:11:26,056 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-26 01:11:26,056 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:26,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:26,057 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:26,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:26,092 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-26 01:11:26,097 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-26 01:11:26,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:26,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-26 01:11:26,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:26,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:26,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:26,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:26,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:26,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:26,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:26,477 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-26 01:11:26,549 INFO L321 Elim1Store]: treesize reduction 58, result has 19.4 percent of original size [2022-11-26 01:11:26,549 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-26 01:11:26,637 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-26 01:11:26,761 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-26 01:11:26,832 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:30,428 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-26 01:11:30,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:30,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:30,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 19 [2022-11-26 01:11:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519559002] [2022-11-26 01:11:30,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:30,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 01:11:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 01:11:30,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 01:11:30,431 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-26 01:11:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:30,864 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-11-26 01:11:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:11:30,865 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-26 01:11:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:30,866 INFO L225 Difference]: With dead ends: 110 [2022-11-26 01:11:30,866 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 01:11:30,867 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-26 01:11:30,867 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 90 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:30,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 167 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:11:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 01:11:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-11-26 01:11:30,885 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-26 01:11:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-11-26 01:11:30,885 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 32 [2022-11-26 01:11:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:30,885 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-11-26 01:11:30,886 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-26 01:11:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-11-26 01:11:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:11:30,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:30,887 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-26 01:11:30,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:31,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:31,087 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-26 01:11:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 185765956, now seen corresponding path program 1 times [2022-11-26 01:11:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:31,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866562258] [2022-11-26 01:11:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:31,217 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-26 01:11:31,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:31,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866562258] [2022-11-26 01:11:31,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866562258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:31,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775309033] [2022-11-26 01:11:31,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:31,220 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:31,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 01:11:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:31,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 01:11:31,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:31,395 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-26 01:11:31,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:31,460 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-26 01:11:31,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775309033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:31,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111461972] [2022-11-26 01:11:31,462 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-26 01:11:31,462 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:31,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:31,463 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:31,463 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:31,507 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-26 01:11:31,511 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-26 01:11:31,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:31,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:31,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:11:32,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,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-26 01:11:32,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-26 01:11:32,364 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-26 01:11:32,372 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-26 01:11:32,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 01:11:32,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:11:32,465 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-26 01:11:32,487 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:11:32,487 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-26 01:11:32,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,502 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-26 01:11:32,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,593 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-26 01:11:32,601 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-26 01:11:32,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-26 01:11:32,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 23 treesize of output 1 [2022-11-26 01:11:32,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,674 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-26 01:11:32,682 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-26 01:11:32,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-26 01:11:32,821 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-26 01:11:32,909 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:35,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [111461972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:35,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:35,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 8, 8] total 25 [2022-11-26 01:11:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220237459] [2022-11-26 01:11:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:35,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:11:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:11:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:11:35,410 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-26 01:11:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:37,267 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-11-26 01:11:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 01:11:37,267 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-26 01:11:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:37,268 INFO L225 Difference]: With dead ends: 68 [2022-11-26 01:11:37,268 INFO L226 Difference]: Without dead ends: 67 [2022-11-26 01:11:37,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 01:11:37,270 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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-26 01:11:37,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:11:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-26 01:11:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2022-11-26 01:11:37,285 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-26 01:11:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-11-26 01:11:37,285 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 35 [2022-11-26 01:11:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:37,285 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-11-26 01:11:37,285 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-26 01:11:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-11-26 01:11:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 01:11:37,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:37,286 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-26 01:11:37,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-26 01:11:37,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:37,492 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-26 01:11:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2013297170, now seen corresponding path program 1 times [2022-11-26 01:11:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:37,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875621512] [2022-11-26 01:11:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:37,592 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-26 01:11:37,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:37,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875621512] [2022-11-26 01:11:37,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875621512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023539706] [2022-11-26 01:11:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:37,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:37,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:37,601 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:37,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 01:11:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:37,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:11:37,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:37,764 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-26 01:11:37,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:11:37,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023539706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:37,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:11:37,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-11-26 01:11:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25566052] [2022-11-26 01:11:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:37,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:11:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:11:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:11:37,766 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-26 01:11:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:37,846 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-11-26 01:11:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:11:37,846 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-26 01:11:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:37,847 INFO L225 Difference]: With dead ends: 80 [2022-11-26 01:11:37,847 INFO L226 Difference]: Without dead ends: 67 [2022-11-26 01:11:37,848 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-26 01:11:37,848 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:37,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 64 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:11:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-26 01:11:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-11-26 01:11:37,871 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-26 01:11:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-11-26 01:11:37,871 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 36 [2022-11-26 01:11:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:37,872 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-11-26 01:11:37,872 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-26 01:11:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-11-26 01:11:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-26 01:11:37,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:37,873 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-26 01:11:37,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:38,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:38,074 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-26 01:11:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1142121594, now seen corresponding path program 1 times [2022-11-26 01:11:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:38,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145347767] [2022-11-26 01:11:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:38,165 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-26 01:11:38,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145347767] [2022-11-26 01:11:38,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145347767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984187813] [2022-11-26 01:11:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:38,168 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:38,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 01:11:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:38,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:11:38,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:38,326 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-26 01:11:38,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:11:38,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984187813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:38,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:11:38,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 01:11:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783452561] [2022-11-26 01:11:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:11:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:11:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:11:38,328 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-26 01:11:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:38,394 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-11-26 01:11:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:11:38,397 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-26 01:11:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:38,398 INFO L225 Difference]: With dead ends: 64 [2022-11-26 01:11:38,398 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:11:38,398 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-26 01:11:38,399 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:38,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:11:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:11:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:11:38,400 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-26 01:11:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:11:38,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-11-26 01:11:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:38,401 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:11:38,401 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-26 01:11:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:11:38,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:11:38,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-26 01:11:38,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-26 01:11:38,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-26 01:11:38,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-26 01:11:38,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-26 01:11:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-26 01:11:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-26 01:11:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-26 01:11:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-26 01:11:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-26 01:11:38,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-26 01:11:38,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 01:11:38,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:13:00,612 WARN L233 SmtUtils]: Spent 1.37m 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-26 01:13:49,443 WARN L233 SmtUtils]: Spent 48.72s 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-26 01:13:56,978 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-26 01:13:56,979 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-26 01:13:56,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-26 01:13:56,979 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-26 01:13:56,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,979 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-26 01:13:56,979 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-26 01:13:56,979 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2022-11-26 01:13:56,980 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-26 01:13:56,980 INFO L899 garLoopResultBuilder]: For program point L780-3(line 780) no Hoare annotation was computed. [2022-11-26 01:13:56,980 INFO L899 garLoopResultBuilder]: For program point L780-4(line 780) no Hoare annotation was computed. [2022-11-26 01:13:56,980 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-26 01:13:56,980 INFO L899 garLoopResultBuilder]: For program point L772(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,981 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-26 01:13:56,981 INFO L899 garLoopResultBuilder]: For program point L772-4(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,981 INFO L899 garLoopResultBuilder]: For program point L772-5(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,981 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-26 01:13:56,981 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 796) no Hoare annotation was computed. [2022-11-26 01:13:56,982 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-26 01:13:56,982 INFO L899 garLoopResultBuilder]: For program point L765-3(line 765) no Hoare annotation was computed. [2022-11-26 01:13:56,982 INFO L899 garLoopResultBuilder]: For program point L765-4(line 765) no Hoare annotation was computed. [2022-11-26 01:13:56,982 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-26 01:13:56,982 INFO L899 garLoopResultBuilder]: For program point L790-3(line 790) no Hoare annotation was computed. [2022-11-26 01:13:56,982 INFO L899 garLoopResultBuilder]: For program point L790-4(line 790) no Hoare annotation was computed. [2022-11-26 01:13:56,982 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-26 01:13:56,983 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-26 01:13:56,983 INFO L899 garLoopResultBuilder]: For program point L766-1(line 766) no Hoare annotation was computed. [2022-11-26 01:13:56,983 INFO L899 garLoopResultBuilder]: For program point L767(line 767) no Hoare annotation was computed. [2022-11-26 01:13:56,983 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-26 01:13:56,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,984 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 797) no Hoare annotation was computed. [2022-11-26 01:13:56,984 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-26 01:13:56,984 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:13:56,984 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-26 01:13:56,985 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-26 01:13:56,988 INFO L445 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-26 01:13:56,991 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:13:57,056 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:13:57 BoogieIcfgContainer [2022-11-26 01:13:57,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:13:57,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:13:57,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:13:57,079 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:13:57,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:42" (3/4) ... [2022-11-26 01:13:57,083 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:13:57,093 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-26 01:13:57,098 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-26 01:13:57,101 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-26 01:13:57,101 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-26 01:13:57,129 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-26 01:13:57,130 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && p == 0) && i == 0) && i < len) && array == array) && r <= 16777216) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #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-26 01:13:57,131 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) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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-26 01:13:57,132 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && 0 <= \old(len)) && 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) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && i == 0) && array == array) && r <= 16777216) && 0 <= len) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) [2022-11-26 01:13:57,133 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == 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) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 3 == \result) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && \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-26 01:13:57,133 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 == array) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && array == array) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && \old(len) == len) && 0 <= #NULL) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && \old(len) == len) && array == array) && #NULL == 0) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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 == array && array == array) && \old(len) == len) && \old(len) == len))) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && (((((((((((((((((1 <= i && array <= 0) && array <= 0) && 0 <= len) && \result <= 0) && array <= 0) && 0 <= array) && \old(len) <= 16777216) && 0 <= array) && 0 <= \old(len)) && \old(len) <= 16777216) && 0 <= \result) && 0 <= \old(len)) && i <= 2147483647) && 0 <= array) && 0 <= array) && array <= 0) || (((((((((((((array <= 0 && array <= 0) && \result <= 0) && array <= 0) && 0 <= array) && \old(len) <= 16777216) && 0 <= array) && 0 <= \old(len)) && 0 <= \result) && i <= 0) && 0 <= i) && 0 <= array) && 0 <= array) && 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) && \old(len) <= 16777216) && 0 <= \old(len)) && i <= 2147483647) && i < len) && 0 <= i) && array == array) && r <= 16777216) && array == array) && j + 1 <= 0) && array == array) && len <= i) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && 0 <= array) && array == array) && \old(len) == len) && 0 <= array) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && 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-26 01:13:57,146 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:13:57,146 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:13:57,147 INFO L158 Benchmark]: Toolchain (without parser) took 196538.19ms. Allocated memory was 127.9MB in the beginning and 308.3MB in the end (delta: 180.4MB). Free memory was 84.0MB in the beginning and 230.3MB in the end (delta: -146.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,147 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 127.9MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:13:57,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.83ms. Allocated memory is still 127.9MB. Free memory was 83.6MB in the beginning and 61.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.08ms. Allocated memory is still 127.9MB. Free memory was 61.4MB in the beginning and 58.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,148 INFO L158 Benchmark]: Boogie Preprocessor took 30.30ms. Allocated memory is still 127.9MB. Free memory was 58.8MB in the beginning and 57.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,148 INFO L158 Benchmark]: RCFGBuilder took 666.38ms. Allocated memory is still 127.9MB. Free memory was 57.2MB in the beginning and 84.6MB in the end (delta: -27.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,149 INFO L158 Benchmark]: TraceAbstraction took 195054.46ms. Allocated memory was 127.9MB in the beginning and 308.3MB in the end (delta: 180.4MB). Free memory was 84.0MB in the beginning and 234.5MB in the end (delta: -150.5MB). Peak memory consumption was 174.2MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,149 INFO L158 Benchmark]: Witness Printer took 67.24ms. Allocated memory is still 308.3MB. Free memory was 234.5MB in the beginning and 230.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 01:13:57,150 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.27ms. Allocated memory is still 127.9MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.83ms. Allocated memory is still 127.9MB. Free memory was 83.6MB in the beginning and 61.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.08ms. Allocated memory is still 127.9MB. Free memory was 61.4MB in the beginning and 58.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.30ms. Allocated memory is still 127.9MB. Free memory was 58.8MB in the beginning and 57.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 666.38ms. Allocated memory is still 127.9MB. Free memory was 57.2MB in the beginning and 84.6MB in the end (delta: -27.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 195054.46ms. Allocated memory was 127.9MB in the beginning and 308.3MB in the end (delta: 180.4MB). Free memory was 84.0MB in the beginning and 234.5MB in the end (delta: -150.5MB). Peak memory consumption was 174.2MB. Max. memory is 16.1GB. * Witness Printer took 67.24ms. Allocated memory is still 308.3MB. Free memory was 234.5MB in the beginning and 230.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: 194.9s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 138.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 949 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 938 mSDsluCounter, 2182 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1673 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2588 IncrementalHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 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.0s 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, 131.5s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1510439 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s 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.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 110, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 196, TOOLS_POST_TIME: 3.9s, 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.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 110, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 13, LOOP_SUMMARIZER_CACHE_MISSES: 13, LOOP_SUMMARIZER_OVERALL_TIME: 3.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.1s, 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && 0 <= \old(len)) && 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) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && i == 0) && array == array) && r <= 16777216) && 0 <= len) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == 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 == array) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && array == array) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && \old(len) == len) && 0 <= #NULL) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && \old(len) == len) && array == array) && #NULL == 0) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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 == array && array == array) && \old(len) == len) && \old(len) == len))) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && (((((((((((((((((1 <= i && array <= 0) && array <= 0) && 0 <= len) && \result <= 0) && array <= 0) && 0 <= array) && \old(len) <= 16777216) && 0 <= array) && 0 <= \old(len)) && \old(len) <= 16777216) && 0 <= \result) && 0 <= \old(len)) && i <= 2147483647) && 0 <= array) && 0 <= array) && array <= 0) || (((((((((((((array <= 0 && array <= 0) && \result <= 0) && array <= 0) && 0 <= array) && \old(len) <= 16777216) && 0 <= array) && 0 <= \old(len)) && 0 <= \result) && i <= 0) && 0 <= i) && 0 <= array) && 0 <= array) && 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) && \old(len) <= 16777216) && 0 <= \old(len)) && i <= 2147483647) && i < len) && 0 <= i) && array == array) && r <= 16777216) && array == array) && j + 1 <= 0) && array == array) && len <= i) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && 0 <= array) && array == array) && \old(len) == len) && 0 <= array) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && 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) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && p == 0) && i == 0) && i < len) && array == array) && r <= 16777216) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == 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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #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) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == 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) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 3 == \result) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && \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) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && 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-26 01:13:57,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-26 01:13:57,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-26 01:13:57,174 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-26 01:13:57,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_130c0e9d-f005-4484-9654-561047aad3bb/bin/utaipan-ByfvJB40ur/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