./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/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_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 01:40:13,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:40:13,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:40:13,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:40:13,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:40:13,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:40:13,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:40:13,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:40:13,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:40:13,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:40:13,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:40:13,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:40:13,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:40:13,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:40:13,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:40:13,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:40:13,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:40:13,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:40:13,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:40:13,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:40:13,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:40:13,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:40:13,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:40:13,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:40:13,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:40:13,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:40:13,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:40:13,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:40:13,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:40:13,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:40:13,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:40:13,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:40:13,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:40:13,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:40:13,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:40:13,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:40:13,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:40:13,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:40:13,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:40:13,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:40:13,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:40:13,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:40:13,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:40:13,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:40:13,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:40:13,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:40:13,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:40:13,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:40:13,585 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:40:13,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:40:13,585 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:40:13,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:40:13,587 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:40:13,587 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:40:13,587 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:40:13,587 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:40:13,588 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:40:13,588 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:40:13,588 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:40:13,588 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:40:13,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:40:13,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:40:13,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:40:13,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:40:13,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:40:13,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:40:13,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:40:13,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:40:13,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:40:13,592 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:40:13,592 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:40:13,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:40:13,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:40:13,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:40:13,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:40:13,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:40:13,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:40:13,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:40:13,595 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:40:13,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:40:13,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:40:13,596 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:40:13,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:40:13,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:40:13,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:40:13,596 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_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/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_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba 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-22 01:40:13,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:40:13,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:40:13,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:40:13,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:40:13,958 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:40:13,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-22 01:40:17,179 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:40:17,547 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:40:17,548 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-11-22 01:40:17,568 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/data/ac78e8e3d/d17ca233e4da4e0dada179e66bf92938/FLAGbe720209a [2022-11-22 01:40:17,586 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/data/ac78e8e3d/d17ca233e4da4e0dada179e66bf92938 [2022-11-22 01:40:17,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:40:17,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:40:17,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:40:17,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:40:17,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:40:17,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:40:17" (1/1) ... [2022-11-22 01:40:17,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ceb2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:17, skipping insertion in model container [2022-11-22 01:40:17,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:40:17" (1/1) ... [2022-11-22 01:40:17,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:40:17,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:40:18,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:40:18,180 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:40:18,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:40:18,288 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:40:18,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18 WrapperNode [2022-11-22 01:40:18,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:40:18,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:40:18,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:40:18,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:40:18,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,341 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 102 [2022-11-22 01:40:18,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:40:18,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:40:18,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:40:18,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:40:18,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,369 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:40:18,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:40:18,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:40:18,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:40:18,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (1/1) ... [2022-11-22 01:40:18,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:40:18,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:18,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:40:18,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:40:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-22 01:40:18,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-22 01:40:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:40:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:40:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:40:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:40:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:40:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 01:40:18,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:40:18,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:40:18,633 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:40:18,635 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:40:18,898 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:40:18,960 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:40:18,960 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-22 01:40:18,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:40:18 BoogieIcfgContainer [2022-11-22 01:40:18,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:40:18,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:40:18,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:40:18,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:40:18,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:40:17" (1/3) ... [2022-11-22 01:40:18,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e94bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:40:18, skipping insertion in model container [2022-11-22 01:40:18,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:40:18" (2/3) ... [2022-11-22 01:40:18,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e94bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:40:18, skipping insertion in model container [2022-11-22 01:40:18,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:40:18" (3/3) ... [2022-11-22 01:40:18,972 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2022-11-22 01:40:18,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:40:18,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-22 01:40:19,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:40:19,053 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;@6f8646f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:40:19,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-22 01:40:19,058 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-22 01:40:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:40:19,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:19,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:19,067 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-22 01:40:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1760724867, now seen corresponding path program 1 times [2022-11-22 01:40:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333365559] [2022-11-22 01:40:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:19,439 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-22 01:40:19,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:19,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333365559] [2022-11-22 01:40:19,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333365559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:19,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:40:19,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:40:19,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426879762] [2022-11-22 01:40:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:40:19,502 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-22 01:40:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:19,713 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-22 01:40:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:40:19,716 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-22 01:40:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:19,723 INFO L225 Difference]: With dead ends: 66 [2022-11-22 01:40:19,724 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 01:40:19,727 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-22 01:40:19,730 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.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:19,731 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.2s Time] [2022-11-22 01:40:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 01:40:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2022-11-22 01:40:19,768 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-22 01:40:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-22 01:40:19,770 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2022-11-22 01:40:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:19,771 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-22 01:40:19,771 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-22 01:40:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-22 01:40:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:40:19,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:19,773 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:19,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:40:19,773 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-22 01:40:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 681145425, now seen corresponding path program 1 times [2022-11-22 01:40:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:19,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781178227] [2022-11-22 01:40:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:19,948 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-22 01:40:19,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:19,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781178227] [2022-11-22 01:40:19,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781178227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114806103] [2022-11-22 01:40:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:19,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:19,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:19,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:19,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:40:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:20,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:40:20,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:20,174 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-22 01:40:20,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:20,255 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-22 01:40:20,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114806103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:20,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [251769523] [2022-11-22 01:40:20,287 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-22 01:40:20,288 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:20,294 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:20,303 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:20,304 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:20,455 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-22 01:40:20,464 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-22 01:40:20,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:20,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:20,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:20,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:20,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:20,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:21,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:21,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:21,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:21,094 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-22 01:40:21,143 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:22,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [251769523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:22,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:22,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-11-22 01:40:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210636298] [2022-11-22 01:40:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:22,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:40:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:40:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:40:22,069 INFO L87 Difference]: Start difference. First operand 37 states and 43 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-22 01:40:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:22,839 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-11-22 01:40:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:40:22,840 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 11 [2022-11-22 01:40:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:22,841 INFO L225 Difference]: With dead ends: 50 [2022-11-22 01:40:22,841 INFO L226 Difference]: Without dead ends: 48 [2022-11-22 01:40:22,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-11-22 01:40:22,843 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:22,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 147 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:40:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-22 01:40:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2022-11-22 01:40:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 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-22 01:40:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-22 01:40:22,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2022-11-22 01:40:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:22,861 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-22 01:40:22,861 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-22 01:40:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-22 01:40:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:40:22,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:22,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:22,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:23,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-22 01:40:23,075 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-22 01:40:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 699757211, now seen corresponding path program 1 times [2022-11-22 01:40:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:23,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100537119] [2022-11-22 01:40:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:23,257 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-22 01:40:23,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:23,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100537119] [2022-11-22 01:40:23,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100537119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:23,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:40:23,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:40:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924959060] [2022-11-22 01:40:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:23,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:40:23,260 INFO L87 Difference]: Start difference. First operand 37 states and 44 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-22 01:40:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:23,344 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-11-22 01:40:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:40:23,346 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-22 01:40:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:23,350 INFO L225 Difference]: With dead ends: 42 [2022-11-22 01:40:23,350 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 01:40:23,353 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-22 01:40:23,359 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:23,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:40:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 01:40:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-22 01:40:23,386 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-22 01:40:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-22 01:40:23,394 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2022-11-22 01:40:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:23,395 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-22 01:40:23,395 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-22 01:40:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-22 01:40:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:40:23,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:23,398 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:23,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:40:23,398 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash -245286596, now seen corresponding path program 1 times [2022-11-22 01:40:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:23,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848012130] [2022-11-22 01:40:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:23,512 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-22 01:40:23,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:23,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848012130] [2022-11-22 01:40:23,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848012130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:23,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:40:23,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:40:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603019258] [2022-11-22 01:40:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:23,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:40:23,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:23,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:40:23,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:40:23,515 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-22 01:40:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:23,584 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-22 01:40:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:40:23,585 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-22 01:40:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:23,588 INFO L225 Difference]: With dead ends: 66 [2022-11-22 01:40:23,588 INFO L226 Difference]: Without dead ends: 64 [2022-11-22 01:40:23,592 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-22 01:40:23,595 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-22 01:40:23,597 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-22 01:40:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-22 01:40:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-11-22 01:40:23,626 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-22 01:40:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-22 01:40:23,631 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 14 [2022-11-22 01:40:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:23,632 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-22 01:40:23,632 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-22 01:40:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-22 01:40:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:40:23,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:23,634 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:23,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:40:23,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash -245284497, now seen corresponding path program 1 times [2022-11-22 01:40:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:23,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196855174] [2022-11-22 01:40:23,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:23,756 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-22 01:40:23,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196855174] [2022-11-22 01:40:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196855174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:23,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:40:23,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:40:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126866509] [2022-11-22 01:40:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:40:23,759 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-22 01:40:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:23,844 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-11-22 01:40:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:40:23,845 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-22 01:40:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:23,848 INFO L225 Difference]: With dead ends: 64 [2022-11-22 01:40:23,848 INFO L226 Difference]: Without dead ends: 62 [2022-11-22 01:40:23,849 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-22 01:40:23,849 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-22 01:40:23,850 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-22 01:40:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-22 01:40:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-11-22 01:40:23,878 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-22 01:40:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-11-22 01:40:23,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2022-11-22 01:40:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:23,881 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-11-22 01:40:23,882 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-22 01:40:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-11-22 01:40:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:40:23,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:23,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:23,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:40:23,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1304044262, now seen corresponding path program 1 times [2022-11-22 01:40:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:23,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129951356] [2022-11-22 01:40:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:23,990 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-22 01:40:23,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129951356] [2022-11-22 01:40:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129951356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:23,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309147555] [2022-11-22 01:40:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:23,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:24,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:40:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:24,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:40:24,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:24,140 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-22 01:40:24,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:40:24,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309147555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:24,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:40:24,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-22 01:40:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116937752] [2022-11-22 01:40:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:24,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:40:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:24,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:40:24,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:40:24,142 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-22 01:40:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:24,227 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-22 01:40:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:40:24,228 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-22 01:40:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:24,229 INFO L225 Difference]: With dead ends: 82 [2022-11-22 01:40:24,229 INFO L226 Difference]: Without dead ends: 73 [2022-11-22 01:40:24,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:40:24,230 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:24,230 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.0s Time] [2022-11-22 01:40:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-22 01:40:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-11-22 01:40:24,248 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-22 01:40:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-11-22 01:40:24,249 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 14 [2022-11-22 01:40:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:24,249 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-11-22 01:40:24,249 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-22 01:40:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-11-22 01:40:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:40:24,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:24,250 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:24,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:24,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 01:40:24,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1593505982, now seen corresponding path program 1 times [2022-11-22 01:40:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:24,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407145677] [2022-11-22 01:40:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:24,536 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-22 01:40:24,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:24,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407145677] [2022-11-22 01:40:24,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407145677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:24,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:40:24,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:40:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448841764] [2022-11-22 01:40:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:24,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:40:24,539 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-22 01:40:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:24,636 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2022-11-22 01:40:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:40:24,636 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-22 01:40:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:24,637 INFO L225 Difference]: With dead ends: 111 [2022-11-22 01:40:24,637 INFO L226 Difference]: Without dead ends: 91 [2022-11-22 01:40:24,638 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-22 01:40:24,639 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-22 01:40:24,639 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-22 01:40:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-22 01:40:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2022-11-22 01:40:24,664 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-22 01:40:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-22 01:40:24,665 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 17 [2022-11-22 01:40:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:24,665 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-22 01:40:24,665 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-22 01:40:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-22 01:40:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:40:24,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:24,667 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:24,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:40:24,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash 978495982, now seen corresponding path program 1 times [2022-11-22 01:40:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:24,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838358330] [2022-11-22 01:40:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:40:24,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:24,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838358330] [2022-11-22 01:40:24,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838358330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:24,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480650878] [2022-11-22 01:40:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:24,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:24,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:40:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:24,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:40:24,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:24,885 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-22 01:40:24,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:24,925 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-22 01:40:24,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480650878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:24,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1939260426] [2022-11-22 01:40:24,928 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:40:24,928 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:24,929 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:24,929 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:24,929 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:24,974 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-22 01:40:24,979 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-22 01:40:25,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:25,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:25,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:25,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:25,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:25,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-22 01:40:25,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:25,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:25,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:25,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:25,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-22 01:40:25,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:25,332 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 01:40:25,354 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-11-22 01:40:25,390 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:26,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1939260426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:26,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:26,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 20 [2022-11-22 01:40:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436285149] [2022-11-22 01:40:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:26,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:40:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:40:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:40:26,510 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-22 01:40:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:27,420 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-11-22 01:40:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:40:27,421 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-22 01:40:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:27,421 INFO L225 Difference]: With dead ends: 82 [2022-11-22 01:40:27,422 INFO L226 Difference]: Without dead ends: 73 [2022-11-22 01:40:27,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-11-22 01:40:27,422 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:27,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 126 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:40:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-22 01:40:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-11-22 01:40:27,443 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-22 01:40:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-11-22 01:40:27,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 17 [2022-11-22 01:40:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:27,444 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-11-22 01:40:27,445 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-22 01:40:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-11-22 01:40:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:40:27,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:27,451 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:27,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:27,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:27,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 904044068, now seen corresponding path program 1 times [2022-11-22 01:40:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:27,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665264203] [2022-11-22 01:40:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:27,740 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-22 01:40:27,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:27,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665264203] [2022-11-22 01:40:27,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665264203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:27,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430185875] [2022-11-22 01:40:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:27,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:27,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:40:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:27,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:40:27,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:27,862 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-22 01:40:27,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:40:27,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430185875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:27,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:40:27,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-22 01:40:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069712141] [2022-11-22 01:40:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:27,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:27,864 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-22 01:40:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:27,925 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-22 01:40:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:40:27,926 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-22 01:40:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:27,927 INFO L225 Difference]: With dead ends: 76 [2022-11-22 01:40:27,927 INFO L226 Difference]: Without dead ends: 49 [2022-11-22 01:40:27,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:40:27,930 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-22 01:40:27,930 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-22 01:40:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-22 01:40:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-22 01:40:27,941 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-22 01:40:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-22 01:40:27,943 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2022-11-22 01:40:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:27,943 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-22 01:40:27,944 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-22 01:40:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-22 01:40:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:40:27,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:27,945 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-22 01:40:27,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:28,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:28,152 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-22 01:40:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1125078776, now seen corresponding path program 1 times [2022-11-22 01:40:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:28,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322128587] [2022-11-22 01:40:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:28,260 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-22 01:40:28,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:28,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322128587] [2022-11-22 01:40:28,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322128587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:28,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476372055] [2022-11-22 01:40:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:28,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:28,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:40:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:28,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:40:28,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:28,403 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-22 01:40:28,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:40:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476372055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:28,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:40:28,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-22 01:40:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851344721] [2022-11-22 01:40:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:28,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:40:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:40:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:28,405 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-22 01:40:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:28,461 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-11-22 01:40:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:40:28,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 25 [2022-11-22 01:40:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:28,464 INFO L225 Difference]: With dead ends: 47 [2022-11-22 01:40:28,464 INFO L226 Difference]: Without dead ends: 46 [2022-11-22 01:40:28,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:40:28,465 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:28,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:40:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-22 01:40:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-22 01:40:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 40 states have internal predecessors, (46), 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-22 01:40:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-22 01:40:28,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 25 [2022-11-22 01:40:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:28,483 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-22 01:40:28,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-22 01:40:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-22 01:40:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:40:28,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:28,484 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:28,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 01:40:28,690 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1125080875, now seen corresponding path program 1 times [2022-11-22 01:40:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:28,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986824105] [2022-11-22 01:40:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:28,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 01:40:28,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986824105] [2022-11-22 01:40:28,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986824105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:28,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995946067] [2022-11-22 01:40:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:28,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:28,830 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:28,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:40:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:28,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:40:28,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:40:29,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:40:29,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995946067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:29,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1038626807] [2022-11-22 01:40:29,103 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-22 01:40:29,103 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:29,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:29,103 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:29,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:29,142 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-22 01:40:29,147 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-22 01:40:29,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:29,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 15 treesize of output 11 [2022-11-22 01:40:29,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,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-22 01:40:29,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:29,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 23 treesize of output 1 [2022-11-22 01:40:29,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:29,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:29,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:29,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:30,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:30,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:30,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:30,347 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-22 01:40:30,421 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:32,871 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2228#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#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) (not (<= |ULTIMATE.start_alloc_17_#t~post38#1| 2147483646)) (<= 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-22 01:40:32,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:40:32,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:32,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-11-22 01:40:32,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963214916] [2022-11-22 01:40:32,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:32,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:40:32,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:32,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:40:32,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-22 01:40:32,874 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-22 01:40:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:33,255 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-11-22 01:40:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:40:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 25 [2022-11-22 01:40:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:33,256 INFO L225 Difference]: With dead ends: 156 [2022-11-22 01:40:33,256 INFO L226 Difference]: Without dead ends: 129 [2022-11-22 01:40:33,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2022-11-22 01:40:33,258 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 131 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:33,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 278 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:40:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-22 01:40:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 61. [2022-11-22 01:40:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 states have internal predecessors, (63), 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-22 01:40:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-11-22 01:40:33,271 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 25 [2022-11-22 01:40:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:33,271 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-11-22 01:40:33,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-22 01:40:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-11-22 01:40:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:40:33,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:33,273 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-22 01:40:33,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:33,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:33,479 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-22 01:40:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash -782412162, now seen corresponding path program 1 times [2022-11-22 01:40:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:33,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497127838] [2022-11-22 01:40:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:33,560 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-22 01:40:33,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:33,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497127838] [2022-11-22 01:40:33,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497127838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:33,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340479994] [2022-11-22 01:40:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:33,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:33,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:33,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:33,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:40:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:33,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:40:33,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:33,758 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-22 01:40:33,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:33,865 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-22 01:40:33,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340479994] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:33,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [261187197] [2022-11-22 01:40:33,871 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-22 01:40:33,871 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:33,871 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:33,872 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:33,872 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:33,928 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-22 01:40:33,934 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-22 01:40:34,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:34,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:34,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:34,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-22 01:40:34,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:34,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:34,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:34,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:34,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-22 01:40:34,436 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-22 01:40:34,516 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-22 01:40:34,516 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-22 01:40:34,640 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-22 01:40:34,761 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-22 01:40:34,916 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-22 01:40:35,019 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:39,141 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2709#(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-22 01:40:39,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:40:39,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2022-11-22 01:40:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459349946] [2022-11-22 01:40:39,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 01:40:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 01:40:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2022-11-22 01:40:39,143 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 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-22 01:40:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:39,433 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-11-22 01:40:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:40:39,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 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 25 [2022-11-22 01:40:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:39,434 INFO L225 Difference]: With dead ends: 80 [2022-11-22 01:40:39,435 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 01:40:39,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2022-11-22 01:40:39,436 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:39,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 247 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:40:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 01:40:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-11-22 01:40:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 49 states have internal predecessors, (57), 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-22 01:40:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-22 01:40:39,449 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 25 [2022-11-22 01:40:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:39,450 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-22 01:40:39,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 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-22 01:40:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-22 01:40:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 01:40:39,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:39,451 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] [2022-11-22 01:40:39,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:39,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 01:40:39,663 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-22 01:40:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash -493373628, now seen corresponding path program 1 times [2022-11-22 01:40:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:39,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673821354] [2022-11-22 01:40:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:39,769 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-22 01:40:39,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:39,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673821354] [2022-11-22 01:40:39,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673821354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:39,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835962540] [2022-11-22 01:40:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:39,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:39,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:39,771 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:39,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:40:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:39,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:40:39,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:40:39,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:40:39,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835962540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:39,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:40:39,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 01:40:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487126856] [2022-11-22 01:40:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:40:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:40:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:40:39,916 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-22 01:40:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:39,992 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-11-22 01:40:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:40:39,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 29 [2022-11-22 01:40:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:39,993 INFO L225 Difference]: With dead ends: 67 [2022-11-22 01:40:39,993 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 01:40:39,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 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-22 01:40:39,994 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:39,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 71 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:40:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 01:40:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-22 01:40:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 47 states have internal predecessors, (55), 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-22 01:40:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-22 01:40:40,010 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 29 [2022-11-22 01:40:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:40,012 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-22 01:40:40,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-22 01:40:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-22 01:40:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 01:40:40,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:40,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:40,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:40,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 01:40:40,221 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 503949472, now seen corresponding path program 1 times [2022-11-22 01:40:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:40,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527876855] [2022-11-22 01:40:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 01:40:40,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:40,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527876855] [2022-11-22 01:40:40,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527876855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:40,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640339835] [2022-11-22 01:40:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:40,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:40,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:40,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:40,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:40:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:40,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:40:40,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-22 01:40:40,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:40:40,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640339835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:40,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:40:40,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 01:40:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455609856] [2022-11-22 01:40:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:40,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:40:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:40:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:40:40,479 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-22 01:40:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:40,539 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-22 01:40:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:40:40,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 29 [2022-11-22 01:40:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:40,540 INFO L225 Difference]: With dead ends: 54 [2022-11-22 01:40:40,540 INFO L226 Difference]: Without dead ends: 53 [2022-11-22 01:40:40,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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-22 01:40:40,541 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 101 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:40,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 101 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:40:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-22 01:40:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-22 01:40:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 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-22 01:40:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-22 01:40:40,554 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 29 [2022-11-22 01:40:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:40,554 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-22 01:40:40,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-22 01:40:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-22 01:40:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 01:40:40,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:40,555 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-22 01:40:40,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:40,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 01:40:40,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1685648934, now seen corresponding path program 1 times [2022-11-22 01:40:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:40,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907457026] [2022-11-22 01:40:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:40,952 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-22 01:40:40,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907457026] [2022-11-22 01:40:40,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907457026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:40,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124844918] [2022-11-22 01:40:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:40,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:40,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:40:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:41,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:40:41,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:41,120 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-22 01:40:41,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:41,189 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-22 01:40:41,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124844918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:41,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925686292] [2022-11-22 01:40:41,192 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-22 01:40:41,192 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:41,192 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:41,193 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:41,193 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:41,228 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-22 01:40:41,233 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-22 01:40:41,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-22 01:40:41,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:41,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:41,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:41,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 23 treesize of output 1 [2022-11-22 01:40:41,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-22 01:40:41,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:41,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-22 01:40:41,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:41,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:41,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:41,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:41,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-22 01:40:41,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:41,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:42,111 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-22 01:40:42,119 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-22 01:40:42,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 23 treesize of output 1 [2022-11-22 01:40:42,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-22 01:40:42,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 23 treesize of output 1 [2022-11-22 01:40:42,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:42,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:42,312 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-11-22 01:40:42,412 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:45,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1925686292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:45,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 6, 6] total 30 [2022-11-22 01:40:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553164067] [2022-11-22 01:40:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:45,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 01:40:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 01:40:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-11-22 01:40:45,698 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-22 01:40:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:47,784 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-11-22 01:40:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 01:40:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 31 [2022-11-22 01:40:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:47,786 INFO L225 Difference]: With dead ends: 78 [2022-11-22 01:40:47,786 INFO L226 Difference]: Without dead ends: 75 [2022-11-22 01:40:47,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2022-11-22 01:40:47,787 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 116 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:47,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 63 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:40:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-22 01:40:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2022-11-22 01:40:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 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-22 01:40:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-22 01:40:47,803 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 31 [2022-11-22 01:40:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:47,804 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-22 01:40:47,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-22 01:40:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-22 01:40:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 01:40:47,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:47,805 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:40:47,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:48,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:48,007 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-11-22 01:40:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1035856853, now seen corresponding path program 2 times [2022-11-22 01:40:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:48,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472998682] [2022-11-22 01:40:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:40:48,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472998682] [2022-11-22 01:40:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472998682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257796704] [2022-11-22 01:40:48,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:40:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:48,213 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:48,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:40:48,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:40:48,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:40:48,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:40:48,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 01:40:48,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 01:40:48,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257796704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:48,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053621169] [2022-11-22 01:40:48,465 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-22 01:40:48,466 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:48,466 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:48,467 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:48,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:48,510 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-22 01:40:48,517 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-22 01:40:48,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:48,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:48,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:48,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:48,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-22 01:40:48,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-22 01:40:48,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-22 01:40:48,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:48,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:48,983 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-22 01:40:49,068 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-22 01:40:49,069 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-22 01:40:49,171 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-22 01:40:49,266 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-22 01:40:49,398 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-22 01:40:49,467 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:53,426 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4044#(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-22 01:40:53,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:40:53,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:53,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 19 [2022-11-22 01:40:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200585049] [2022-11-22 01:40:53,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:40:53,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 01:40:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 01:40:53,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 01:40:53,428 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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-22 01:40:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:40:53,848 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-11-22 01:40:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:40:53,848 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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 31 [2022-11-22 01:40:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:40:53,849 INFO L225 Difference]: With dead ends: 87 [2022-11-22 01:40:53,849 INFO L226 Difference]: Without dead ends: 60 [2022-11-22 01:40:53,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=297, Invalid=2153, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 01:40:53,851 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:40:53,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 201 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:40:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-22 01:40:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2022-11-22 01:40:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-22 01:40:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-22 01:40:53,861 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2022-11-22 01:40:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:40:53,862 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-22 01:40:53,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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-22 01:40:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-22 01:40:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:40:53,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:40:53,863 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] [2022-11-22 01:40:53,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 01:40:54,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 01:40:54,068 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-22 01:40:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:40:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash -409649550, now seen corresponding path program 1 times [2022-11-22 01:40:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:40:54,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959805312] [2022-11-22 01:40:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:40:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:40:54,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:40:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959805312] [2022-11-22 01:40:54,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959805312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:40:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216941690] [2022-11-22 01:40:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:40:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:40:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:40:54,192 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:40:54,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 01:40:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:40:54,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 01:40:54,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:40:54,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:40:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 01:40:54,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216941690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:40:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412191525] [2022-11-22 01:40:54,438 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-22 01:40:54,439 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:40:54,439 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:40:54,439 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:40:54,439 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:40:54,482 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-22 01:40:54,486 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-22 01:40:54,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-22 01:40:54,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:54,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 01:40:54,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:54,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-22 01:40:54,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:54,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:54,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-22 01:40:54,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 23 treesize of output 1 [2022-11-22 01:40:54,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:54,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:54,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-22 01:40:55,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,350 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-22 01:40:55,358 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-22 01:40:55,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:55,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,454 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-22 01:40:55,476 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 0 case distinctions, treesize of input 42 treesize of output 33 [2022-11-22 01:40:55,498 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 01:40:55,498 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-22 01:40:55,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 23 treesize of output 1 [2022-11-22 01:40:55,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,607 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-22 01:40:55,618 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-22 01:40:55,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:55,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-22 01:40:55,703 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-22 01:40:55,712 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-22 01:40:55,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 15 treesize of output 11 [2022-11-22 01:40:55,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 23 treesize of output 1 [2022-11-22 01:40:55,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-22 01:40:55,880 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-11-22 01:40:55,994 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:40:58,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [412191525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:40:58,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:40:58,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [8, 8, 8] total 27 [2022-11-22 01:40:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263090778] [2022-11-22 01:40:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:40:58,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 01:40:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:40:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 01:40:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-11-22 01:40:58,779 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-22 01:41:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:41:00,627 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-11-22 01:41:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 01:41:00,628 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 34 [2022-11-22 01:41:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:41:00,628 INFO L225 Difference]: With dead ends: 35 [2022-11-22 01:41:00,628 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:41:00,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2022-11-22 01:41:00,630 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:41:00,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:41:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:41:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:41:00,631 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-22 01:41:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:41:00,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-11-22 01:41:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:41:00,631 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:41:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-22 01:41:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:41:00,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:41:00,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-11-22 01:41:00,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-11-22 01:41:00,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-11-22 01:41:00,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-11-22 01:41:00,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-11-22 01:41:00,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-11-22 01:41:00,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-11-22 01:41:00,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-11-22 01:41:00,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-11-22 01:41:00,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-11-22 01:41:00,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-22 01:41:00,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 01:41:00,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 01:41:56,830 WARN L233 SmtUtils]: Spent 55.99s on a formula simplification. DAG size of input: 216 DAG size of output: 216 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 01:42:14,703 WARN L233 SmtUtils]: Spent 17.80s on a formula simplification. DAG size of input: 150 DAG size of output: 151 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 01:42:19,400 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-22 01:42:19,401 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-22 01:42:19,401 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-22 01:42:19,401 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-22 01:42:19,402 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,402 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-22 01:42:19,402 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-22 01:42:19,402 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2022-11-22 01:42:19,402 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-22 01:42:19,402 INFO L899 garLoopResultBuilder]: For program point L780-3(line 780) no Hoare annotation was computed. [2022-11-22 01:42:19,403 INFO L899 garLoopResultBuilder]: For program point L780-4(line 780) no Hoare annotation was computed. [2022-11-22 01:42:19,403 INFO L895 garLoopResultBuilder]: At program point L780-5(lines 780 782) the Hoare annotation is: (let ((.cse16 (<= |ULTIMATE.start_free_17_~len#1| 1)) (.cse18 (<= |ULTIMATE.start_entry_point_~len~0#1| 1)) (.cse19 (<= |ULTIMATE.start_entry_point_~i~2#1| 1)) (.cse14 (= |ULTIMATE.start_free_17_~i~1#1| 0)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse20 (<= 1 |ULTIMATE.start_free_17_~i~1#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse21 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.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)) (.cse22 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse23 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse24 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse25 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse26 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216)) (.cse27 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse17 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse28 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse8 (<= |#NULL.offset| 0)) (.cse9 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse29 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216)) (.cse10 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse30 (<= 0 |ULTIMATE.start_alloc_17_~len#1|)) (.cse31 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse32 (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (.cse11 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse12 (<= 0 |#NULL.offset|)) (.cse13 (<= 0 |#StackHeapBarrier|)) (.cse15 (= |#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 (= |ULTIMATE.start_free_17_~array#1.base| |ULTIMATE.start_free_17_#in~array#1.base|) .cse7 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_alloc_17_#res#1| 0) .cse8 (= |ULTIMATE.start_free_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse9 .cse10 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_free_17_#in~array#1.base|) .cse11 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_free_17_#in~len#1| |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse12 (= |ULTIMATE.start_free_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse13 .cse14 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) (= |ULTIMATE.start_free_17_#in~array#1.offset| |ULTIMATE.start_free_17_~array#1.offset|) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse17 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse7 (<= |ULTIMATE.start_free_17_~len#1| 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse17 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_free_17_~i~1#1| 1) .cse13 .cse19 .cse15) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse22 .cse23 .cse24 .cse6 .cse25 .cse26 .cse27 .cse17 .cse7 .cse28 .cse8 .cse9 .cse29 .cse10 .cse30 .cse31 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse22 .cse23 .cse24 .cse6 .cse25 .cse26 .cse27 .cse17 .cse7 .cse28 .cse8 .cse9 .cse29 .cse10 .cse30 .cse31 .cse32 .cse11 .cse12 .cse13 .cse15))) [2022-11-22 01:42:19,403 INFO L899 garLoopResultBuilder]: For program point L772(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,403 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-11-22 01:42:19,404 INFO L899 garLoopResultBuilder]: For program point L772-4(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,404 INFO L899 garLoopResultBuilder]: For program point L772-5(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,404 INFO L895 garLoopResultBuilder]: At program point L772-6(lines 772 775) the Hoare annotation is: (let ((.cse26 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1))) (let ((.cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse17 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse18 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse12 (<= .cse26 0)) (.cse19 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse20 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|)) (.cse21 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse22 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse23 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.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)) (.cse24 (= |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)) (.cse25 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse9 (<= |#NULL.offset| 0)) (.cse27 (< |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)) (.cse28 (< |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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse18 .cse12 .cse19 .cse20 .cse13 .cse21 .cse22 .cse14 .cse15 .cse23 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse25 .cse8 (= .cse26 |ULTIMATE.start_alloc_17_~i~0#1|) .cse9 .cse27 .cse17 .cse10 .cse11 .cse18 .cse12 .cse28 .cse19 .cse20 .cse13 .cse21 .cse22 .cse14 .cse15 .cse23 .cse16) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (<= 0 .cse26) .cse24 (<= |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 .cse25 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) .cse9 .cse27 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse11 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse28 .cse13 .cse14 .cse15 .cse16)))) [2022-11-22 01:42:19,404 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 796) no Hoare annotation was computed. [2022-11-22 01:42:19,404 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-11-22 01:42:19,405 INFO L899 garLoopResultBuilder]: For program point L765-3(line 765) no Hoare annotation was computed. [2022-11-22 01:42:19,405 INFO L899 garLoopResultBuilder]: For program point L765-4(line 765) no Hoare annotation was computed. [2022-11-22 01:42:19,405 INFO L895 garLoopResultBuilder]: At program point L765-5(lines 765 769) the Hoare annotation is: (let ((.cse6 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse8 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse10 (<= 0 |ULTIMATE.start_alloc_17_~len#1|)) (.cse12 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.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)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse9 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse13 (= |~#ldv_global_msg_list~0.base| 1)) (.cse14 (= |#NULL.offset| 0)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse6 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse7 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse8 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse9 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse9 .cse10 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse12 (= |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 .cse14 (= |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|) .cse15 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse16) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~i~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 1) .cse9 .cse11 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse16 (<= |ULTIMATE.start_alloc_17_~len#1| 1)))) [2022-11-22 01:42:19,405 INFO L899 garLoopResultBuilder]: For program point L790-3(line 790) no Hoare annotation was computed. [2022-11-22 01:42:19,405 INFO L899 garLoopResultBuilder]: For program point L790-4(line 790) no Hoare annotation was computed. [2022-11-22 01:42:19,406 INFO L895 garLoopResultBuilder]: At program point L790-5(lines 790 792) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= 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) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-22 01:42:19,406 INFO L895 garLoopResultBuilder]: At program point L766(line 766) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse7 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse9 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse10 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse11 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|)) (.cse14 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse15 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse17 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.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_ldv_positive_#res#1|)) (.cse4 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse19 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse5 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse20 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse21 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse8 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse22 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse12 (= |~#ldv_global_msg_list~0.base| 1)) (.cse13 (= |#NULL.offset| 0)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse18 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse18) (and .cse1 .cse2 .cse3 .cse19 .cse5 .cse20 .cse6 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse3 .cse4 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse19 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse5 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse20 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse21 .cse8 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse22 .cse12 .cse13 .cse16 .cse18))) [2022-11-22 01:42:19,406 INFO L899 garLoopResultBuilder]: For program point L766-1(line 766) no Hoare annotation was computed. [2022-11-22 01:42:19,406 INFO L899 garLoopResultBuilder]: For program point L767(line 767) no Hoare annotation was computed. [2022-11-22 01:42:19,407 INFO L895 garLoopResultBuilder]: At program point L767-1(lines 761 777) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse16 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse18 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse19 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|)) (.cse21 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse22 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse25 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (= |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)) (.cse6 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse11 (<= |#NULL.offset| 0)) (.cse12 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse14 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse15 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse17 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse20 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse23 (<= 0 |#NULL.offset|)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse8 .cse10 .cse11 .cse14 .cse15 .cse20 .cse23 .cse24 .cse26) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse7 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) .cse8 .cse9 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse11 .cse12 .cse14 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse15 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse17 .cse20 .cse23 .cse24 .cse26))) [2022-11-22 01:42:19,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,407 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 797) no Hoare annotation was computed. [2022-11-22 01:42:19,407 INFO L895 garLoopResultBuilder]: At program point L776(lines 761 777) the Hoare annotation is: (let ((.cse7 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.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)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse12 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse13 (<= 0 |#NULL.offset|)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (= |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|) .cse6 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) .cse7 .cse8 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse9 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse11 (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_entry_point_~len~0#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_entry_point_~i~2#1| 1) .cse15) (and (not (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_alloc_17_#res#1| 0) .cse9 (= |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|) (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) .cse12 (= |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|) .cse13 .cse14 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) (<= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-22 01:42:19,408 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 01:42:19,408 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,408 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-11-22 01:42:19,408 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-11-22 01:42:19,411 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:42:19,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:42:19,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:42:19 BoogieIcfgContainer [2022-11-22 01:42:19,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:42:19,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:42:19,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:42:19,482 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:42:19,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:40:18" (3/4) ... [2022-11-22 01:42:19,485 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:42:19,495 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-22 01:42:19,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-22 01:42:19,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-22 01:42:19,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-22 01:42:19,531 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 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 [2022-11-22 01:42:19,532 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((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) && #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) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #NULL == 0)) || (((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 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-22 01:42:19,533 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 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) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && j + 1 <= 0) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #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) && j + 1 <= 0) && 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-22 01:42:19,533 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)) || ((((((((((((((((0 <= len && \result <= 16777216) && i <= 1) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 1) && r <= 16777216) && 1 <= i) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && len <= 1) [2022-11-22 01:42:19,533 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) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && len < 16777216) && 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) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #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) && ldv_global_msg_list == 0) && len <= 0) && i <= 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) [2022-11-22 01:42:19,534 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) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && i <= 1) && #NULL == 0)) || ((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 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)) || ((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #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) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && 1 <= i) && \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)) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-22 01:42:19,552 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:42:19,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:42:19,553 INFO L158 Benchmark]: Toolchain (without parser) took 121960.51ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 145.9MB in the beginning and 159.5MB in the end (delta: -13.6MB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,554 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 119.5MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:42:19,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.51ms. Allocated memory is still 180.4MB. Free memory was 145.9MB in the beginning and 123.5MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.12ms. Allocated memory is still 180.4MB. Free memory was 123.5MB in the beginning and 121.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,556 INFO L158 Benchmark]: Boogie Preprocessor took 30.30ms. Allocated memory is still 180.4MB. Free memory was 121.2MB in the beginning and 119.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,561 INFO L158 Benchmark]: RCFGBuilder took 589.97ms. Allocated memory is still 180.4MB. Free memory was 119.4MB in the beginning and 100.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,561 INFO L158 Benchmark]: TraceAbstraction took 120514.85ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 99.8MB in the beginning and 163.7MB in the end (delta: -64.0MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,562 INFO L158 Benchmark]: Witness Printer took 71.49ms. Allocated memory is still 377.5MB. Free memory was 163.7MB in the beginning and 159.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:42:19,568 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.22ms. Allocated memory is still 119.5MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.51ms. Allocated memory is still 180.4MB. Free memory was 145.9MB in the beginning and 123.5MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.12ms. Allocated memory is still 180.4MB. Free memory was 123.5MB in the beginning and 121.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.30ms. Allocated memory is still 180.4MB. Free memory was 121.2MB in the beginning and 119.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 589.97ms. Allocated memory is still 180.4MB. Free memory was 119.4MB in the beginning and 100.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 120514.85ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 99.8MB in the beginning and 163.7MB in the end (delta: -64.0MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. * Witness Printer took 71.49ms. Allocated memory is still 377.5MB. Free memory was 163.7MB in the beginning and 159.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 120.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 78.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 744 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 738 mSDsluCounter, 1884 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1467 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1893 IncrementalHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 417 mSDtfsCounter, 1893 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 460 SyntacticMatches, 27 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 24.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 247 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 16 PreInvPairs, 52 NumberOfFragments, 2029 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1291 FormulaSimplificationTreeSizeReduction, 74.2s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1779112 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 650 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 1610 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1871 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 231/306 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: 4.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 67, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 116, TOOLS_POST_TIME: 2.3s, TOOLS_POST_CALL_APPLICATIONS: 26, TOOLS_POST_CALL_TIME: 0.8s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 159, TOOLS_QUANTIFIERELIM_TIME: 3.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 261, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 23, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 16, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 67, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 1.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 16, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, 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: 935, DAG_COMPRESSION_RETAINED_NODES: 223, 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)) || ((((((((((((((((0 <= len && \result <= 16777216) && i <= 1) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 1) && r <= 16777216) && 1 <= i) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #NULL == 0) && len <= 1) - 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) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && i <= 1) && #NULL == 0)) || ((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 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)) || ((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && len <= 1) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #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) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && 1 <= i) && \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)) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((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) && #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) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #NULL == 0)) || (((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 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) && 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)) && #NULL <= 0) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && len < 16777216) && 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) && ldv_global_msg_list == 0) && i <= 2147483647) && len <= 16777216) && #NULL <= 0) && len <= 1) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i <= 1) && #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) && ldv_global_msg_list == 0) && len <= 0) && i <= 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) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && i <= 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) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && j + 1 <= 0) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && i <= 1) && #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) && j + 1 <= 0) && 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 Derived loop invariant: (((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 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 RESULT: Ultimate proved your program to be correct! [2022-11-22 01:42:19,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7af58dd5-2e70-4fd6-b2cd-2a5d7d9708f5/bin/utaipan-g80aRyZoba/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