./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:50:33,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:50:33,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:50:33,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:50:33,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:50:33,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:50:33,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:50:33,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:50:33,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:50:33,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:50:33,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:50:33,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:50:33,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:50:33,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:50:33,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:50:33,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:50:33,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:50:33,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:50:33,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:50:33,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:50:33,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:50:33,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:50:33,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:50:33,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:50:33,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:50:33,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:50:33,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:50:33,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:50:33,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:50:33,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:50:33,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:50:33,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:50:33,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:50:33,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:50:33,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:50:33,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:50:33,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:50:33,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:50:33,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:50:33,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:50:33,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:50:33,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:50:33,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:50:33,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:50:33,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:50:33,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:50:33,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:50:33,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:50:33,395 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:50:33,396 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:50:33,396 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:50:33,396 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:50:33,396 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:50:33,396 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:50:33,396 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:50:33,397 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:50:33,397 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:50:33,397 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:50:33,397 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:50:33,397 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:50:33,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:50:33,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:50:33,398 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:50:33,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:50:33,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:50:33,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:50:33,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:50:33,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:50:33,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:50:33,400 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:50:33,400 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:50:33,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:50:33,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:50:33,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:50:33,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:50:33,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:50:33,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:50:33,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:50:33,401 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:50:33,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:50:33,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:50:33,402 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:50:33,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:50:33,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:50:33,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:50:33,403 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_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2022-11-25 23:50:33,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:50:33,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:50:33,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:50:33,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:50:33,709 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:50:33,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-11-25 23:50:36,845 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:50:37,167 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:50:37,168 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-11-25 23:50:37,184 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/data/3163a7f6f/c5a30a79a3234eff90d706764c9781ae/FLAGcec1e8368 [2022-11-25 23:50:37,199 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/data/3163a7f6f/c5a30a79a3234eff90d706764c9781ae [2022-11-25 23:50:37,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:50:37,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:50:37,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:50:37,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:50:37,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:50:37,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d096e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37, skipping insertion in model container [2022-11-25 23:50:37,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:50:37,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:50:37,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:50:37,778 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:50:37,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:50:37,884 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:50:37,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37 WrapperNode [2022-11-25 23:50:37,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:50:37,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:50:37,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:50:37,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:50:37,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,937 INFO L138 Inliner]: procedures = 165, calls = 76, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 72 [2022-11-25 23:50:37,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:50:37,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:50:37,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:50:37,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:50:37,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:50:37,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:50:37,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:50:37,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:50:37,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (1/1) ... [2022-11-25 23:50:37,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:50:37,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:38,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:50:38,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:50:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 23:50:38,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:50:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:50:38,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:50:38,204 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:50:38,206 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:50:38,461 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:50:38,547 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:50:38,563 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 23:50:38,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:38 BoogieIcfgContainer [2022-11-25 23:50:38,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:50:38,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:50:38,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:50:38,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:50:38,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:50:37" (1/3) ... [2022-11-25 23:50:38,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f509ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:50:38, skipping insertion in model container [2022-11-25 23:50:38,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:37" (2/3) ... [2022-11-25 23:50:38,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f509ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:50:38, skipping insertion in model container [2022-11-25 23:50:38,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:38" (3/3) ... [2022-11-25 23:50:38,591 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3.i [2022-11-25 23:50:38,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:50:38,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 23:50:38,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:50:38,741 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;@461ae785, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:50:38,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 23:50:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 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-25 23:50:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:50:38,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:38,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:38,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1080968487, now seen corresponding path program 1 times [2022-11-25 23:50:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:38,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180849248] [2022-11-25 23:50:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:39,129 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-25 23:50:39,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:39,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180849248] [2022-11-25 23:50:39,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180849248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:39,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253744689] [2022-11-25 23:50:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:39,207 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 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-25 23:50:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:39,339 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-25 23:50:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:39,343 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-25 23:50:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:39,351 INFO L225 Difference]: With dead ends: 56 [2022-11-25 23:50:39,352 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 23:50:39,355 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-25 23:50:39,363 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:39,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 23:50:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2022-11-25 23:50:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 27 states have internal predecessors, (31), 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-25 23:50:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-25 23:50:39,425 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 8 [2022-11-25 23:50:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:39,425 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-25 23:50:39,426 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-25 23:50:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-25 23:50:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:50:39,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:39,428 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:39,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:50:39,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -532530515, now seen corresponding path program 1 times [2022-11-25 23:50:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:39,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159781166] [2022-11-25 23:50:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:39,748 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-25 23:50:39,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:39,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159781166] [2022-11-25 23:50:39,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159781166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:39,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304578506] [2022-11-25 23:50:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:39,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:39,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:39,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:39,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:50:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:50:39,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:39,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:50:39,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304578506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:39,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:50:39,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 23:50:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699812529] [2022-11-25 23:50:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:39,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:39,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:39,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:39,990 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:50:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:40,079 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-25 23:50:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:40,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-25 23:50:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:40,085 INFO L225 Difference]: With dead ends: 48 [2022-11-25 23:50:40,085 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:50:40,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:50:40,086 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:40,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:50:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-11-25 23:50:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:50:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-25 23:50:40,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-25 23:50:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:40,094 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-25 23:50:40,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:50:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-25 23:50:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:50:40,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:40,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:40,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 23:50:40,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:40,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 671423276, now seen corresponding path program 1 times [2022-11-25 23:50:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:40,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319509432] [2022-11-25 23:50:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:40,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:40,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319509432] [2022-11-25 23:50:40,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319509432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37179112] [2022-11-25 23:50:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:40,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:40,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:50:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:40,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:50:40,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:40,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:40,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37179112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1089276593] [2022-11-25 23:50:40,827 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:50:40,827 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:40,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:40,847 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:40,848 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:41,048 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-25 23:50:41,061 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-25 23:50:41,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:41,394 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:50:41,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-11-25 23:50:41,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:41,453 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:50:41,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:50:41,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:41,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:41,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:41,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:41,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:41,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:41,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:41,904 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-25 23:50:41,959 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1089276593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:43,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:43,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-11-25 23:50:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281004549] [2022-11-25 23:50:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:43,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:50:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:50:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:50:43,061 INFO L87 Difference]: Start difference. First operand 30 states and 34 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-25 23:50:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:44,190 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-11-25 23:50:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:50:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-25 23:50:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:44,193 INFO L225 Difference]: With dead ends: 34 [2022-11-25 23:50:44,194 INFO L226 Difference]: Without dead ends: 33 [2022-11-25 23:50:44,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:50:44,195 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:44,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-25 23:50:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-11-25 23:50:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 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-25 23:50:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-11-25 23:50:44,217 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2022-11-25 23:50:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:44,217 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-11-25 23:50:44,218 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-25 23:50:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-11-25 23:50:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:50:44,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:44,220 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:44,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 23:50:44,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:44,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1667624743, now seen corresponding path program 1 times [2022-11-25 23:50:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:44,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813049552] [2022-11-25 23:50:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:44,538 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-25 23:50:44,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:44,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813049552] [2022-11-25 23:50:44,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813049552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:44,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:44,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330144661] [2022-11-25 23:50:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:44,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:44,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:44,547 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-25 23:50:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:44,597 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-11-25 23:50:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-25 23:50:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:44,599 INFO L225 Difference]: With dead ends: 50 [2022-11-25 23:50:44,599 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 23:50:44,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:44,601 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:44,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 23:50:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-25 23:50:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 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-25 23:50:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-11-25 23:50:44,613 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 14 [2022-11-25 23:50:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:44,613 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-11-25 23:50:44,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-25 23:50:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-11-25 23:50:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:50:44,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:44,615 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:44,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:50:44,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -647673377, now seen corresponding path program 1 times [2022-11-25 23:50:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:44,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3959558] [2022-11-25 23:50:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:50:44,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:44,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3959558] [2022-11-25 23:50:44,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3959558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:44,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:44,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188958652] [2022-11-25 23:50:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:44,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:44,706 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 4.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-25 23:50:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:44,769 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-11-25 23:50:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:44,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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-25 23:50:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:44,771 INFO L225 Difference]: With dead ends: 46 [2022-11-25 23:50:44,771 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 23:50:44,772 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-25 23:50:44,773 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:44,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 23:50:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-11-25 23:50:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 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-25 23:50:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-25 23:50:44,788 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 17 [2022-11-25 23:50:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:44,788 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-25 23:50:44,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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-25 23:50:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-25 23:50:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:50:44,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:44,790 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:44,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:50:44,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1893067609, now seen corresponding path program 1 times [2022-11-25 23:50:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:44,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196586195] [2022-11-25 23:50:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:50:44,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:44,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196586195] [2022-11-25 23:50:44,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196586195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:44,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:44,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352588340] [2022-11-25 23:50:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:44,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:44,860 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-25 23:50:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:44,914 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-25 23:50:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-11-25 23:50:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:44,916 INFO L225 Difference]: With dead ends: 43 [2022-11-25 23:50:44,916 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 23:50:44,916 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-25 23:50:44,917 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:44,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 23:50:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-25 23:50:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.3333333333333333) 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-25 23:50:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-25 23:50:44,937 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2022-11-25 23:50:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:44,937 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-25 23:50:44,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-25 23:50:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-25 23:50:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:50:44,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:44,940 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-25 23:50:44,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:50:44,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1374365312, now seen corresponding path program 1 times [2022-11-25 23:50:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:44,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474817244] [2022-11-25 23:50:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:50:45,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:45,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474817244] [2022-11-25 23:50:45,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474817244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:45,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955930103] [2022-11-25 23:50:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:45,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:45,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:45,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:50:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:45,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:50:45,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:50:45,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:50:45,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955930103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:45,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729949369] [2022-11-25 23:50:45,345 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:50:45,345 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:45,346 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:45,346 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:45,346 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:45,385 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-25 23:50:45,391 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-25 23:50:45,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:45,560 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:50:45,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:50:45,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:45,592 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:50:45,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-11-25 23:50:45,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:45,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:45,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:45,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:46,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:46,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:46,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:46,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:46,211 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 123 treesize of output 118 [2022-11-25 23:50:46,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:46,227 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 123 treesize of output 118 [2022-11-25 23:50:46,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:46,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:46,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:46,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:46,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:46,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:46,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:46,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:47,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:47,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 23 treesize of output 1 [2022-11-25 23:50:47,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 15 treesize of output 11 [2022-11-25 23:50:47,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:47,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:47,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:50:47,544 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-25 23:50:47,668 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1729949369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:49,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:49,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2022-11-25 23:50:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992711048] [2022-11-25 23:50:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:49,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:50:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:50:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:50:49,974 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-25 23:50:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:53,295 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-11-25 23:50:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:50:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-25 23:50:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:53,296 INFO L225 Difference]: With dead ends: 35 [2022-11-25 23:50:53,297 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 23:50:53,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:50:53,319 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:53,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 23:50:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 23:50:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-25 23:50:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-25 23:50:53,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-11-25 23:50:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:53,337 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-25 23:50:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-25 23:50:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-25 23:50:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:50:53,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:53,338 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:53,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:53,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:53,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash 344348370, now seen corresponding path program 1 times [2022-11-25 23:50:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:53,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995453936] [2022-11-25 23:50:53,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:50:53,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:53,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995453936] [2022-11-25 23:50:53,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995453936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:53,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277280956] [2022-11-25 23:50:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:53,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:53,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:53,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:53,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:50:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:53,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:50:53,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:50:53,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:50:53,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277280956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1111543980] [2022-11-25 23:50:53,935 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:50:53,935 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:53,936 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:53,936 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:53,936 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:53,971 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-25 23:50:53,977 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-25 23:50:54,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:54,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:54,107 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:50:54,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:50:54,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:54,138 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:50:54,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-11-25 23:50:54,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-25 23:50:54,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:50:54,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:54,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:54,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:54,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:54,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:54,614 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 123 treesize of output 118 [2022-11-25 23:50:54,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:54,629 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 123 treesize of output 118 [2022-11-25 23:50:54,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:54,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:54,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:55,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:55,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:55,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-25 23:50:55,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:55,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:55,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:55,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:55,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:50:55,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:55,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:55,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:55,967 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-25 23:50:56,055 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:58,463 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1233#(and (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 |~#ldv_global_msg_list~0.offset|) (<= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (<= 0 |ULTIMATE.start_alloc_17_~p~0#1.offset|) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 10) (<= |#NULL.offset| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= 0 |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |~#ldv_global_msg_list~0.base| 1) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |#NULL.base| 0) (<= |~#ldv_global_msg_list~0.offset| 0) (<= 10 |ULTIMATE.start_alloc_17_~len#1|) (<= 1 |~#ldv_global_msg_list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-25 23:50:58,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:58,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:58,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-25 23:50:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295340081] [2022-11-25 23:50:58,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:58,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:50:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:50:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:50:58,466 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:50:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:58,615 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-11-25 23:50:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:50:58,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-25 23:50:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:58,616 INFO L225 Difference]: With dead ends: 60 [2022-11-25 23:50:58,616 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 23:50:58,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:50:58,618 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:58,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 23:50:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 23:50:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 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-25 23:50:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-11-25 23:50:58,629 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2022-11-25 23:50:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:58,630 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-11-25 23:50:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:50:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-11-25 23:50:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:50:58,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:58,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:58,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:58,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 23:50:58,837 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:50:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash 872222994, now seen corresponding path program 2 times [2022-11-25 23:50:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:58,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783423464] [2022-11-25 23:50:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:58,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:58,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:58,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783423464] [2022-11-25 23:50:58,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783423464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:58,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418930489] [2022-11-25 23:50:58,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:50:58,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:58,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:58,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:58,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:50:59,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:50:59,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:50:59,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:50:59,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 23:50:59,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418930489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:59,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [142014932] [2022-11-25 23:50:59,168 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:50:59,168 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:59,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:59,168 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:59,169 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:59,194 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-25 23:50:59,199 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-25 23:50:59,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:59,296 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:50:59,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-11-25 23:50:59,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:50:59,322 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:50:59,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:50:59,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:50:59,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:59,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:59,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:59,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:50:59,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:50:59,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:50:59,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:50:59,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:59,712 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 123 treesize of output 118 [2022-11-25 23:50:59,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:59,724 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 123 treesize of output 118 [2022-11-25 23:50:59,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:50:59,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:00,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:00,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:00,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:00,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:00,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:00,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:00,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:00,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:00,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:00,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:00,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:00,804 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-25 23:51:00,873 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:03,107 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1581#(and (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (= |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) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) (= |~#ldv_global_msg_list~0.base| 1) (<= 10 |ULTIMATE.start_alloc_17_~len#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:51:03,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:51:03,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:03,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-25 23:51:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496097552] [2022-11-25 23:51:03,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:03,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:51:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:51:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:51:03,112 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 23:51:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:03,298 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-25 23:51:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:51:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2022-11-25 23:51:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:03,300 INFO L225 Difference]: With dead ends: 78 [2022-11-25 23:51:03,300 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 23:51:03,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:51:03,301 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:03,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 158 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 23:51:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-11-25 23:51:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 47 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 23:51:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-25 23:51:03,318 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 32 [2022-11-25 23:51:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:03,319 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-25 23:51:03,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 23:51:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-25 23:51:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:51:03,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:03,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:03,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:03,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 23:51:03,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:51:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 639008678, now seen corresponding path program 1 times [2022-11-25 23:51:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:03,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408591764] [2022-11-25 23:51:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 23:51:03,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:03,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408591764] [2022-11-25 23:51:03,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408591764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:03,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:51:03,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:51:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196598034] [2022-11-25 23:51:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:03,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:51:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:51:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:51:03,620 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:51:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:03,650 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-25 23:51:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:51:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-25 23:51:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:03,652 INFO L225 Difference]: With dead ends: 56 [2022-11-25 23:51:03,652 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 23:51:03,652 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-25 23:51:03,653 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:03,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:51:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 23:51:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 23:51:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 23:51:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-11-25 23:51:03,675 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 34 [2022-11-25 23:51:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:03,677 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-11-25 23:51:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:51:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-11-25 23:51:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:51:03,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:03,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:51:03,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:51:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1665567357, now seen corresponding path program 1 times [2022-11-25 23:51:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:03,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372477322] [2022-11-25 23:51:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:51:03,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372477322] [2022-11-25 23:51:03,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372477322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871820137] [2022-11-25 23:51:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:03,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:03,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:03,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:51:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:03,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:51:03,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:51:04,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:51:04,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871820137] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:04,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920873562] [2022-11-25 23:51:04,212 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-25 23:51:04,212 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:04,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:04,213 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:04,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:04,234 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-25 23:51:04,239 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-25 23:51:04,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:04,333 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:51:04,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:51:04,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:04,354 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:51:04,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-11-25 23:51:04,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:04,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:04,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:04,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:04,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:04,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:04,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:04,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 23 treesize of output 1 [2022-11-25 23:51:04,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:04,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:04,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:04,772 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 123 treesize of output 118 [2022-11-25 23:51:04,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:04,786 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 123 treesize of output 118 [2022-11-25 23:51:04,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:05,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:05,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:05,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:05,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:05,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:05,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:05,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:05,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:05,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:05,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:05,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:05,982 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-25 23:51:05,990 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-25 23:51:06,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:06,166 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-25 23:51:06,243 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:09,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1920873562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:09,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:09,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10, 10, 10] total 40 [2022-11-25 23:51:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816997139] [2022-11-25 23:51:09,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:09,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:51:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:09,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:51:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:51:09,613 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:51:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:13,662 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-11-25 23:51:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:51:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-25 23:51:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:13,664 INFO L225 Difference]: With dead ends: 59 [2022-11-25 23:51:13,664 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 23:51:13,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=373, Invalid=2383, Unknown=0, NotChecked=0, Total=2756 [2022-11-25 23:51:13,666 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:13,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 13 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:51:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 23:51:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 23:51:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 23:51:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-11-25 23:51:13,686 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 35 [2022-11-25 23:51:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:13,687 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-11-25 23:51:13,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:51:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-11-25 23:51:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:51:13,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:13,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:13,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:13,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:51:13,895 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:51:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash 840162685, now seen corresponding path program 1 times [2022-11-25 23:51:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216683631] [2022-11-25 23:51:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:51:14,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:14,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216683631] [2022-11-25 23:51:14,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216683631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:14,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536104271] [2022-11-25 23:51:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:14,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:14,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:14,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:14,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:51:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:14,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:51:14,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:51:14,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:51:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536104271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:14,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1232518890] [2022-11-25 23:51:14,636 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-25 23:51:14,636 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:14,637 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:14,637 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:14,637 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:14,661 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-25 23:51:14,666 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-25 23:51:14,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:14,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:14,789 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:51:14,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-11-25 23:51:14,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:14,818 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:51:14,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:51:14,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:14,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:14,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-25 23:51:14,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:14,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:14,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:15,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:15,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:15,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:15,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:15,272 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 143 treesize of output 133 [2022-11-25 23:51:15,284 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 143 treesize of output 133 [2022-11-25 23:51:15,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:15,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:15,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:15,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:15,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:15,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:15,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:15,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:15,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:16,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:16,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:16,432 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-25 23:51:16,441 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-25 23:51:16,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:16,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:16,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:51:16,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2022-11-25 23:51:16,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:51:16,595 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-25 23:51:16,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:16,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:16,628 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-25 23:51:16,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-25 23:51:16,707 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-25 23:51:16,714 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-25 23:51:16,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:16,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:16,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:16,784 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-25 23:51:16,791 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-25 23:51:16,819 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-25 23:51:16,910 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1232518890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:51:20,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:20,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10, 10, 10] total 40 [2022-11-25 23:51:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310027704] [2022-11-25 23:51:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:51:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:51:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:51:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:51:20,150 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:51:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:24,272 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-11-25 23:51:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:51:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-25 23:51:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:24,275 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:51:24,275 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 23:51:24,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=373, Invalid=2383, Unknown=0, NotChecked=0, Total=2756 [2022-11-25 23:51:24,277 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:24,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:51:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 23:51:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-25 23:51:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 23:51:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-25 23:51:24,292 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 38 [2022-11-25 23:51:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:24,292 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-25 23:51:24,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:51:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-25 23:51:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 23:51:24,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:24,294 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:24,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:24,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:51:24,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:51:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash -400563057, now seen corresponding path program 3 times [2022-11-25 23:51:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:24,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359683501] [2022-11-25 23:51:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-25 23:51:24,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359683501] [2022-11-25 23:51:24,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359683501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114345900] [2022-11-25 23:51:24,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:51:24,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:24,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:24,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:24,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:51:25,143 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:51:25,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:51:25,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:51:25,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-25 23:51:25,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-25 23:51:25,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114345900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:25,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725238583] [2022-11-25 23:51:25,386 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:51:25,386 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:25,386 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:25,386 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:25,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:25,414 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-25 23:51:25,419 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-25 23:51:25,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:25,508 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:51:25,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-11-25 23:51:25,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:51:25,532 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:51:25,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-11-25 23:51:25,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:25,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:25,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:25,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:25,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:25,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:25,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:25,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:25,964 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 143 treesize of output 133 [2022-11-25 23:51:25,975 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 143 treesize of output 133 [2022-11-25 23:51:26,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:26,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:26,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:26,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:51:26,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:26,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:26,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:26,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:26,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 23 treesize of output 1 [2022-11-25 23:51:26,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:26,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-25 23:51:26,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:51:26,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-25 23:51:26,972 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-11-25 23:51:27,065 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:29,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3139#(and (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (= |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) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) (= |~#ldv_global_msg_list~0.base| 1) (<= 10 |ULTIMATE.start_alloc_17_~len#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:51:29,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:51:29,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:29,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-11-25 23:51:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645422781] [2022-11-25 23:51:29,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:51:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:51:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:51:29,506 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 23:51:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:29,832 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-11-25 23:51:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:51:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 56 [2022-11-25 23:51:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:29,833 INFO L225 Difference]: With dead ends: 86 [2022-11-25 23:51:29,833 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:51:29,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:51:29,835 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:29,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 45 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:51:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:51:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:51:29,836 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-25 23:51:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:51:29,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2022-11-25 23:51:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:51:29,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 23:51:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:51:29,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:51:29,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 23:51:29,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 23:51:29,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 23:51:29,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 23:51:29,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 23:51:29,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 23:51:29,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 23:51:29,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 23:51:29,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:30,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:51:30,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:51:31,954 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (= |~#ldv_global_msg_list~0.offset| 0))) (.cse2 (not (= |#NULL.base| 0))) (.cse3 (not (= |~#ldv_global_msg_list~0.base| 1)))) (and (or .cse0 .cse1 (not (= |ldv_malloc_#in~size| 4)) .cse2 (not (<= 0 |#StackHeapBarrier|)) .cse3) (let ((.cse5 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|)) (.cse6 (+ |~#ldv_global_msg_list~0.offset| 4))) (or (not (= (select |old(#valid)| 1) 1)) .cse0 (not (= 40 |ldv_malloc_#in~size|)) .cse1 (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#length)| 1) 8)) .cse2 (not (= (select .cse4 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (= |~#ldv_global_msg_list~0.base| (select .cse5 .cse6))) (not (= (select |old(#valid)| 0) 0)) (not (= |~#ldv_global_msg_list~0.base| (select .cse5 |~#ldv_global_msg_list~0.offset|))) (not (= |~#ldv_global_msg_list~0.offset| (select .cse4 .cse6))) .cse3)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 23:51:31,955 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-25 23:51:31,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 764) no Hoare annotation was computed. [2022-11-25 23:51:31,955 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2022-11-25 23:51:31,955 INFO L895 garLoopResultBuilder]: At program point L766-1(lines 760 776) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse3 (= |~#ldv_global_msg_list~0.base| 1)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 0 |#StackHeapBarrier|)) (.cse6 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~i~1#1|) .cse0 .cse1 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse0 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (= |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|) .cse1 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) .cse2 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) .cse3 (<= 10 |ULTIMATE.start_alloc_17_~len#1|) .cse4 .cse5 .cse6))) [2022-11-25 23:51:31,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,955 INFO L902 garLoopResultBuilder]: At program point L775(lines 760 776) the Hoare annotation is: true [2022-11-25 23:51:31,955 INFO L899 garLoopResultBuilder]: For program point L771(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2022-11-25 23:51:31,956 INFO L899 garLoopResultBuilder]: For program point L771-4(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,956 INFO L899 garLoopResultBuilder]: For program point L771-5(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,956 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:51:31,956 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,956 INFO L895 garLoopResultBuilder]: At program point L771-6(lines 771 774) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (<= 0 |#StackHeapBarrier|)) (.cse7 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse0 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (<= 0 .cse1) (= |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|) .cse2 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) .cse3 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|) (<= |ULTIMATE.start_alloc_17_~j~0#1| 9) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) .cse4 (<= 10 |ULTIMATE.start_alloc_17_~len#1|) .cse5 .cse6 .cse7) (and (<= 0 |ULTIMATE.start_entry_point_~i~1#1|) .cse0 .cse2 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse3 (<= .cse1 0) .cse4 .cse5 .cse6 .cse7))) [2022-11-25 23:51:31,956 INFO L895 garLoopResultBuilder]: At program point L780(line 780) 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) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-25 23:51:31,956 INFO L899 garLoopResultBuilder]: For program point L780-1(line 780) no Hoare annotation was computed. [2022-11-25 23:51:31,956 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2022-11-25 23:51:31,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:51:31,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,957 INFO L899 garLoopResultBuilder]: For program point L764-3(line 764) no Hoare annotation was computed. [2022-11-25 23:51:31,957 INFO L899 garLoopResultBuilder]: For program point L764-4(line 764) no Hoare annotation was computed. [2022-11-25 23:51:31,957 INFO L895 garLoopResultBuilder]: At program point L764-5(lines 764 768) the Hoare annotation is: (and (let ((.cse0 (<= 0 |#NULL.base|)) (.cse1 (<= |ULTIMATE.start_alloc_17_~len#1| 10)) (.cse2 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse3 (<= 0 |~#ldv_global_msg_list~0.offset|)) (.cse4 (<= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10)) (.cse6 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse7 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse8 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse9 (<= |ULTIMATE.start_entry_point_~len~0#1| 10)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse12 (<= 0 |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse13 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse14 (<= 10 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse15 (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse16 (<= |#NULL.base| 0)) (.cse17 (<= |~#ldv_global_msg_list~0.offset| 0)) (.cse18 (<= 10 |ULTIMATE.start_alloc_17_~len#1|)) (.cse19 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse20 (<= 0 |#NULL.offset|)) (.cse21 (<= 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 |ULTIMATE.start_alloc_17_~p~0#1.offset|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse12 .cse13 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (< |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) [2022-11-25 23:51:31,957 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 787) no Hoare annotation was computed. [2022-11-25 23:51:31,958 INFO L899 garLoopResultBuilder]: For program point L777(lines 777 788) no Hoare annotation was computed. [2022-11-25 23:51:31,958 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 764) no Hoare annotation was computed. [2022-11-25 23:51:31,958 INFO L895 garLoopResultBuilder]: At program point L765(line 765) the Hoare annotation is: (and (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (let ((.cse0 (<= |ULTIMATE.start_alloc_17_~len#1| 10)) (.cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse2 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10)) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse5 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse6 (<= 10 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse7 (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse8 (<= 10 |ULTIMATE.start_alloc_17_~len#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) .cse5 (<= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_alloc_17_~p~0#1.offset|) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse6 .cse7 .cse8))) (<= |ULTIMATE.start_entry_point_~len~0#1| 10) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-25 23:51:31,958 INFO L899 garLoopResultBuilder]: For program point L765-1(line 765) no Hoare annotation was computed. [2022-11-25 23:51:31,958 INFO L899 garLoopResultBuilder]: For program point L782-3(line 782) no Hoare annotation was computed. [2022-11-25 23:51:31,958 INFO L899 garLoopResultBuilder]: For program point L782-4(line 782) no Hoare annotation was computed. [2022-11-25 23:51:31,959 INFO L895 garLoopResultBuilder]: At program point L782-5(lines 782 784) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (let ((.cse0 (= (select |#length| 1) 8)) (.cse1 (= (select |#valid| 1) 1)) (.cse2 (= |~#ldv_global_msg_list~0.base| 1)) (.cse3 (= (select |#valid| 0) 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_entry_point_~i~1#1| 0) .cse2 .cse3) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_entry_point_~i~1#1|) .cse2 .cse3))) (= |#NULL.offset| 0) (let ((.cse11 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse12 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|))) (let ((.cse4 (= |~#ldv_global_msg_list~0.base| (select .cse12 |~#ldv_global_msg_list~0.offset|))) (.cse5 (= |~#ldv_global_msg_list~0.base| (select .cse12 .cse11))) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse9 (= |~#ldv_global_msg_list~0.offset| (select .cse10 .cse11)))) (or (and .cse4 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and (< |ULTIMATE.start_entry_point_~array~0#1.base| |#StackHeapBarrier|) .cse4 (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) .cse5 .cse6 (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) 1) .cse7 .cse8 .cse9)))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse10 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-25 23:51:31,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-11-25 23:51:31,962 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:31,963 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:51:31,993 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:31,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,994 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:31,995 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:31,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:31,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,997 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:31,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:31,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:31,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:51:31 BoogieIcfgContainer [2022-11-25 23:51:31,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:51:32,000 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:51:32,000 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:51:32,000 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:51:32,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:38" (3/4) ... [2022-11-25 23:51:32,004 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:51:32,009 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-25 23:51:32,020 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 23:51:32,021 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-25 23:51:32,021 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 23:51:32,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-25 23:51:32,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && j <= 9) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && j + 1 <= 0) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-25 23:51:32,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && 0 <= p) && array <= 0) && 0 <= array) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && p <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 1 <= i) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && array <= 0) && 0 <= array) && 0 <= i) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && i <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown)) && i < 2147483647 [2022-11-25 23:51:32,075 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:51:32,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:51:32,076 INFO L158 Benchmark]: Toolchain (without parser) took 54872.49ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 108.8MB in the beginning and 175.5MB in the end (delta: -66.8MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,076 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:51:32,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.73ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 86.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.51ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,077 INFO L158 Benchmark]: Boogie Preprocessor took 32.33ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,077 INFO L158 Benchmark]: RCFGBuilder took 594.51ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 66.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,078 INFO L158 Benchmark]: TraceAbstraction took 53430.45ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 65.9MB in the beginning and 178.7MB in the end (delta: -112.8MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,078 INFO L158 Benchmark]: Witness Printer took 75.55ms. Allocated memory is still 360.7MB. Free memory was 178.7MB in the beginning and 175.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:51:32,079 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.26ms. Allocated memory is still 113.2MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.73ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 86.3MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.51ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.33ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.51ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 66.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53430.45ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 65.9MB in the beginning and 178.7MB in the end (delta: -112.8MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. * Witness Printer took 75.55ms. Allocated memory is still 360.7MB. Free memory was 178.7MB in the beginning and 175.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 764]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 764]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: 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, 31 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 786 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 569 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1189 IncrementalHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 217 mSDtfsCounter, 1189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 511 SyntacticMatches, 23 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3855 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=11, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 40 NumberOfFragments, 780 HoareAnnotationTreeSize, 21 FomulaSimplifications, 1097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5632 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 563 NumberOfCodeBlocks, 554 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 1635 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 478/637 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: 7.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 87, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 143, TOOLS_POST_TIME: 4.2s, TOOLS_POST_CALL_APPLICATIONS: 45, TOOLS_POST_CALL_TIME: 1.6s, TOOLS_POST_RETURN_APPLICATIONS: 38, TOOLS_POST_RETURN_TIME: 0.9s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 226, TOOLS_QUANTIFIERELIM_TIME: 6.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 318, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 54, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 19, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 87, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 4.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 19, CALL_SUMMARIZER_APPLICATIONS: 38, 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: 1400, DAG_COMPRESSION_RETAINED_NODES: 243, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 771]: Loop Invariant Derived loop invariant: (((((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && j <= 9) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && j + 1 <= 0) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: ((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && 0 <= p) && array <= 0) && 0 <= array) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && p <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 1 <= i) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && array <= 0) && 0 <= array) && 0 <= i) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && i <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown)) && i < 2147483647 - InvariantResult [Line: 782]: Loop Invariant [2022-11-25 23:51:32,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:32,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:32,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:32,125 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:32,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:51:32,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:51:32,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((unknown-#length-unknown[1] == 8 && \valid[1] == 1) && i == 0) && ldv_global_msg_list == 1) && \valid[0] == 0) || ((((unknown-#length-unknown[1] == 8 && \valid[1] == 1) && 1 <= i) && ldv_global_msg_list == 1) && \valid[0] == 0)) && #NULL == 0) && (((((((ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] && array == 0) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && ldv_global_msg_list == 0) && 10 == len) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) || ((((((((array < unknown-#StackHeapBarrier-unknown && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[array] == len % 1073741824 * 4) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && \valid[array] == 1) && ldv_global_msg_list == 0) && 10 == len) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]))) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list RESULT: Ultimate proved your program to be correct! [2022-11-25 23:51:32,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56eba53-d09e-4ca4-99a7-be3684d04418/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE