./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/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_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/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_1860d1a7-034c-4de1-b3cd-221d3c324c6c/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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- 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:41:53,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:41:53,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:41:53,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:41:53,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:41:53,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:41:53,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:41:53,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:41:53,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:41:53,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:41:53,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:41:53,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:41:53,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:41:53,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:41:53,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:41:53,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:41:53,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:41:53,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:41:53,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:41:53,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:41:53,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:41:53,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:41:53,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:41:53,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:41:53,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:41:53,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:41:53,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:41:53,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:41:53,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:41:53,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:41:53,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:41:53,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:41:53,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:41:53,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:41:53,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:41:53,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:41:53,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:41:53,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:41:53,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:41:53,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:41:53,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:41:53,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:41:54,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:41:54,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:41:54,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:41:54,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:41:54,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:41:54,028 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:41:54,028 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:41:54,028 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:41:54,029 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:41:54,029 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:41:54,030 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:41:54,030 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:41:54,030 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:41:54,030 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:41:54,031 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:41:54,031 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:41:54,031 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:41:54,031 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:41:54,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:41:54,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:41:54,032 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:41:54,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:41:54,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:41:54,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:41:54,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:41:54,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:41:54,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:41:54,034 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:41:54,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:41:54,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:41:54,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:41:54,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:41:54,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:41:54,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:41:54,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:41:54,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:41:54,037 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:41:54,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:41:54,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:41:54,038 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:41:54,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:41:54,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:41:54,039 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:41:54,039 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_1860d1a7-034c-4de1-b3cd-221d3c324c6c/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_1860d1a7-034c-4de1-b3cd-221d3c324c6c/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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-25 23:41:54,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:41:54,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:41:54,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:41:54,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:41:54,389 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:41:54,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-25 23:41:57,416 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:41:57,783 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:41:57,783 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-25 23:41:57,795 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/data/634f72d81/6ea9d1ae79524246bc35f37f03e4df98/FLAG95eb5c87a [2022-11-25 23:41:57,817 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/data/634f72d81/6ea9d1ae79524246bc35f37f03e4df98 [2022-11-25 23:41:57,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:41:57,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:41:57,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:41:57,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:41:57,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:41:57,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:41:57" (1/1) ... [2022-11-25 23:41:57,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ade443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:57, skipping insertion in model container [2022-11-25 23:41:57,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:41:57" (1/1) ... [2022-11-25 23:41:57,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:41:57,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:41:58,237 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_1860d1a7-034c-4de1-b3cd-221d3c324c6c/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-25 23:41:58,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:41:58,248 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:41:58,288 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_1860d1a7-034c-4de1-b3cd-221d3c324c6c/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-25 23:41:58,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:41:58,315 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:41:58,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58 WrapperNode [2022-11-25 23:41:58,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:41:58,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:41:58,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:41:58,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:41:58,325 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:41:58" (1/1) ... [2022-11-25 23:41:58,359 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:41:58" (1/1) ... [2022-11-25 23:41:58,394 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-11-25 23:41:58,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:41:58,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:41:58,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:41:58,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:41:58,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:41:58,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:41:58,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:41:58,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:41:58,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (1/1) ... [2022-11-25 23:41:58,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:41:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:41:58,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:41:58,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:41:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:41:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:41:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 23:41:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 23:41:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:41:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:41:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:41:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:41:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:41:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:41:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:41:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:41:58,694 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:41:58,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:41:59,060 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:41:59,125 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:41:59,125 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 23:41:59,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:41:59 BoogieIcfgContainer [2022-11-25 23:41:59,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:41:59,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:41:59,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:41:59,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:41:59,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:41:57" (1/3) ... [2022-11-25 23:41:59,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34031413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:41:59, skipping insertion in model container [2022-11-25 23:41:59,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:41:58" (2/3) ... [2022-11-25 23:41:59,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34031413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:41:59, skipping insertion in model container [2022-11-25 23:41:59,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:41:59" (3/3) ... [2022-11-25 23:41:59,142 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-25 23:41:59,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:41:59,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 23:41:59,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:41:59,234 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;@34bff34e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:41:59,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-25 23:41:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:41:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:41:59,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:59,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:59,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:41:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash -347856173, now seen corresponding path program 1 times [2022-11-25 23:41:59,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:59,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273838881] [2022-11-25 23:41:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:41:59,713 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:41:59,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:41:59,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273838881] [2022-11-25 23:41:59,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273838881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:41:59,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:41:59,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:41:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263407315] [2022-11-25 23:41:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:41:59,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:41:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:41:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:41:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:41:59,787 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:41:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:41:59,891 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-11-25 23:41:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:41:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-25 23:41:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:41:59,901 INFO L225 Difference]: With dead ends: 105 [2022-11-25 23:41:59,901 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:41:59,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:41:59,907 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:41:59,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:41:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:41:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-11-25 23:41:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:41:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-25 23:41:59,946 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2022-11-25 23:41:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:41:59,947 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-25 23:41:59,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:41:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-25 23:41:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:41:59,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:41:59,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:41:59,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:41:59,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:41:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:41:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1398975318, now seen corresponding path program 1 times [2022-11-25 23:41:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:41:59,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780734938] [2022-11-25 23:41:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:41:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:41:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:42:00,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:00,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780734938] [2022-11-25 23:42:00,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780734938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:00,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:00,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89338998] [2022-11-25 23:42:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:00,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:00,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:00,092 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:00,155 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-11-25 23:42:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-11-25 23:42:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:00,157 INFO L225 Difference]: With dead ends: 57 [2022-11-25 23:42:00,157 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 23:42:00,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:00,159 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:00,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 23:42:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 23:42:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-25 23:42:00,166 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2022-11-25 23:42:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:00,167 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-25 23:42:00,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-25 23:42:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:42:00,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:00,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:00,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:42:00,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1489002484, now seen corresponding path program 1 times [2022-11-25 23:42:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:00,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090264093] [2022-11-25 23:42:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:00,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090264093] [2022-11-25 23:42:00,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090264093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:00,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:00,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982979380] [2022-11-25 23:42:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:00,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:00,374 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:00,449 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-25 23:42:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:00,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-11-25 23:42:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:00,451 INFO L225 Difference]: With dead ends: 55 [2022-11-25 23:42:00,451 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 23:42:00,452 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:42:00,453 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:00,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 23:42:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-25 23:42:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-25 23:42:00,461 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2022-11-25 23:42:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:00,462 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-25 23:42:00,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-25 23:42:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:42:00,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:00,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:42:00,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash 450833552, now seen corresponding path program 1 times [2022-11-25 23:42:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076020905] [2022-11-25 23:42:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:00,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:00,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076020905] [2022-11-25 23:42:00,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076020905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:00,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:00,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369210520] [2022-11-25 23:42:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:00,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:00,656 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:00,725 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-25 23:42:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-25 23:42:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:00,726 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:42:00,726 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 23:42:00,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:00,728 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:00,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 23:42:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-11-25 23:42:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-25 23:42:00,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2022-11-25 23:42:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:00,736 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-25 23:42:00,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-25 23:42:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:42:00,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:00,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:00,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:42:00,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1090938302, now seen corresponding path program 1 times [2022-11-25 23:42:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:00,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806106014] [2022-11-25 23:42:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:00,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:00,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806106014] [2022-11-25 23:42:00,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806106014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:00,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:00,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648746226] [2022-11-25 23:42:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:00,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:00,852 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:00,927 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-25 23:42:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-25 23:42:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:00,930 INFO L225 Difference]: With dead ends: 76 [2022-11-25 23:42:00,931 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 23:42:00,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:00,939 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:00,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 23:42:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2022-11-25 23:42:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-25 23:42:00,958 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 20 [2022-11-25 23:42:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:00,959 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-25 23:42:00,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-25 23:42:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:42:00,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:00,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:00,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:42:00,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1668340695, now seen corresponding path program 1 times [2022-11-25 23:42:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:00,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394545356] [2022-11-25 23:42:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:42:01,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:01,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394545356] [2022-11-25 23:42:01,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394545356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:01,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120747054] [2022-11-25 23:42:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:01,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:01,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:01,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:01,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:42:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:01,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:42:01,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:42:01,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:01,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120747054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:01,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:42:01,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 23:42:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805076086] [2022-11-25 23:42:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:42:01,425 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:42:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:01,510 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-11-25 23:42:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:42:01,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-11-25 23:42:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:01,512 INFO L225 Difference]: With dead ends: 96 [2022-11-25 23:42:01,512 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 23:42:01,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:42:01,521 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:01,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 23:42:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-25 23:42:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-25 23:42:01,532 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2022-11-25 23:42:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:01,533 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-25 23:42:01,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:42:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-25 23:42:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:42:01,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:01,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:01,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:01,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:42:01,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash 419694547, now seen corresponding path program 1 times [2022-11-25 23:42:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:01,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970474059] [2022-11-25 23:42:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:01,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:01,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970474059] [2022-11-25 23:42:01,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970474059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:01,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:01,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418158159] [2022-11-25 23:42:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:01,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:01,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:01,822 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:01,890 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-11-25 23:42:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:42:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:01,891 INFO L225 Difference]: With dead ends: 49 [2022-11-25 23:42:01,891 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 23:42:01,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:01,893 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:01,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 23:42:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 23:42:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-25 23:42:01,899 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2022-11-25 23:42:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:01,899 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-25 23:42:01,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-25 23:42:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:42:01,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:01,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:01,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:42:01,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 419690784, now seen corresponding path program 1 times [2022-11-25 23:42:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:01,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252291889] [2022-11-25 23:42:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:01,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:01,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252291889] [2022-11-25 23:42:01,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252291889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:01,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:01,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745838319] [2022-11-25 23:42:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:01,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:01,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:01,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:01,973 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:02,010 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-11-25 23:42:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:42:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:02,012 INFO L225 Difference]: With dead ends: 48 [2022-11-25 23:42:02,012 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:42:02,012 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:42:02,013 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:02,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:42:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 23:42:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-25 23:42:02,020 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 22 [2022-11-25 23:42:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:02,020 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-25 23:42:02,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-25 23:42:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:42:02,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:02,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:02,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:42:02,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 125629172, now seen corresponding path program 1 times [2022-11-25 23:42:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:02,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4605401] [2022-11-25 23:42:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:02,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:02,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4605401] [2022-11-25 23:42:02,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4605401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:02,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:02,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:42:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222103155] [2022-11-25 23:42:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:02,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:42:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:42:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:42:02,160 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:02,254 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-11-25 23:42:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:42:02,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-25 23:42:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:02,256 INFO L225 Difference]: With dead ends: 57 [2022-11-25 23:42:02,256 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 23:42:02,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:42:02,257 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 85 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:02,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 64 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 23:42:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2022-11-25 23:42:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-25 23:42:02,263 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2022-11-25 23:42:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:02,263 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-25 23:42:02,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-25 23:42:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:42:02,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:02,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:02,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:42:02,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 125512507, now seen corresponding path program 1 times [2022-11-25 23:42:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:02,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268055111] [2022-11-25 23:42:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:02,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:02,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268055111] [2022-11-25 23:42:02,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268055111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:02,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:02,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:42:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124737254] [2022-11-25 23:42:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:02,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:42:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:42:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:42:02,459 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:02,610 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-11-25 23:42:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:42:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-25 23:42:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:02,613 INFO L225 Difference]: With dead ends: 61 [2022-11-25 23:42:02,613 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:42:02,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:42:02,615 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 111 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:02,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 74 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:42:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-11-25 23:42:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 23:42:02,635 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 23 [2022-11-25 23:42:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:02,635 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 23:42:02,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 23:42:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 23:42:02,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:02,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:02,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:42:02,643 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 210389729, now seen corresponding path program 1 times [2022-11-25 23:42:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:02,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279730067] [2022-11-25 23:42:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:42:02,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:02,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279730067] [2022-11-25 23:42:02,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279730067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:02,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:02,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:42:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613410286] [2022-11-25 23:42:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:02,799 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:02,892 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-25 23:42:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:42:02,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-25 23:42:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:02,893 INFO L225 Difference]: With dead ends: 89 [2022-11-25 23:42:02,894 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 23:42:02,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:42:02,895 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:02,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 61 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 23:42:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-11-25 23:42:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-25 23:42:02,908 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2022-11-25 23:42:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:02,909 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-25 23:42:02,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-25 23:42:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:42:02,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:02,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:02,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:42:02,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash 343892484, now seen corresponding path program 1 times [2022-11-25 23:42:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:02,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019224012] [2022-11-25 23:42:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:42:03,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:03,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019224012] [2022-11-25 23:42:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019224012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:03,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573125510] [2022-11-25 23:42:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:03,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:03,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:42:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:03,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:42:03,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:42:03,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:42:03,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573125510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:03,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [776685232] [2022-11-25 23:42:03,554 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-25 23:42:03,555 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:03,560 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:03,565 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:03,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:03,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:42:03,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:03,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:03,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:03,733 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 21 treesize of output 26 [2022-11-25 23:42:03,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:03,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:03,748 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 27 treesize of output 17 [2022-11-25 23:42:03,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:03,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:03,760 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 27 treesize of output 17 [2022-11-25 23:42:04,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:04,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:04,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:04,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:04,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:04,439 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,441 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,443 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,445 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:42:04,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:04,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:04,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:04,770 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,772 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,775 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:04,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:04,869 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:42:04,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 34 [2022-11-25 23:42:04,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:04,898 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:42:04,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 30 [2022-11-25 23:42:04,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:04,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-25 23:42:05,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:42:05,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:05,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:05,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:05,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:05,411 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-25 23:42:05,411 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 6 case distinctions, treesize of input 329 treesize of output 339 [2022-11-25 23:42:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:05,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:05,544 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-25 23:42:05,545 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 6 case distinctions, treesize of input 305 treesize of output 323 [2022-11-25 23:42:08,363 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:42:08,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 255 [2022-11-25 23:42:08,402 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:42:08,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 251 [2022-11-25 23:42:08,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:08,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:08,971 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:42:08,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 257 [2022-11-25 23:42:09,038 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:42:09,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 253 [2022-11-25 23:42:09,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:09,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:09,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:09,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:09,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:09,670 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,671 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,674 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,676 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:09,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:09,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:09,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:09,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:09,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,945 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,949 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:09,975 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-25 23:42:10,140 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:15,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [776685232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:15,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:15,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [7, 7, 7] total 26 [2022-11-25 23:42:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606282834] [2022-11-25 23:42:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:15,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:42:15,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:15,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:42:15,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:42:15,659 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:17,558 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-11-25 23:42:17,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:42:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-25 23:42:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:17,560 INFO L225 Difference]: With dead ends: 59 [2022-11-25 23:42:17,560 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 23:42:17,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:42:17,561 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:17,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 112 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:42:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 23:42:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-11-25 23:42:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-25 23:42:17,575 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2022-11-25 23:42:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:17,576 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-25 23:42:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-25 23:42:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:42:17,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:17,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:17,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:17,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:17,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1715193239, now seen corresponding path program 1 times [2022-11-25 23:42:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302454599] [2022-11-25 23:42:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:17,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:42:17,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:17,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302454599] [2022-11-25 23:42:17,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302454599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:17,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:17,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008670295] [2022-11-25 23:42:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:17,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:17,889 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:17,927 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-25 23:42:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:17,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-25 23:42:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:17,929 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:42:17,929 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:42:17,930 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:42:17,931 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:17,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:42:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 23:42:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-25 23:42:17,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-11-25 23:42:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:17,950 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-25 23:42:17,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-25 23:42:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:42:17,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:17,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:17,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:42:17,952 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:17,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1631382992, now seen corresponding path program 1 times [2022-11-25 23:42:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:17,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962204894] [2022-11-25 23:42:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:42:18,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:18,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962204894] [2022-11-25 23:42:18,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962204894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:18,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156713206] [2022-11-25 23:42:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:18,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:18,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:18,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:18,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:42:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:18,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:42:18,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:42:18,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:42:18,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156713206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:18,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2069312356] [2022-11-25 23:42:18,479 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-25 23:42:18,479 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:18,480 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:18,480 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:18,480 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:18,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:18,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:42:18,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:18,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:18,532 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 27 treesize of output 17 [2022-11-25 23:42:18,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:18,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:18,550 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 21 treesize of output 26 [2022-11-25 23:42:18,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:18,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:18,560 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 27 treesize of output 17 [2022-11-25 23:42:18,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:18,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:18,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:18,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:18,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:18,850 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:18,852 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:18,854 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:18,855 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:19,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:19,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:19,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:42:19,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:19,062 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:19,064 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:19,066 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:19,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,120 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:42:19,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 32 [2022-11-25 23:42:19,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,162 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:42:19,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 28 [2022-11-25 23:42:19,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-25 23:42:19,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:42:19,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:19,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:19,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:19,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:19,554 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-25 23:42:19,555 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 6 case distinctions, treesize of input 329 treesize of output 347 [2022-11-25 23:42:19,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:19,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:19,657 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-25 23:42:19,658 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 6 case distinctions, treesize of input 305 treesize of output 315 [2022-11-25 23:42:21,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:28,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:28,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:28,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:29,294 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:42:29,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-25 23:42:29,325 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:42:29,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-25 23:42:29,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:30,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:30,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:30,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:30,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:30,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:30,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:42:30,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:30,234 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,238 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,240 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:30,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:30,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:30,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:30,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:30,471 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,473 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,475 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:30,504 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-25 23:42:30,651 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:36,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2069312356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:36,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:36,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 30 [2022-11-25 23:42:36,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325024912] [2022-11-25 23:42:36,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:36,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:42:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:42:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:42:36,787 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:40,052 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-11-25 23:42:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:42:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-25 23:42:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:40,053 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:42:40,053 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 23:42:40,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 71 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:42:40,055 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:40,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 23:42:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 23:42:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2022-11-25 23:42:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-25 23:42:40,067 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 35 [2022-11-25 23:42:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:40,067 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-25 23:42:40,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-25 23:42:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:42:40,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:40,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:40,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:42:40,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:40,274 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1319076715, now seen corresponding path program 1 times [2022-11-25 23:42:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:40,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121123198] [2022-11-25 23:42:40,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:42:40,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:40,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121123198] [2022-11-25 23:42:40,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121123198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:40,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045849431] [2022-11-25 23:42:40,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:40,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:40,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:40,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:40,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:42:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:40,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:42:40,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:42:40,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:42:40,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045849431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:40,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812881071] [2022-11-25 23:42:40,745 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-25 23:42:40,745 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:40,746 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:40,747 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:40,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:40,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:42:40,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:40,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,800 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 27 treesize of output 17 [2022-11-25 23:42:40,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,816 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 21 treesize of output 26 [2022-11-25 23:42:40,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,824 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 27 treesize of output 17 [2022-11-25 23:42:40,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:40,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:40,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:40,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:40,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:41,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:41,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:41,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:41,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:41,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:41,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-25 23:42:41,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,177 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:42:41,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 334 [2022-11-25 23:42:41,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,228 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:42:41,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 246 [2022-11-25 23:42:41,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,261 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 49 treesize of output 13 [2022-11-25 23:42:41,283 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-25 23:42:41,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 38 [2022-11-25 23:42:41,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-25 23:42:41,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:41,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:41,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:42:41,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:41,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:41,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:41,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 19 treesize of output 1 [2022-11-25 23:42:41,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:42,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:42,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:42,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:42,212 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:42:42,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-25 23:42:42,242 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:42:42,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-25 23:42:42,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:42,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:42,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:42,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:42,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:42,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:42,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:42,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:42,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:42,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:42,856 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-25 23:42:43,005 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1812881071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:48,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:48,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 30 [2022-11-25 23:42:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962623201] [2022-11-25 23:42:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:42:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:42:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:42:48,281 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:51,296 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-11-25 23:42:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:42:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-25 23:42:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:51,305 INFO L225 Difference]: With dead ends: 61 [2022-11-25 23:42:51,305 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:42:51,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:42:51,306 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:51,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 97 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:42:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:42:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-11-25 23:42:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 23:42:51,320 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2022-11-25 23:42:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:51,321 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 23:42:51,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 23:42:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:42:51,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:51,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:51,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:51,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:42:51,529 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1318989094, now seen corresponding path program 1 times [2022-11-25 23:42:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:51,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310452704] [2022-11-25 23:42:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:42:51,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:51,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310452704] [2022-11-25 23:42:51,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310452704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:51,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:51,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333171703] [2022-11-25 23:42:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:51,615 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:51,676 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-25 23:42:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-11-25 23:42:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:51,678 INFO L225 Difference]: With dead ends: 48 [2022-11-25 23:42:51,678 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:42:51,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:51,679 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:51,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:42:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 23:42:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:42:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-25 23:42:51,693 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 38 [2022-11-25 23:42:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:51,693 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-25 23:42:51,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-25 23:42:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:42:51,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:51,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:51,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:42:51,695 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:42:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2061011198, now seen corresponding path program 1 times [2022-11-25 23:42:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46063028] [2022-11-25 23:42:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:42:51,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:51,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46063028] [2022-11-25 23:42:51,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46063028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:51,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574485747] [2022-11-25 23:42:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:51,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:51,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:42:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:52,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:42:52,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:42:52,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:42:52,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574485747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:52,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091556880] [2022-11-25 23:42:52,203 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-25 23:42:52,204 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:52,204 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:52,204 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:52,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:52,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:42:52,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:52,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,255 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 27 treesize of output 17 [2022-11-25 23:42:52,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,268 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 27 treesize of output 17 [2022-11-25 23:42:52,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,285 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 21 treesize of output 26 [2022-11-25 23:42:52,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:52,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:52,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:52,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:52,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:52,551 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,559 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,561 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,563 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:52,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:42:52,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:52,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:52,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:52,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,745 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,749 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:52,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,797 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:42:52,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 28 [2022-11-25 23:42:52,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,821 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:42:52,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 32 [2022-11-25 23:42:52,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-25 23:42:52,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:52,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:42:52,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:52,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:52,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:42:53,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:53,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:53,152 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-25 23:42:53,153 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 6 case distinctions, treesize of input 328 treesize of output 346 [2022-11-25 23:42:53,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:53,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:53,241 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-25 23:42:53,242 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 6 case distinctions, treesize of input 304 treesize of output 314 [2022-11-25 23:42:53,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:57,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:57,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:42:57,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:57,262 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:42:57,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 245 [2022-11-25 23:42:57,292 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:42:57,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 245 [2022-11-25 23:42:57,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:42:58,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:58,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:42:58,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:58,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:58,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:42:58,223 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:58,225 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:58,226 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:58,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:58,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:58,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:58,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:58,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:42:58,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:42:58,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:42:58,398 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:58,400 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:58,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:42:58,425 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-25 23:42:58,560 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:43:05,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2091556880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:06,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:06,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 32 [2022-11-25 23:43:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066819972] [2022-11-25 23:43:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:06,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 23:43:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 23:43:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:43:06,002 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 24 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:43:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:09,594 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-25 23:43:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:43:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-25 23:43:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:09,595 INFO L225 Difference]: With dead ends: 63 [2022-11-25 23:43:09,595 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 23:43:09,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 23:43:09,597 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:09,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 96 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 23:43:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 23:43:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-25 23:43:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:43:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-25 23:43:09,613 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2022-11-25 23:43:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:09,614 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-25 23:43:09,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:43:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-25 23:43:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:43:09,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:09,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:09,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:43:09,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-25 23:43:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1796103701, now seen corresponding path program 1 times [2022-11-25 23:43:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:43:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078688823] [2022-11-25 23:43:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:43:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:43:09,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:43:09,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078688823] [2022-11-25 23:43:09,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078688823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574550326] [2022-11-25 23:43:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:09,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:09,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:43:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:10,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:43:10,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:43:10,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:43:10,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574550326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:10,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000000007] [2022-11-25 23:43:10,312 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-25 23:43:10,312 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:43:10,312 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:43:10,313 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:43:10,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:43:10,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:43:10,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:10,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,367 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 21 treesize of output 26 [2022-11-25 23:43:10,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,374 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 27 treesize of output 17 [2022-11-25 23:43:10,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,382 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 27 treesize of output 17 [2022-11-25 23:43:10,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:10,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:43:10,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:43:10,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:10,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:43:10,677 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:10,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:10,680 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:10,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:10,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:43:10,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:10,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:43:10,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:43:10,897 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:10,899 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:10,901 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:10,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-25 23:43:10,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:10,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:10,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,028 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 23:43:11,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 339 [2022-11-25 23:43:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,076 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 23:43:11,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 241 [2022-11-25 23:43:11,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,108 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 37 treesize of output 13 [2022-11-25 23:43:11,138 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 23:43:11,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 26 [2022-11-25 23:43:11,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-11-25 23:43:11,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-11-25 23:43:11,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:43:11,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 23:43:11,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,628 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-25 23:43:11,629 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 6 case distinctions, treesize of input 329 treesize of output 347 [2022-11-25 23:43:11,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:11,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,728 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-25 23:43:11,728 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 6 case distinctions, treesize of input 305 treesize of output 315 [2022-11-25 23:43:14,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:43:27,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:43:27,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:43:27,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:43:27,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:43:27,821 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:43:27,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-11-25 23:43:27,852 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-25 23:43:27,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-11-25 23:43:29,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:29,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:43:29,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:43:29,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 23:43:29,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:29,295 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,296 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,298 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,301 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:29,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:43:29,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:29,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 23:43:29,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:29,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:43:29,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 23:43:29,517 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,518 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,520 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,522 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:43:29,546 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-25 23:43:29,695 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:43:38,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1000000007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:38,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:38,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [6, 6, 6] total 35 [2022-11-25 23:43:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096294866] [2022-11-25 23:43:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:43:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:38,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:43:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:43:38,350 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:43:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:46,717 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-25 23:43:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 23:43:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-25 23:43:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:46,717 INFO L225 Difference]: With dead ends: 56 [2022-11-25 23:43:46,718 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:43:46,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 23:43:46,719 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:46,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 23:43:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:43:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:43:46,720 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:43:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:43:46,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-25 23:43:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:46,721 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:43:46,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:43:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:43:46,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:43:46,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-11-25 23:43:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-11-25 23:43:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-11-25 23:43:46,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-11-25 23:43:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-11-25 23:43:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-11-25 23:43:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-11-25 23:43:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-11-25 23:43:46,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-11-25 23:43:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-11-25 23:43:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-11-25 23:43:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-11-25 23:43:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-11-25 23:43:46,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-11-25 23:43:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-11-25 23:43:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-11-25 23:43:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-11-25 23:43:46,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-11-25 23:43:46,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:46,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:43:46,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:43:52,220 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,220 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-11-25 23:43:52,220 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-11-25 23:43:52,221 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 4) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (= (select .cse2 0) 48) (= 27 (select |#length| 2)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse1 0) 0) (= (select .cse2 1) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-25 23:43:52,221 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2022-11-25 23:43:52,221 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point L631(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,222 INFO L899 garLoopResultBuilder]: For program point L631-5(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,223 INFO L899 garLoopResultBuilder]: For program point L631-6(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,223 INFO L895 garLoopResultBuilder]: At program point L631-7(lines 631 634) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse15 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse16 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse17 (<= 0 |#StackHeapBarrier|)) (.cse18 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse19 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse20 (= |#NULL.base| 0))) (or (and .cse0 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse7 .cse8 (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3) .cse9 (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|) .cse10 .cse11 (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1) .cse12 .cse13 .cse14 (<= |ULTIMATE.start_main_~new_data~0#1| 3) .cse15 .cse16 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3) .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and .cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse21) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse21) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse19 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse20)))) [2022-11-25 23:43:52,223 INFO L899 garLoopResultBuilder]: For program point L631-8(lines 631 634) no Hoare annotation was computed. [2022-11-25 23:43:52,223 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,223 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2022-11-25 23:43:52,223 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,224 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point L635-5(line 635) no Hoare annotation was computed. [2022-11-25 23:43:52,225 INFO L895 garLoopResultBuilder]: At program point L635-6(lines 635 640) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:43:52,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2022-11-25 23:43:52,226 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2022-11-25 23:43:52,227 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-11-25 23:43:52,227 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse9 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse12 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) .cse9 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) .cse8 .cse9 .cse10 .cse11 (< 0 |ULTIMATE.start_dll_circular_update_at_#in~index#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse12))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (let ((.cse14 (+ |ULTIMATE.start_main_~i~0#1| 1))) (or (let ((.cse13 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse13) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| .cse14) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 0 .cse14)))) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-25 23:43:52,227 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-11-25 23:43:52,228 INFO L895 garLoopResultBuilder]: At program point L637(lines 637 639) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647)) (.cse1 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648))) (.cse10 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse11 (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse13 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse14 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse15 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse18 (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3)) (.cse19 (= |ULTIMATE.start_main_#t~ret17#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse22 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1)) (.cse25 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse26 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse27 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse28 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse29 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse30 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (.cse31 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse32 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse8 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse34 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse35 (= |#NULL.base| 0)) (.cse36 (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (.cse37 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (< 0 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse27 .cse28 .cse29 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) .cse12 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_main_~len~0#1| .cse8) .cse34 .cse35 .cse36 .cse37))) [2022-11-25 23:43:52,228 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-25 23:43:52,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-11-25 23:43:52,228 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (select |#memory_int| 1))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) .cse1 (= (select .cse2 4) 0) (= (select |#valid| 0) 0) .cse3 (= (select |#valid| 2) 1) .cse4 .cse5 (= (select .cse6 0) 48) (= 27 (select |#length| 2)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select .cse2 0) 0) (= (select .cse6 1) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8)) (and (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse1 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse8))) [2022-11-25 23:43:52,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-25 23:43:52,229 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse12 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse15 (<= |ULTIMATE.start_dll_circular_update_at_#in~data#1| 3)) (.cse16 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (<= 0 |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse18 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (<= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1)) (.cse21 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse24 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse0 (<= 0 |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse11 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse23 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (.cse27 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse25 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse26 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse28 (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (.cse29 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse30 (<= |ULTIMATE.start_dll_circular_update_at_~data#1| 3)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse33 (= |#NULL.base| 0)) (.cse34 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))) (or (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse32 .cse33 .cse34) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 (let ((.cse35 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|))) (or (and .cse0 .cse2 .cse8 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) .cse10 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) .cse35 .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (and .cse0 .cse1 .cse2 .cse8 .cse10 .cse35 .cse11 .cse23 .cse27))) (<= 3 |ULTIMATE.start_main_~expected~0#1|) .cse25 .cse26 (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) [2022-11-25 23:43:52,229 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-25 23:43:52,229 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-25 23:43:52,230 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (or (not (= |node_create_#in~data#1| 1)) (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse4 (not (= |#NULL.base| 0)))) (and (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|)) (.cse3 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 1)) (not (= (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 8) |node_create_#in~data#1|)) (not (= (select .cse2 0) 0)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 12)) (not (= (select .cse2 4) 0)) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|)) (not (= (select .cse3 0) 0)) (not (= (select .cse3 4) 0)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 0)))) .cse4) (let ((.cse5 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse4 (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse5 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse5 1) 0)))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-25 23:43:52,230 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-25 23:43:52,233 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:52,236 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:43:52,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,254 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,255 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,256 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,260 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,261 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,270 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:43:52 BoogieIcfgContainer [2022-11-25 23:43:52,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:43:52,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:43:52,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:43:52,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:43:52,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:41:59" (3/4) ... [2022-11-25 23:43:52,291 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:43:52,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-25 23:43:52,302 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-25 23:43:52,302 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-25 23:43:52,303 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:43:52,303 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:43:52,325 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && data == 1) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) [2022-11-25 23:43:52,326 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((0 <= s && 0 <= head) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && 0 <= i + 2147483648) && head <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) || (((((((((((((((((((((((((((0 <= s && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && 0 <= head) && \result == head) && #NULL == 0) [2022-11-25 23:43:52,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((0 <= s && 0 <= head) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 <= i + 2147483648) && head <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && i <= 1) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-25 23:43:52,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((\old(data) == data && 0 <= s) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((((((((((\old(data) == data && 0 <= s) && head == #memory_$Pointer$[head][head]) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && 0 < \old(index)) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data)) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && #memory_$Pointer$[last][last] == head) && len == i + 1) && \result == head) || (i <= 0 && 0 < i + 1))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-25 23:43:52,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((0 <= s && 0 <= head) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && 0 < i + 1) && len + i == expected) && head <= 0) && s == head) && \old(index) == i) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && new_data <= 3) && len <= 1) && head == head) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0) || (((((((((((((((((((((((((((((1 <= len && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && head <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((0 <= head && 2 <= \old(len)) && len + i == expected) && head == #memory_$Pointer$[head][head]) && s == head) && \old(index) == index + 1) && head == s) && \old(index) == i) && #memory_$Pointer$[head][head] == head) || ((((((((0 <= head && \old(index) == index) && 2 <= \old(len)) && len + i == expected) && s == head) && head == s) && \old(index) == i) && head == head) && head == head))) && 3 <= expected) && new_data <= 3) && len <= 1) && \old(index) <= 1) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && head <= 0) [2022-11-25 23:43:52,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= head) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 0 < i + 1) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && head <= 0) && s == head) && head == s) && \old(index) == i) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && new_data <= 3) && len <= 1) && head == head) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) || ((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= head) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && head <= 0) && head == #memory_$Pointer$[head][head]) && s == head) && \old(index) == index + 1) && head == s) && \old(index) == i) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && #memory_$Pointer$[head][head] == head) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && new_data <= 3) && len <= 1) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) [2022-11-25 23:43:52,343 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:43:52,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:43:52,344 INFO L158 Benchmark]: Toolchain (without parser) took 114522.39ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 145.2MB in the beginning and 394.8MB in the end (delta: -249.6MB). Peak memory consumption was 523.1MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,344 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 130.0MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:43:52,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.65ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 127.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.73ms. Allocated memory is still 178.3MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,345 INFO L158 Benchmark]: Boogie Preprocessor took 66.36ms. Allocated memory is still 178.3MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,345 INFO L158 Benchmark]: RCFGBuilder took 665.36ms. Allocated memory is still 178.3MB. Free memory was 122.9MB in the beginning and 100.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,346 INFO L158 Benchmark]: TraceAbstraction took 113157.32ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 99.8MB in the beginning and 399.0MB in the end (delta: -299.2MB). Peak memory consumption was 533.6MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,346 INFO L158 Benchmark]: Witness Printer took 56.00ms. Allocated memory is still 947.9MB. Free memory was 399.0MB in the beginning and 394.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:43:52,347 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.25ms. Allocated memory is still 130.0MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.65ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 127.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.73ms. Allocated memory is still 178.3MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.36ms. Allocated memory is still 178.3MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 665.36ms. Allocated memory is still 178.3MB. Free memory was 122.9MB in the beginning and 100.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 113157.32ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 99.8MB in the beginning and 399.0MB in the end (delta: -299.2MB). Peak memory consumption was 533.6MB. Max. memory is 16.1GB. * Witness Printer took 56.00ms. Allocated memory is still 947.9MB. Free memory was 399.0MB in the beginning and 394.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 113.0s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 755 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3494 IncrementalHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 442 mSDtfsCounter, 3494 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 428 SyntacticMatches, 56 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 47.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 104 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 34 NumberOfFragments, 1613 HoareAnnotationTreeSize, 16 FomulaSimplifications, 123 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 24069 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 847 ConstructedInterpolants, 0 QuantifiedInterpolants, 2097 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2084 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 203/222 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: 46.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 178, DAG_INTERPRETER_EARLY_EXITS: 10, TOOLS_POST_APPLICATIONS: 388, TOOLS_POST_TIME: 39.3s, TOOLS_POST_CALL_APPLICATIONS: 40, TOOLS_POST_CALL_TIME: 2.8s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 2.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 453, TOOLS_QUANTIFIERELIM_TIME: 44.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 7.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 718, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 80, DOMAIN_JOIN_TIME: 1.1s, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.7s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 46, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 178, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 30.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 30.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 46, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.3s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 9213, DAG_COMPRESSION_RETAINED_NODES: 554, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant [2022-11-25 23:43:52,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((\old(data) == data && 0 <= s) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((((((((((\old(data) == data && 0 <= s) && head == #memory_$Pointer$[head][head]) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && 0 < \old(index)) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data)) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((head == #memory_$Pointer$[last][last] && #memory_$Pointer$[head][head + 4] == last) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && #memory_$Pointer$[last][last] == head) && len == i + 1) && \result == head) || (i <= 0 && 0 < i + 1))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 637]: Loop Invariant [2022-11-25 23:43:52,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= head) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && 0 < i + 1) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && head <= 0) && s == head) && head == s) && \old(index) == i) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && new_data <= 3) && len <= 1) && head == head) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) || ((((((((((((((((((((((((((((((((((((((((aux-dll_circular_get_data_at(s, i)-aux <= 2147483647 && 0 <= head) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 <= aux-dll_circular_get_data_at(s, i)-aux + 2147483648) && len + i == expected) && head <= 0) && head == #memory_$Pointer$[head][head]) && s == head) && \old(index) == index + 1) && head == s) && \old(index) == i) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && #memory_$Pointer$[head][head] == head) && aux-dll_circular_get_data_at(s, i)-aux == \result) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && new_data <= 3) && len <= 1) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0) && unknown-#memory_int-unknown[head][8 + head] == \result) && head <= 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((0 <= s && 0 <= head) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 <= i + 2147483648) && head <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && i <= 1) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2022-11-25 23:43:52,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && data == 1) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 631]: Loop Invariant [2022-11-25 23:43:52,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((0 <= s && 0 <= head) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && 0 <= i + 2147483648) && head <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && new_data <= 3) && len <= 1) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) || (((((((((((((((((((((((((((0 <= s && head == #memory_$Pointer$[last][last]) && #memory_$Pointer$[head][head + 4] == last) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && #memory_$Pointer$[head][head + 4] == last) && \result == s) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && #memory_$Pointer$[last][last] == head) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && 0 <= head) && \result == head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant [2022-11-25 23:43:52,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 23:43:52,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 23:43:52,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((0 <= s && 0 <= head) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && 0 < i + 1) && len + i == expected) && head <= 0) && s == head) && \old(index) == i) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && head == head) && \old(len) <= 2) && new_data <= 3) && len <= 1) && head == head) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && #NULL == 0) && head <= 0) || (((((((((((((((((((((((((((((1 <= len && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && head <= 0) && index <= 0) && data == 1) && 1 <= \old(data)) && \old(data) <= 3) && len == 2) && 0 <= index) && 0 <= \result) && #NULL == 0) && \old(index) <= 1) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((0 <= head && 2 <= \old(len)) && len + i == expected) && head == #memory_$Pointer$[head][head]) && s == head) && \old(index) == index + 1) && head == s) && \old(index) == i) && #memory_$Pointer$[head][head] == head) || ((((((((0 <= head && \old(index) == index) && 2 <= \old(len)) && len + i == expected) && s == head) && head == s) && \old(index) == i) && head == head) && head == head))) && 3 <= expected) && new_data <= 3) && len <= 1) && \old(index) <= 1) && 0 <= head) && data <= 1) && data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && #NULL == 0) && head <= 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 23:43:52,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1860d1a7-034c-4de1-b3cd-221d3c324c6c/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