./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_all.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_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/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_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/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_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/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 bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd --- 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:37:42,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:37:42,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:37:42,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:37:42,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:37:42,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:37:42,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:37:42,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:37:42,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:37:42,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:37:42,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:37:42,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:37:42,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:37:42,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:37:42,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:37:42,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:37:42,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:37:42,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:37:42,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:37:42,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:37:42,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:37:42,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:37:42,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:37:42,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:37:42,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:37:42,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:37:42,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:37:42,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:37:42,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:37:42,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:37:42,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:37:42,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:37:42,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:37:42,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:37:42,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:37:42,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:37:42,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:37:42,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:37:42,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:37:42,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:37:42,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:37:42,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:37:42,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:37:42,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:37:42,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:37:42,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:37:42,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:37:42,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:37:42,767 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:37:42,768 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:37:42,768 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:37:42,768 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:37:42,769 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:37:42,770 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:37:42,770 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:37:42,770 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:37:42,770 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:37:42,771 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:37:42,771 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:37:42,771 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:37:42,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:37:42,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:37:42,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:37:42,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:37:42,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:37:42,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:37:42,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:37:42,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:37:42,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:37:42,774 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:37:42,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:37:42,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:37:42,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:37:42,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:37:42,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:37:42,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:37:42,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:37:42,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:37:42,778 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:37:42,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:37:42,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:37:42,779 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:37:42,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:37:42,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:37:42,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:37:42,779 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_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/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_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/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 -> bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd [2022-11-25 23:37:43,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:37:43,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:37:43,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:37:43,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:37:43,117 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:37:43,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2n_remove_all.i [2022-11-25 23:37:46,478 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:37:46,741 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:37:46,742 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2022-11-25 23:37:46,754 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/data/97247028b/97dcad73b18f45ebba4dd390dd9c4507/FLAG1757283bd [2022-11-25 23:37:46,770 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/data/97247028b/97dcad73b18f45ebba4dd390dd9c4507 [2022-11-25 23:37:46,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:37:46,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:37:46,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:37:46,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:37:46,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:37:46,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:37:46" (1/1) ... [2022-11-25 23:37:46,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c69f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:46, skipping insertion in model container [2022-11-25 23:37:46,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:37:46" (1/1) ... [2022-11-25 23:37:46,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:37:46,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:37:47,178 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2022-11-25 23:37:47,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:37:47,188 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:37:47,225 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2022-11-25 23:37:47,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:37:47,251 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:37:47,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47 WrapperNode [2022-11-25 23:37:47,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:37:47,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:37:47,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:37:47,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:37:47,261 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:37:47" (1/1) ... [2022-11-25 23:37:47,273 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:37:47" (1/1) ... [2022-11-25 23:37:47,295 INFO L138 Inliner]: procedures = 126, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 89 [2022-11-25 23:37:47,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:37:47,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:37:47,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:37:47,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:37:47,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,320 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:37:47,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:37:47,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:37:47,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:37:47,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (1/1) ... [2022-11-25 23:37:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:37:47,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:47,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:37:47,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:37:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:37:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:37:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:37:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:37:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:37:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:37:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:37:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:37:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:37:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:37:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:37:47,553 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:37:47,555 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:37:47,883 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:37:47,976 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:37:47,982 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:37:47,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:37:47 BoogieIcfgContainer [2022-11-25 23:37:47,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:37:47,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:37:47,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:37:47,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:37:47,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:37:46" (1/3) ... [2022-11-25 23:37:47,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7b03b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:37:47, skipping insertion in model container [2022-11-25 23:37:47,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:47" (2/3) ... [2022-11-25 23:37:47,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7b03b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:37:47, skipping insertion in model container [2022-11-25 23:37:48,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:37:47" (3/3) ... [2022-11-25 23:37:48,002 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2022-11-25 23:37:48,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:37:48,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-25 23:37:48,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:37:48,103 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;@52f00a53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:37:48,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 23:37:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 17 states have internal predecessors, (20), 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:37:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:37:48,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:48,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:37:48,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 100566, now seen corresponding path program 1 times [2022-11-25 23:37:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:48,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582185332] [2022-11-25 23:37:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:48,395 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:37:48,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:48,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582185332] [2022-11-25 23:37:48,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582185332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:48,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895745022] [2022-11-25 23:37:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:48,436 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 17 states have internal predecessors, (20), 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) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:37:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:48,485 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-11-25 23:37:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2022-11-25 23:37:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:48,504 INFO L225 Difference]: With dead ends: 35 [2022-11-25 23:37:48,505 INFO L226 Difference]: Without dead ends: 22 [2022-11-25 23:37:48,507 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:37:48,511 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:48,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-25 23:37:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-11-25 23:37:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 16 states have internal predecessors, (18), 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:37:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-25 23:37:48,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 3 [2022-11-25 23:37:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:48,546 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-25 23:37:48,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:37:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-25 23:37:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:37:48,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:48,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:37:48,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:37:48,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 3050609, now seen corresponding path program 1 times [2022-11-25 23:37:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:48,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062801341] [2022-11-25 23:37:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:48,717 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:37:48,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:48,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062801341] [2022-11-25 23:37:48,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062801341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:48,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:48,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028097762] [2022-11-25 23:37:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:48,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:37:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:48,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:37:48,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:37:48,722 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:37:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:48,794 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-11-25 23:37:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2022-11-25 23:37:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:48,796 INFO L225 Difference]: With dead ends: 22 [2022-11-25 23:37:48,797 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 23:37:48,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:37:48,799 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:48,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 23:37:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-25 23:37:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.5) internal successors, (21), 19 states have internal predecessors, (21), 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:37:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-25 23:37:48,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 4 [2022-11-25 23:37:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:48,812 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-25 23:37:48,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:37:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-25 23:37:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:37:48,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:48,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:37:48,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 686436824, now seen corresponding path program 1 times [2022-11-25 23:37:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:48,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415620002] [2022-11-25 23:37:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:49,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:49,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415620002] [2022-11-25 23:37:49,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415620002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:49,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205918693] [2022-11-25 23:37:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:49,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:49,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:49,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:37:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:49,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:37:49,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:37:49,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:49,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205918693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:49,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:49,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-11-25 23:37:49,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579606168] [2022-11-25 23:37:49,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:49,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:49,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:37:49,175 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:37:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:49,192 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-11-25 23:37:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:49,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2022-11-25 23:37:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:49,194 INFO L225 Difference]: With dead ends: 20 [2022-11-25 23:37:49,194 INFO L226 Difference]: Without dead ends: 19 [2022-11-25 23:37:49,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:37:49,196 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:49,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-25 23:37:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-25 23:37:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 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:37:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-25 23:37:49,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2022-11-25 23:37:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:49,201 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-25 23:37:49,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:37:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-25 23:37:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:37:49,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:49,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:49,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:49,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:49,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash -195294870, now seen corresponding path program 1 times [2022-11-25 23:37:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:49,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214610052] [2022-11-25 23:37:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:49,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:49,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:49,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214610052] [2022-11-25 23:37:49,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214610052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:49,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986161593] [2022-11-25 23:37:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:49,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:49,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:49,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:49,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:37:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:49,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 23:37:49,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:37:49,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:49,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986161593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:49,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:49,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-11-25 23:37:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573844158] [2022-11-25 23:37:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:49,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:37:49,786 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:37:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:49,804 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-11-25 23:37:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2022-11-25 23:37:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:49,807 INFO L225 Difference]: With dead ends: 19 [2022-11-25 23:37:49,808 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 23:37:49,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:37:49,812 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:49,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 23:37:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 23:37:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 17 states have internal predecessors, (19), 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:37:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-11-25 23:37:49,827 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2022-11-25 23:37:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:49,828 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-11-25 23:37:49,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:37:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-11-25 23:37:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:37:49,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:49,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2022-11-25 23:37:49,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-25 23:37:50,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -195361873, now seen corresponding path program 1 times [2022-11-25 23:37:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:50,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680151442] [2022-11-25 23:37:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:37:50,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:50,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680151442] [2022-11-25 23:37:50,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680151442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:50,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:50,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:37:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788801997] [2022-11-25 23:37:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:50,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:37:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:37:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:37:50,197 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:37:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:50,239 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-11-25 23:37:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:50,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2022-11-25 23:37:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:50,242 INFO L225 Difference]: With dead ends: 18 [2022-11-25 23:37:50,242 INFO L226 Difference]: Without dead ends: 17 [2022-11-25 23:37:50,242 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:37:50,244 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:50,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-25 23:37:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-25 23:37:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 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:37:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-25 23:37:50,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 8 [2022-11-25 23:37:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:50,249 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-25 23:37:50,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:37:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-25 23:37:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:37:50,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:50,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2022-11-25 23:37:50,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:37:50,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1761250711, now seen corresponding path program 1 times [2022-11-25 23:37:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:50,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035967667] [2022-11-25 23:37:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:50,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:50,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035967667] [2022-11-25 23:37:50,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035967667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:50,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878193993] [2022-11-25 23:37:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:50,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:50,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:50,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:50,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:37:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:50,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:37:50,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:50,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:50,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878193993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:50,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:50,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:37:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974227338] [2022-11-25 23:37:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:50,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:37:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:50,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:37:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:37:50,666 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:37:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:50,734 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-11-25 23:37:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:37:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2022-11-25 23:37:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:50,736 INFO L225 Difference]: With dead ends: 17 [2022-11-25 23:37:50,736 INFO L226 Difference]: Without dead ends: 16 [2022-11-25 23:37:50,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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:37:50,737 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:50,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 18 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-25 23:37:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2022-11-25 23:37:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:37:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-25 23:37:50,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2022-11-25 23:37:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:50,742 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-25 23:37:50,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:37:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-11-25 23:37:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:37:50,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:50,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:50,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:50,949 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1300194320, now seen corresponding path program 1 times [2022-11-25 23:37:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:50,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105236628] [2022-11-25 23:37:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:51,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:51,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105236628] [2022-11-25 23:37:51,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105236628] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:51,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737891807] [2022-11-25 23:37:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:51,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:51,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:51,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:37:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:51,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:37:51,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:51,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:51,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737891807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [110228049] [2022-11-25 23:37:51,288 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 23:37:51,288 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:51,292 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:51,298 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:51,298 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,432 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:37:51,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:37:51,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:37:51,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,547 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:37:51,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:37:51,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 23:37:51,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:51,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:37:51,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:37:51,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:51,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:37:51,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:51,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-25 23:37:51,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:51,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,016 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:37:52,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:37:52,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:37:52,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:52,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:37:52,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:52,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:37:52,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:52,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:52,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-25 23:37:53,044 INFO L321 Elim1Store]: treesize reduction 256, result has 12.3 percent of original size [2022-11-25 23:37:53,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 454 treesize of output 463 [2022-11-25 23:37:53,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:37:53,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:53,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-25 23:37:53,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:53,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:37:53,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 23:37:53,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:53,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:37:53,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:53,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:53,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 49 [2022-11-25 23:37:53,929 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-25 23:37:53,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2022-11-25 23:37:53,944 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:37:54,171 INFO L321 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2022-11-25 23:37:54,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 449 treesize of output 455 [2022-11-25 23:37:54,347 INFO L321 Elim1Store]: treesize reduction 264, result has 9.6 percent of original size [2022-11-25 23:37:54,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 454 treesize of output 455 [2022-11-25 23:37:54,485 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:57,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [110228049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:57,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:57,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 12 [2022-11-25 23:37:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207557410] [2022-11-25 23:37:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:57,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:37:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:37:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:37:57,230 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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:37:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:57,375 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-11-25 23:37:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:37:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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) Word has length 10 [2022-11-25 23:37:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:57,377 INFO L225 Difference]: With dead ends: 18 [2022-11-25 23:37:57,377 INFO L226 Difference]: Without dead ends: 16 [2022-11-25 23:37:57,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:37:57,378 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:57,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-25 23:37:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-25 23:37:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:37:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-11-25 23:37:57,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2022-11-25 23:37:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:57,383 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-11-25 23:37:57,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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:37:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-11-25 23:37:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:37:57,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:57,384 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:57,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:57,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:57,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-25 23:37:57,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2073993960, now seen corresponding path program 1 times [2022-11-25 23:37:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:57,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560340833] [2022-11-25 23:37:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:37:57,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560340833] [2022-11-25 23:37:57,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560340833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261442932] [2022-11-25 23:37:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:57,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:57,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:57,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:37:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:57,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:37:57,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:37:57,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:37:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261442932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:57,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430197008] [2022-11-25 23:37:57,884 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:37:57,884 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:57,885 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:57,885 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:57,885 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:57,932 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:37:57,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-25 23:37:57,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:57,963 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:37:57,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 23:37:57,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:57,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,021 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:37:58,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 23:37:58,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,075 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:37:58,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-25 23:37:58,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:37:58,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:58,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:37:58,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 23:37:58,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:58,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 23:37:58,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:58,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-25 23:37:58,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,292 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 23:37:58,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 46 [2022-11-25 23:37:58,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,379 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:37:58,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-11-25 23:37:58,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:58,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-25 23:37:58,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:58,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:37:58,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:58,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 23:37:58,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:58,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:37:59,066 INFO L321 Elim1Store]: treesize reduction 256, result has 12.3 percent of original size [2022-11-25 23:37:59,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 454 treesize of output 463 [2022-11-25 23:37:59,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 23:37:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:59,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-25 23:37:59,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:59,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 23:37:59,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-25 23:37:59,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:59,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:37:59,672 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-25 23:37:59,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2022-11-25 23:37:59,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:59,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:59,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 41 [2022-11-25 23:37:59,702 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:37:59,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:59,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:59,837 INFO L321 Elim1Store]: treesize reduction 42, result has 43.2 percent of original size [2022-11-25 23:37:59,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 64 [2022-11-25 23:37:59,878 INFO L321 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2022-11-25 23:37:59,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2022-11-25 23:37:59,892 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:38:00,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:38:00,169 INFO L321 Elim1Store]: treesize reduction 42, result has 43.2 percent of original size [2022-11-25 23:38:00,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 64 [2022-11-25 23:38:00,211 INFO L321 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2022-11-25 23:38:00,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 64 [2022-11-25 23:38:00,225 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:38:00,664 INFO L321 Elim1Store]: treesize reduction 248, result has 15.1 percent of original size [2022-11-25 23:38:00,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 454 treesize of output 471 [2022-11-25 23:38:00,746 INFO L321 Elim1Store]: treesize reduction 142, result has 10.7 percent of original size [2022-11-25 23:38:00,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 449 treesize of output 455 [2022-11-25 23:38:01,121 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:03,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [430197008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:03,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:38:03,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 12 [2022-11-25 23:38:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862911818] [2022-11-25 23:38:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:03,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:38:03,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:03,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:38:03,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:38:03,246 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:38:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:04,220 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-11-25 23:38:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:38:04,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 13 [2022-11-25 23:38:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:04,221 INFO L225 Difference]: With dead ends: 16 [2022-11-25 23:38:04,221 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:38:04,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:38:04,223 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:04,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:38:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:38:04,224 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:38:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:38:04,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-11-25 23:38:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:04,224 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:38:04,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:38:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:38:04,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:38:04,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-25 23:38:04,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-25 23:38:04,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-25 23:38:04,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-25 23:38:04,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-25 23:38:04,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-25 23:38:04,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:04,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:04,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:38:05,495 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |#NULL.offset| 0)) (.cse4 (= |#NULL.base| 0))) (or (and .cse0 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse3 .cse4))) (<= 1 |ULTIMATE.start_node_create_~data#1|) (or (and (<= 0 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= |ULTIMATE.start_sll_create_~len#1| 1)) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (let ((.cse20 (select |#memory_int| 1))) (let ((.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse8 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse9 (= 2 (select |#length| 1))) (.cse10 (= (select |#valid| 1) 1)) (.cse11 (= 19 (select |#length| 2))) (.cse12 (= (select |#valid| 0) 0)) (.cse13 (= (select |#valid| 2) 1)) (.cse14 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse15 (= (select .cse20 0) 48)) (.cse16 (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4)) (.cse17 (= (select .cse20 1) 0)) (.cse18 (< 0 |#StackHeapBarrier|))) (or (and .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_sll_create_~len#1| |ULTIMATE.start_sll_create_#in~len#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse19 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (and .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_sll_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0)) .cse9 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse19) 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) .cse16 .cse17 (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|) .cse18 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse19) 0)))))) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) [2022-11-25 23:38:05,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,496 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-25 23:38:05,496 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2022-11-25 23:38:05,496 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2022-11-25 23:38:05,496 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse0 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse5 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (<= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse12 (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse14 (= |#NULL.base| 0))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 (<= |#NULL.offset| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 |#NULL.offset|) .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse16 (= |#NULL.offset| 0))) (or (and .cse15 .cse4 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse16) (and .cse15 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse4 .cse16))) (<= 1 |ULTIMATE.start_node_create_~data#1|) .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_node_create_#in~data#1| 1) .cse5 (<= |ULTIMATE.start_sll_create_~len#1| 1) .cse6 (<= 0 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_node_create_~data#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-11-25 23:38:05,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-25 23:38:05,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point L602-5(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point L602-6(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L895 garLoopResultBuilder]: At program point L602-7(lines 602 604) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_node_create_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (let ((.cse0 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and .cse0 (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)))) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_node_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_node_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-25 23:38:05,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:38:05,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:38:05,500 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:05,502 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:38:05,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:38:05,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:38:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:38:05,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:38:05,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:38:05 BoogieIcfgContainer [2022-11-25 23:38:05,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:38:05,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:38:05,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:38:05,534 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:38:05,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:37:47" (3/4) ... [2022-11-25 23:38:05,539 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:38:05,564 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-25 23:38:05,564 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 23:38:05,565 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:38:05,565 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:38:05,591 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && #NULL <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s <= 0) && 0 <= s) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= s) && 0 <= head) && #NULL == 0) || ((((((((((((((((((((((((temp == 0 && data == 1) && new_head == 0) && #NULL == 0) || (((temp == 0 && head == 0) && data == 1) && #NULL == 0)) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && len <= 1) && \old(len) <= 2) && 0 <= len) && len == 2) && s <= 0) && 0 <= s) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= s) && 0 <= head) && #NULL == 0) [2022-11-25 23:38:05,592 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((temp == 0 && head == 0) && data == 1) && s == 0) && #NULL == 0) && #NULL == 0) || (((((temp == 0 && data == 1) && s == 0) && new_head == 0) && #NULL == 0) && #NULL == 0)) && 1 <= data) && ((0 <= head && head <= 0) || len <= 1)) && 2 <= len) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= len) && len <= 2) && 1 <= data) && 1 <= \old(data)) && (((((((((((((((unknown-#StackHeapBarrier-unknown < s && \valid[temp] == 1) && \valid[s] == 1) && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#length-unknown[s] == 4) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && \valid[temp] == 1) && \valid[s] == 1) && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && \valid[new_head] == 1) && unknown-#length-unknown[s] == 4) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && \old(data) <= 1) && data <= 1) && \old(len) <= 2) && data <= 1) && 2 <= \old(len)) && 0 <= head [2022-11-25 23:38:05,592 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && #NULL <= 0) && ((temp == 0 && head == 0) || (temp == 0 && new_head == 0))) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && \old(len) <= 2) && 0 <= len) && len == 2) && s <= 0) && 0 <= s) && 0 <= \result) && 0 <= #NULL) && i <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= s) && 0 <= head) && #NULL == 0 [2022-11-25 23:38:05,617 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:38:05,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:38:05,620 INFO L158 Benchmark]: Toolchain (without parser) took 18845.40ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 144.5MB in the beginning and 141.3MB in the end (delta: 3.3MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,621 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:38:05,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.24ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 128.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 190.8MB. Free memory was 127.4MB in the beginning and 125.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,622 INFO L158 Benchmark]: Boogie Preprocessor took 28.39ms. Allocated memory is still 190.8MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,622 INFO L158 Benchmark]: RCFGBuilder took 660.71ms. Allocated memory is still 190.8MB. Free memory was 123.8MB in the beginning and 107.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,623 INFO L158 Benchmark]: TraceAbstraction took 17544.48ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 106.4MB in the beginning and 144.4MB in the end (delta: -38.0MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,623 INFO L158 Benchmark]: Witness Printer took 85.83ms. Allocated memory is still 337.6MB. Free memory was 144.4MB in the beginning and 141.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:38:05,625 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.23ms. Allocated memory is still 125.8MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.24ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 128.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 190.8MB. Free memory was 127.4MB in the beginning and 125.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.39ms. Allocated memory is still 190.8MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.71ms. Allocated memory is still 190.8MB. Free memory was 123.8MB in the beginning and 107.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17544.48ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 106.4MB in the beginning and 144.4MB in the end (delta: -38.0MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. * Witness Printer took 85.83ms. Allocated memory is still 337.6MB. Free memory was 144.4MB in the beginning and 141.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: 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 1 procedures, 18 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 56 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=2, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8 NumberOfFragments, 522 HoareAnnotationTreeSize, 4 FomulaSimplifications, 51 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 355 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 10 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 15/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 6.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 20, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 45, TOOLS_POST_TIME: 6.0s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 6.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 83, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 20, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 3.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, 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: 248, DAG_COMPRESSION_RETAINED_NODES: 69, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((((((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && #NULL <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s <= 0) && 0 <= s) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= s) && 0 <= head) && #NULL == 0) || ((((((((((((((((((((((((temp == 0 && data == 1) && new_head == 0) && #NULL == 0) || (((temp == 0 && head == 0) && data == 1) && #NULL == 0)) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && len <= 1) && \old(len) <= 2) && 0 <= len) && len == 2) && s <= 0) && 0 <= s) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= s) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant [2022-11-25 23:38:05,658 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:38:05,659 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:38:05,671 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:38:05,676 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((temp == 0 && head == 0) && data == 1) && s == 0) && #NULL == 0) && #NULL == 0) || (((((temp == 0 && data == 1) && s == 0) && new_head == 0) && #NULL == 0) && #NULL == 0)) && 1 <= data) && ((0 <= head && head <= 0) || len <= 1)) && 2 <= len) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= len) && len <= 2) && 1 <= data) && 1 <= \old(data)) && (((((((((((((((unknown-#StackHeapBarrier-unknown < s && \valid[temp] == 1) && \valid[s] == 1) && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#length-unknown[s] == 4) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((unknown-#StackHeapBarrier-unknown < s && \valid[temp] == 1) && \valid[s] == 1) && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && \valid[new_head] == 1) && unknown-#length-unknown[s] == 4) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && \old(data) <= 1) && data <= 1) && \old(len) <= 2) && data <= 1) && 2 <= \old(len)) && 0 <= head - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && #NULL <= 0) && ((temp == 0 && head == 0) || (temp == 0 && new_head == 0))) && 1 <= data) && 1 <= \old(data)) && data == 1) && \old(data) <= 1) && data <= 1) && \old(len) <= 2) && 0 <= len) && len == 2) && s <= 0) && 0 <= s) && 0 <= \result) && 0 <= #NULL) && i <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= s) && 0 <= head) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-25 23:38:05,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1fe59ca-ee59-4a34-804a-6bc41cd4db4a/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