./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 2329fc70 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_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/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_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 09:08:55,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:08:55,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:08:55,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:08:55,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:08:55,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:08:55,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:08:55,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:08:55,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:08:55,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:08:55,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:08:55,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:08:55,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:08:55,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:08:55,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:08:55,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:08:55,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:08:55,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:08:55,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:08:55,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:08:55,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:08:55,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:08:55,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:08:55,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:08:55,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:08:55,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:08:55,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:08:55,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:08:55,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:08:55,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:08:55,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:08:55,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:08:55,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:08:55,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:08:55,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:08:55,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:08:55,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:08:55,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:08:55,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:08:55,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:08:55,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:08:55,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 09:08:55,639 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:08:55,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:08:55,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:08:55,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:08:55,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:08:55,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:08:55,645 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:08:55,645 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:08:55,645 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:08:55,645 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:08:55,645 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:08:55,646 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:08:55,646 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:08:55,646 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:08:55,646 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:08:55,646 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:08:55,646 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:08:55,647 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:08:55,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:08:55,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:08:55,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:08:55,649 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 09:08:55,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:08:55,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:08:55,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:08:55,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:08:55,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:08:55,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:08:55,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:08:55,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:08:55,650 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:08:55,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:08:55,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:08:55,650 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:08:55,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:08:55,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:08:55,651 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:08:55,651 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_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/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_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh 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-12-14 09:08:55,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:08:55,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:08:55,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:08:55,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:08:55,881 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:08:55,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-12-14 09:08:58,507 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:08:58,704 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:08:58,704 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-12-14 09:08:58,711 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/data/a19bce307/3124025a82ba427082cb70b32098fd1e/FLAGae76a2cae [2022-12-14 09:08:58,722 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/data/a19bce307/3124025a82ba427082cb70b32098fd1e [2022-12-14 09:08:58,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:08:58,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:08:58,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:08:58,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:08:58,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:08:58,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:58,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11007134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58, skipping insertion in model container [2022-12-14 09:08:58,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:58,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:08:58,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:08:58,943 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_1e279704-2e7e-4798-8193-0344f24af723/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-12-14 09:08:58,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:08:58,951 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:08:58,979 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_1e279704-2e7e-4798-8193-0344f24af723/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-12-14 09:08:58,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:08:58,996 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:08:58,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58 WrapperNode [2022-12-14 09:08:58,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:08:58,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:08:58,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:08:58,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:08:59,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,046 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-12-14 09:08:59,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:08:59,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:08:59,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:08:59,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:08:59,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,074 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:08:59,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:08:59,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:08:59,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:08:59,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (1/1) ... [2022-12-14 09:08:59,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:08:59,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:08:59,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:08:59,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:08:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 09:08:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 09:08:59,134 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:08:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:08:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:08:59,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:08:59,233 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:08:59,235 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:08:59,461 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:08:59,524 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:08:59,524 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 09:08:59,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:08:59 BoogieIcfgContainer [2022-12-14 09:08:59,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:08:59,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:08:59,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:08:59,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:08:59,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:08:58" (1/3) ... [2022-12-14 09:08:59,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f93595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:08:59, skipping insertion in model container [2022-12-14 09:08:59,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:58" (2/3) ... [2022-12-14 09:08:59,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f93595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:08:59, skipping insertion in model container [2022-12-14 09:08:59,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:08:59" (3/3) ... [2022-12-14 09:08:59,536 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-12-14 09:08:59,553 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:08:59,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-14 09:08:59,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:08:59,607 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;@7c4fe14a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:08:59,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-12-14 09:08:59,611 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-12-14 09:08:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 09:08:59,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:08:59,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:08:59,619 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-12-14 09:08:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:08:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash -347856173, now seen corresponding path program 1 times [2022-12-14 09:08:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:08:59,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155483151] [2022-12-14 09:08:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:08:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:08:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:08:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:08:59,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:08:59,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155483151] [2022-12-14 09:08:59,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155483151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:08:59,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:08:59,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:08:59,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583092098] [2022-12-14 09:08:59,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:08:59,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:08:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:08:59,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:08:59,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:08:59,925 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-12-14 09:08:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:08:59,982 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-12-14 09:08:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:08:59,984 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-12-14 09:08:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:08:59,989 INFO L225 Difference]: With dead ends: 105 [2022-12-14 09:08:59,989 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 09:08:59,991 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-12-14 09:08:59,993 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:08:59,994 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.0s Time] [2022-12-14 09:09:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 09:09:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-12-14 09:09:00,019 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-12-14 09:09:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-12-14 09:09:00,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2022-12-14 09:09:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:00,021 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-12-14 09:09:00,021 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-12-14 09:09:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-12-14 09:09:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:09:00,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:00,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:09:00,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:09:00,022 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-12-14 09:09:00,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1398975318, now seen corresponding path program 1 times [2022-12-14 09:09:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:00,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483576110] [2022-12-14 09:09:00,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:00,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:09:00,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:00,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483576110] [2022-12-14 09:09:00,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483576110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:00,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:00,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:09:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235355833] [2022-12-14 09:09:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:00,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:09:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:00,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:09:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:09:00,177 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-12-14 09:09:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:00,234 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-12-14 09:09:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:09:00,235 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-12-14 09:09:00,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:00,236 INFO L225 Difference]: With dead ends: 57 [2022-12-14 09:09:00,236 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 09:09:00,237 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-12-14 09:09:00,238 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-12-14 09:09:00,239 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-12-14 09:09:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 09:09:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 09:09:00,245 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-12-14 09:09:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-12-14 09:09:00,247 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2022-12-14 09:09:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:00,247 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-12-14 09:09:00,248 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-12-14 09:09:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-12-14 09:09:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:09:00,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:00,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:09:00,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:09:00,249 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-12-14 09:09:00,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1489002484, now seen corresponding path program 1 times [2022-12-14 09:09:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:00,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952299984] [2022-12-14 09:09:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:00,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:00,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952299984] [2022-12-14 09:09:00,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952299984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:00,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:00,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:09:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813403833] [2022-12-14 09:09:00,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:00,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:09:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:09:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:09:00,361 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-12-14 09:09:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:00,400 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-12-14 09:09:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:09:00,400 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-12-14 09:09:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:00,401 INFO L225 Difference]: With dead ends: 55 [2022-12-14 09:09:00,402 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 09:09:00,402 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-12-14 09:09:00,403 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:00,404 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.0s Time] [2022-12-14 09:09:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 09:09:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-14 09:09:00,410 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-12-14 09:09:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-14 09:09:00,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2022-12-14 09:09:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:00,412 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-14 09:09:00,412 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-12-14 09:09:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-14 09:09:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 09:09:00,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:00,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:09:00,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:09:00,413 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-12-14 09:09:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 450833552, now seen corresponding path program 1 times [2022-12-14 09:09:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257439264] [2022-12-14 09:09:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:00,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:00,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257439264] [2022-12-14 09:09:00,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257439264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:00,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:00,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:09:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722622374] [2022-12-14 09:09:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:00,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:09:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:00,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:09:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:09:00,507 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-12-14 09:09:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:00,564 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-12-14 09:09:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:09:00,565 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-12-14 09:09:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:00,565 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:09:00,565 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 09:09:00,566 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-12-14 09:09:00,567 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:00,567 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.0s Time] [2022-12-14 09:09:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 09:09:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-12-14 09:09:00,572 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-12-14 09:09:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-12-14 09:09:00,573 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2022-12-14 09:09:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:00,574 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-12-14 09:09:00,574 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-12-14 09:09:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-12-14 09:09:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 09:09:00,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:00,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:09:00,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:09:00,575 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-12-14 09:09:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1090938302, now seen corresponding path program 1 times [2022-12-14 09:09:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:00,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000433988] [2022-12-14 09:09:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:00,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000433988] [2022-12-14 09:09:00,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000433988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:00,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:00,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:09:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135163537] [2022-12-14 09:09:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:00,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:09:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:09:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:09:00,665 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-12-14 09:09:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:00,730 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-12-14 09:09:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:09:00,730 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-12-14 09:09:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:00,731 INFO L225 Difference]: With dead ends: 76 [2022-12-14 09:09:00,731 INFO L226 Difference]: Without dead ends: 74 [2022-12-14 09:09:00,731 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-12-14 09:09:00,732 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 09:09:00,732 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-12-14 09:09:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-14 09:09:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2022-12-14 09:09:00,737 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-12-14 09:09:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-12-14 09:09:00,737 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 20 [2022-12-14 09:09:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:00,737 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-12-14 09:09:00,738 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-12-14 09:09:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-12-14 09:09:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 09:09:00,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:00,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:09:00,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:09:00,738 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-12-14 09:09:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1668340695, now seen corresponding path program 1 times [2022-12-14 09:09:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:00,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824022842] [2022-12-14 09:09:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 09:09:00,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:00,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824022842] [2022-12-14 09:09:00,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824022842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:09:00,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330693201] [2022-12-14 09:09:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:09:00,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:09:00,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:09:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:00,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:09:00,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:09:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:09:01,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:09:01,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330693201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:01,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:09:01,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 09:09:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111796836] [2022-12-14 09:09:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:01,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:09:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:09:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:09:01,006 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-12-14 09:09:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:01,050 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-12-14 09:09:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:09:01,050 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-12-14 09:09:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:01,051 INFO L225 Difference]: With dead ends: 96 [2022-12-14 09:09:01,051 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 09:09:01,051 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-12-14 09:09:01,052 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-12-14 09:09:01,053 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-12-14 09:09:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 09:09:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-14 09:09:01,058 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-12-14 09:09:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-12-14 09:09:01,059 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2022-12-14 09:09:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:01,059 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-12-14 09:09:01,059 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-12-14 09:09:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-12-14 09:09:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:09:01,060 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:01,060 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-12-14 09:09:01,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:09:01,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 09:09:01,262 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-12-14 09:09:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash 419694547, now seen corresponding path program 1 times [2022-12-14 09:09:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723355434] [2022-12-14 09:09:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:01,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:01,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723355434] [2022-12-14 09:09:01,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723355434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:01,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:01,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:09:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567814128] [2022-12-14 09:09:01,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:01,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:09:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:01,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:09:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:09:01,436 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-12-14 09:09:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:01,484 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-12-14 09:09:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:09:01,484 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-12-14 09:09:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:01,485 INFO L225 Difference]: With dead ends: 49 [2022-12-14 09:09:01,485 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 09:09:01,485 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-12-14 09:09:01,486 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:01,487 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.0s Time] [2022-12-14 09:09:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 09:09:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-14 09:09:01,493 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-12-14 09:09:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-14 09:09:01,493 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2022-12-14 09:09:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:01,494 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-14 09:09:01,494 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-12-14 09:09:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-14 09:09:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:09:01,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:01,495 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-12-14 09:09:01,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 09:09:01,495 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-12-14 09:09:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 419690784, now seen corresponding path program 1 times [2022-12-14 09:09:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:01,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081333249] [2022-12-14 09:09:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:01,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:01,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081333249] [2022-12-14 09:09:01,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081333249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:01,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:01,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:09:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896923151] [2022-12-14 09:09:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:01,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:09:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:09:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:09:01,547 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-12-14 09:09:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:01,576 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-12-14 09:09:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:09:01,576 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-12-14 09:09:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:01,577 INFO L225 Difference]: With dead ends: 48 [2022-12-14 09:09:01,577 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 09:09:01,577 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-12-14 09:09:01,578 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-12-14 09:09:01,578 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-12-14 09:09:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 09:09:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-14 09:09:01,584 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-12-14 09:09:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-12-14 09:09:01,585 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 22 [2022-12-14 09:09:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:01,585 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-12-14 09:09:01,585 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-12-14 09:09:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-12-14 09:09:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:09:01,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:01,586 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-12-14 09:09:01,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 09:09:01,587 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-12-14 09:09:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash 125629172, now seen corresponding path program 1 times [2022-12-14 09:09:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:01,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28043214] [2022-12-14 09:09:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:01,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:01,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28043214] [2022-12-14 09:09:01,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28043214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:01,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:01,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:09:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303531980] [2022-12-14 09:09:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:01,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:09:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:09:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:09:01,675 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-12-14 09:09:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:01,737 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-14 09:09:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:09:01,737 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-12-14 09:09:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:01,738 INFO L225 Difference]: With dead ends: 57 [2022-12-14 09:09:01,738 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 09:09:01,738 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-12-14 09:09:01,739 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 85 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:01,739 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.0s Time] [2022-12-14 09:09:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 09:09:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2022-12-14 09:09:01,744 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-12-14 09:09:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-12-14 09:09:01,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2022-12-14 09:09:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:01,745 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-14 09:09:01,745 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-12-14 09:09:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-12-14 09:09:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:09:01,746 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:01,746 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-12-14 09:09:01,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 09:09:01,746 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-12-14 09:09:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 125512507, now seen corresponding path program 1 times [2022-12-14 09:09:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:01,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796265593] [2022-12-14 09:09:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:01,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:01,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:01,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796265593] [2022-12-14 09:09:01,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796265593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:01,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:01,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:09:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581260293] [2022-12-14 09:09:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:01,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:09:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:09:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:09:01,850 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-12-14 09:09:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:01,940 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-12-14 09:09:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:09:01,941 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-12-14 09:09:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:01,941 INFO L225 Difference]: With dead ends: 61 [2022-12-14 09:09:01,941 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 09:09:01,941 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-12-14 09:09:01,942 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-12-14 09:09:01,942 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-12-14 09:09:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 09:09:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-12-14 09:09:01,945 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-12-14 09:09:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-14 09:09:01,946 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 23 [2022-12-14 09:09:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:01,946 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-14 09:09:01,946 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-12-14 09:09:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-14 09:09:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 09:09:01,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:01,947 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-12-14 09:09:01,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 09:09:01,948 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-12-14 09:09:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 210389729, now seen corresponding path program 1 times [2022-12-14 09:09:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:01,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147443016] [2022-12-14 09:09:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:09:02,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:02,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147443016] [2022-12-14 09:09:02,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147443016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:02,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:02,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:09:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512620120] [2022-12-14 09:09:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:02,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:09:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:09:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:09:02,021 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-12-14 09:09:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:02,091 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-12-14 09:09:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:09:02,091 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-12-14 09:09:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:02,092 INFO L225 Difference]: With dead ends: 89 [2022-12-14 09:09:02,092 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 09:09:02,092 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-12-14 09:09:02,093 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 09:09:02,093 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-12-14 09:09:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 09:09:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-12-14 09:09:02,098 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-12-14 09:09:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-12-14 09:09:02,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2022-12-14 09:09:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:02,099 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-12-14 09:09:02,099 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-12-14 09:09:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-12-14 09:09:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 09:09:02,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:02,100 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-12-14 09:09:02,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 09:09:02,100 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-12-14 09:09:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash 343892484, now seen corresponding path program 1 times [2022-12-14 09:09:02,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:02,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729625980] [2022-12-14 09:09:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:09:02,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729625980] [2022-12-14 09:09:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729625980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:09:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112065036] [2022-12-14 09:09:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:02,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:02,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:09:02,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:09:02,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:09:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:02,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:09:02,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:09:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:09:02,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:09:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:09:02,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112065036] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:09:02,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [171538642] [2022-12-14 09:09:02,503 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 09:09:02,504 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:09:02,506 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:09:02,511 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:09:02,511 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:09:02,578 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-12-14 09:09:02,584 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-12-14 09:09:02,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:02,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:02,607 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-12-14 09:09:02,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:02,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:02,617 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-12-14 09:09:02,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:02,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:02,627 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-12-14 09:09:02,926 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-12-14 09:09:02,934 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-12-14 09:09:02,942 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-12-14 09:09:02,950 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-12-14 09:09:02,959 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-12-14 09:09:02,970 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:02,972 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:02,973 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:02,974 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:03,158 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-12-14 09:09:03,166 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-12-14 09:09:03,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,176 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-12-14 09:09:03,186 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-12-14 09:09:03,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,195 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-12-14 09:09:03,205 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:03,207 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:03,208 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:03,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:03,259 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:09:03,259 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-12-14 09:09:03,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:03,283 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:09:03,283 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-12-14 09:09:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,304 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-12-14 09:09:03,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,405 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-12-14 09:09:03,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:03,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,413 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-12-14 09:09:03,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,421 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-12-14 09:09:03,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:03,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:03,665 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-12-14 09:09:03,666 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-12-14 09:09:03,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:03,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:03,749 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-12-14 09:09:03,749 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-12-14 09:09:05,386 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:09:05,387 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-12-14 09:09:05,428 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:09:05,429 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-12-14 09:09:05,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:05,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:05,822 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:09:05,823 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-12-14 09:09:05,854 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:09:05,855 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-12-14 09:09:06,263 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-12-14 09:09:06,271 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-12-14 09:09:06,279 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-12-14 09:09:06,288 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-12-14 09:09:06,296 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-12-14 09:09:06,306 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,307 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,309 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,310 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,485 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-12-14 09:09:06,493 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-12-14 09:09:06,501 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-12-14 09:09:06,509 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-12-14 09:09:06,516 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-12-14 09:09:06,525 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,527 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,529 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:06,550 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 09:09:06,665 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:09:10,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [171538642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:10,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:09:10,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [7, 7, 7] total 26 [2022-12-14 09:09:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523512568] [2022-12-14 09:09:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:10,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 09:09:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:10,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 09:09:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-12-14 09:09:10,246 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-12-14 09:09:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:11,466 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-12-14 09:09:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 09:09:11,467 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-12-14 09:09:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:11,467 INFO L225 Difference]: With dead ends: 59 [2022-12-14 09:09:11,467 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 09:09:11,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2022-12-14 09:09:11,468 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:11,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 112 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 09:09:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 09:09:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-12-14 09:09:11,476 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-12-14 09:09:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-12-14 09:09:11,477 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2022-12-14 09:09:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:11,477 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-12-14 09:09:11,477 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-12-14 09:09:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-12-14 09:09:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 09:09:11,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:11,478 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-12-14 09:09:11,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:09:11,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:11,680 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-12-14 09:09:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1715193239, now seen corresponding path program 1 times [2022-12-14 09:09:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:11,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629496932] [2022-12-14 09:09:11,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:09:11,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:11,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629496932] [2022-12-14 09:09:11,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629496932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:11,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:11,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:09:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354895359] [2022-12-14 09:09:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:11,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:09:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:11,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:09:11,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:09:11,765 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-12-14 09:09:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:11,800 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-12-14 09:09:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:09:11,800 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-12-14 09:09:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:11,801 INFO L225 Difference]: With dead ends: 45 [2022-12-14 09:09:11,801 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 09:09:11,801 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-12-14 09:09:11,802 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-12-14 09:09:11,802 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-12-14 09:09:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 09:09:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 09:09:11,810 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-12-14 09:09:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-12-14 09:09:11,810 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-12-14 09:09:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:11,811 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-12-14 09:09:11,811 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-12-14 09:09:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-12-14 09:09:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 09:09:11,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:11,812 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-12-14 09:09:11,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 09:09:11,812 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-12-14 09:09:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1631382992, now seen corresponding path program 1 times [2022-12-14 09:09:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:11,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68784132] [2022-12-14 09:09:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:09:11,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:11,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68784132] [2022-12-14 09:09:11,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68784132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:09:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610564472] [2022-12-14 09:09:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:11,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:09:11,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:09:11,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:09:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:12,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:09:12,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:09:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:09:12,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:09:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:09:12,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610564472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:09:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378270152] [2022-12-14 09:09:12,101 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 09:09:12,101 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:09:12,101 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:09:12,102 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:09:12,102 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:09:12,133 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-12-14 09:09:12,136 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-12-14 09:09:12,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,145 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-12-14 09:09:12,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,157 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-12-14 09:09:12,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,164 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-12-14 09:09:12,343 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-12-14 09:09:12,351 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-12-14 09:09:12,357 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-12-14 09:09:12,363 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-12-14 09:09:12,368 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-12-14 09:09:12,378 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,379 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,381 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,547 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-12-14 09:09:12,553 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-12-14 09:09:12,559 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-12-14 09:09:12,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,567 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-12-14 09:09:12,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,576 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-12-14 09:09:12,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,586 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,587 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:12,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,626 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:09:12,626 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-12-14 09:09:12,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,643 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:09:12,643 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-12-14 09:09:12,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,658 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-12-14 09:09:12,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,704 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-12-14 09:09:12,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,710 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-12-14 09:09:12,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:12,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,718 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-12-14 09:09:12,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:12,887 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-12-14 09:09:12,887 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-12-14 09:09:12,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:12,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:12,952 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-12-14 09:09:12,952 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-12-14 09:09:14,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:20,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:20,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 09:09:20,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:20,430 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:09:20,430 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-12-14 09:09:20,449 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:09:20,449 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-12-14 09:09:20,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:21,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:21,047 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-12-14 09:09:21,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:21,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 17 treesize of output 7 [2022-12-14 09:09:21,059 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-12-14 09:09:21,065 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-12-14 09:09:21,072 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-12-14 09:09:21,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,081 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,082 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,187 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-12-14 09:09:21,193 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-12-14 09:09:21,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 15 treesize of output 7 [2022-12-14 09:09:21,207 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-12-14 09:09:21,213 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-12-14 09:09:21,221 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,222 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,223 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:21,239 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 09:09:21,324 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:09:25,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [378270152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:25,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:09:25,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 30 [2022-12-14 09:09:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472240653] [2022-12-14 09:09:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:25,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 09:09:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 09:09:25,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-12-14 09:09:25,552 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-12-14 09:09:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:27,750 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-12-14 09:09:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 09:09:27,751 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-12-14 09:09:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:27,751 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:09:27,751 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 09:09:27,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 71 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 09:09:27,752 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:27,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 09:09:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 09:09:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2022-12-14 09:09:27,759 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-12-14 09:09:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-12-14 09:09:27,759 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 35 [2022-12-14 09:09:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:27,759 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-12-14 09:09:27,759 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-12-14 09:09:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-12-14 09:09:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 09:09:27,760 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:27,760 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-12-14 09:09:27,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:09:27,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 09:09:27,961 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-12-14 09:09:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1319076715, now seen corresponding path program 1 times [2022-12-14 09:09:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:27,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051347529] [2022-12-14 09:09:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:09:28,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:28,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051347529] [2022-12-14 09:09:28,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051347529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:09:28,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421476816] [2022-12-14 09:09:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:28,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:28,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:09:28,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:09:28,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:09:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:28,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:09:28,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:09:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:09:28,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:09:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:09:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421476816] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:09:28,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1865846659] [2022-12-14 09:09:28,287 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 09:09:28,287 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:09:28,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:09:28,287 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:09:28,287 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:09:28,308 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-12-14 09:09:28,311 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-12-14 09:09:28,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,319 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-12-14 09:09:28,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,331 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-12-14 09:09:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,338 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-12-14 09:09:28,408 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-12-14 09:09:28,414 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-12-14 09:09:28,419 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-12-14 09:09:28,424 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-12-14 09:09:28,430 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-12-14 09:09:28,453 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-12-14 09:09:28,458 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-12-14 09:09:28,465 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-12-14 09:09:28,471 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-12-14 09:09:28,479 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-12-14 09:09:28,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,551 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-12-14 09:09:28,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,586 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 09:09:28,586 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-12-14 09:09:28,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,620 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 09:09:28,621 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-12-14 09:09:28,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,646 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-12-14 09:09:28,666 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 09:09:28,666 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-12-14 09:09:28,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,676 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-12-14 09:09:28,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:28,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,808 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-12-14 09:09:28,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,821 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-12-14 09:09:28,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:28,829 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-12-14 09:09:29,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:29,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:29,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:29,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:29,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:29,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:29,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:29,442 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:09:29,442 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-12-14 09:09:29,464 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:09:29,465 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-12-14 09:09:29,801 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-12-14 09:09:29,808 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-12-14 09:09:29,816 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-12-14 09:09:29,823 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-12-14 09:09:29,831 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-12-14 09:09:29,859 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-12-14 09:09:29,866 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-12-14 09:09:29,873 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-12-14 09:09:29,881 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-12-14 09:09:29,891 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-12-14 09:09:29,905 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 09:09:30,006 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:09:34,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1865846659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:34,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:09:34,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 30 [2022-12-14 09:09:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81501598] [2022-12-14 09:09:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:34,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 09:09:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 09:09:34,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-12-14 09:09:34,398 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-12-14 09:09:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:36,449 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-12-14 09:09:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 09:09:36,449 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-12-14 09:09:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:36,450 INFO L225 Difference]: With dead ends: 61 [2022-12-14 09:09:36,450 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 09:09:36,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 09:09:36,451 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:36,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 97 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 09:09:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 09:09:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-12-14 09:09:36,460 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-12-14 09:09:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-14 09:09:36,460 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2022-12-14 09:09:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:36,460 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-14 09:09:36,460 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-12-14 09:09:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-14 09:09:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 09:09:36,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:36,461 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-12-14 09:09:36,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:09:36,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 09:09:36,663 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-12-14 09:09:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1318989125, now seen corresponding path program 1 times [2022-12-14 09:09:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:36,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115973949] [2022-12-14 09:09:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 09:09:36,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:36,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115973949] [2022-12-14 09:09:36,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115973949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:36,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:09:36,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:09:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494542656] [2022-12-14 09:09:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:36,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:09:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:09:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:09:36,758 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-12-14 09:09:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:36,809 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-12-14 09:09:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:09:36,809 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-12-14 09:09:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:36,809 INFO L225 Difference]: With dead ends: 48 [2022-12-14 09:09:36,809 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 09:09:36,810 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-12-14 09:09:36,810 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-12-14 09:09:36,810 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-12-14 09:09:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 09:09:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-14 09:09:36,818 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-12-14 09:09:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-12-14 09:09:36,818 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 38 [2022-12-14 09:09:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:36,818 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-12-14 09:09:36,818 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-12-14 09:09:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-12-14 09:09:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 09:09:36,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:36,819 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-12-14 09:09:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 09:09:36,819 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-12-14 09:09:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2061010237, now seen corresponding path program 1 times [2022-12-14 09:09:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:36,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023903781] [2022-12-14 09:09:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:09:36,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:36,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023903781] [2022-12-14 09:09:36,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023903781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:09:36,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204904856] [2022-12-14 09:09:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:36,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:36,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:09:36,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:09:36,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:09:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:37,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:09:37,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:09:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:09:37,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:09:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:09:37,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204904856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:09:37,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [818780860] [2022-12-14 09:09:37,120 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 09:09:37,120 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:09:37,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:09:37,120 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:09:37,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:09:37,160 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-12-14 09:09:37,163 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-12-14 09:09:37,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,171 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-12-14 09:09:37,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,178 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-12-14 09:09:37,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,190 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-12-14 09:09:37,353 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-12-14 09:09:37,359 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-12-14 09:09:37,365 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-12-14 09:09:37,373 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-12-14 09:09:37,379 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-12-14 09:09:37,388 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,389 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,391 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,502 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-12-14 09:09:37,508 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-12-14 09:09:37,515 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-12-14 09:09:37,521 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-12-14 09:09:37,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,528 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-12-14 09:09:37,535 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,536 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,538 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:37,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,568 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:09:37,568 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-12-14 09:09:37,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,584 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:09:37,584 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-12-14 09:09:37,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,598 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-12-14 09:09:37,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,648 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-12-14 09:09:37,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,658 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-12-14 09:09:37,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,665 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-12-14 09:09:37,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:37,822 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-12-14 09:09:37,823 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-12-14 09:09:37,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:37,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:37,878 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-12-14 09:09:37,879 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-12-14 09:09:38,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:41,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:41,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 09:09:41,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:09:41,431 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:09:41,431 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-12-14 09:09:41,450 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:09:41,451 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-12-14 09:09:41,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:09:42,191 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-12-14 09:09:42,198 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-12-14 09:09:42,203 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-12-14 09:09:42,209 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-12-14 09:09:42,216 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-12-14 09:09:42,225 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:42,226 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:42,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:42,403 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-12-14 09:09:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:42,412 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-12-14 09:09:42,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:42,421 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-12-14 09:09:42,428 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-12-14 09:09:42,435 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-12-14 09:09:42,444 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:42,446 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:42,447 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:42,475 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 09:09:42,629 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:09:47,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [818780860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:09:47,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:09:47,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 32 [2022-12-14 09:09:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037429245] [2022-12-14 09:09:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:09:47,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 09:09:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:09:47,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 09:09:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-12-14 09:09:47,845 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-12-14 09:09:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:09:50,321 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-12-14 09:09:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:09:50,321 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-12-14 09:09:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:09:50,322 INFO L225 Difference]: With dead ends: 63 [2022-12-14 09:09:50,322 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 09:09:50,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 09:09:50,324 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:09:50,324 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.1s Time] [2022-12-14 09:09:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 09:09:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-12-14 09:09:50,342 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-12-14 09:09:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-12-14 09:09:50,342 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 39 [2022-12-14 09:09:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:09:50,342 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-12-14 09:09:50,343 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-12-14 09:09:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-12-14 09:09:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 09:09:50,343 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:09:50,343 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-12-14 09:09:50,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:09:50,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 09:09:50,545 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-12-14 09:09:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:09:50,546 INFO L85 PathProgramCache]: Analyzing trace with hash 11350762, now seen corresponding path program 1 times [2022-12-14 09:09:50,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:09:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132888094] [2022-12-14 09:09:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:09:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:09:50,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:09:50,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132888094] [2022-12-14 09:09:50,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132888094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:09:50,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897418583] [2022-12-14 09:09:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:09:50,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:09:50,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:09:50,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:09:50,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:09:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:09:50,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:09:50,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:09:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:09:50,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:09:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:09:50,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897418583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:09:50,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1529696871] [2022-12-14 09:09:50,861 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 09:09:50,861 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:09:50,861 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:09:50,862 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:09:50,862 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:09:50,888 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-12-14 09:09:50,891 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-12-14 09:09:50,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:50,903 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-12-14 09:09:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:50,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:50,910 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-12-14 09:09:50,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:50,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:50,916 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-12-14 09:09:51,077 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-12-14 09:09:51,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,084 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-12-14 09:09:51,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,093 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-12-14 09:09:51,100 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-12-14 09:09:51,106 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-12-14 09:09:51,113 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:51,114 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:51,115 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:51,259 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-12-14 09:09:51,265 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-12-14 09:09:51,271 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-12-14 09:09:51,276 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-12-14 09:09:51,282 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-12-14 09:09:51,290 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:51,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:51,293 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:09:51,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,346 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-12-14 09:09:51,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,374 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 09:09:51,375 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-12-14 09:09:51,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,404 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 09:09:51,404 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-12-14 09:09:51,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,430 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-12-14 09:09:51,458 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-14 09:09:51,458 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-12-14 09:09:51,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,467 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-12-14 09:09:51,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,633 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-12-14 09:09:51,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,640 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-12-14 09:09:51,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,650 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-12-14 09:09:51,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,855 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-12-14 09:09:51,856 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-12-14 09:09:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:09:51,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:09:51,930 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-12-14 09:09:51,931 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-12-14 09:09:54,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-12-14 09:10:05,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:10:05,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:10:05,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:10:05,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-12-14 09:10:05,750 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:10:05,750 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-12-14 09:10:05,776 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:10:05,777 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-12-14 09:10:07,031 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-12-14 09:10:07,036 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-12-14 09:10:07,041 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-12-14 09:10:07,047 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-12-14 09:10:07,051 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-12-14 09:10:07,056 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,057 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,058 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,059 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:07,189 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-12-14 09:10:07,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:07,199 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-12-14 09:10:07,207 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-12-14 09:10:07,215 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-12-14 09:10:07,223 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-12-14 09:10:07,233 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,234 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:10:07,254 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 09:10:07,352 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1529696871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:13,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:13,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [6, 6, 6] total 35 [2022-12-14 09:10:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753888779] [2022-12-14 09:10:13,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:13,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 09:10:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 09:10:13,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 09:10:13,614 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-12-14 09:10:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:19,756 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-12-14 09:10:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 09:10:19,757 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-12-14 09:10:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:19,757 INFO L225 Difference]: With dead ends: 56 [2022-12-14 09:10:19,757 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 09:10:19,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 09:10:19,759 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:19,759 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.2s Time] [2022-12-14 09:10:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 09:10:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 09:10:19,760 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-12-14 09:10:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 09:10:19,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-12-14 09:10:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:19,760 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 09:10:19,760 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-12-14 09:10:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 09:10:19,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-12-14 09:10:19,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-12-14 09:10:19,764 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-12-14 09:10:19,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-12-14 09:10:19,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-12-14 09:10:19,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 09:10:19,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 09:10:19,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 09:10:23,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-12-14 09:10:23,351 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-12-14 09:10:23,351 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-12-14 09:10:23,351 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2022-12-14 09:10:23,351 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-12-14 09:10:23,351 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 626 645) the Hoare annotation is: true [2022-12-14 09:10:23,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L631(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L631-5(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L631-6(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,352 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-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L631-8(lines 631 634) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2022-12-14 09:10:23,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point L635-5(line 635) no Hoare annotation was computed. [2022-12-14 09:10:23,353 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-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-12-14 09:10:23,353 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-12-14 09:10:23,353 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2022-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-12-14 09:10:23,354 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-12-14 09:10:23,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-12-14 09:10:23,354 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-12-14 09:10:23,354 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-12-14 09:10:23,355 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-12-14 09:10:23,355 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-12-14 09:10:23,355 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-12-14 09:10:23,355 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-12-14 09:10:23,355 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-12-14 09:10:23,355 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-12-14 09:10:23,356 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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-12-14 09:10:23,356 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-12-14 09:10:23,358 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-12-14 09:10:23,359 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:10:23,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:10:23 BoogieIcfgContainer [2022-12-14 09:10:23,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:10:23,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:10:23,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:10:23,390 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:10:23,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:08:59" (3/4) ... [2022-12-14 09:10:23,393 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 09:10:23,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-12-14 09:10:23,400 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-12-14 09:10:23,400 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-12-14 09:10:23,400 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 09:10:23,400 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 09:10:23,417 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-12-14 09:10:23,417 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-12-14 09:10:23,418 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-12-14 09:10:23,418 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-12-14 09:10:23,418 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-12-14 09:10:23,418 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-12-14 09:10:23,427 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:10:23,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:10:23,427 INFO L158 Benchmark]: Toolchain (without parser) took 84702.58ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 156.0MB in the beginning and 361.1MB in the end (delta: -205.2MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,427 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:10:23,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.58ms. Allocated memory is still 184.5MB. Free memory was 155.7MB in the beginning and 138.2MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.10ms. Allocated memory is still 184.5MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,428 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 184.5MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,428 INFO L158 Benchmark]: RCFGBuilder took 446.85ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 111.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,428 INFO L158 Benchmark]: TraceAbstraction took 83860.09ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 110.9MB in the beginning and 365.3MB in the end (delta: -254.4MB). Peak memory consumption was 250.8MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,428 INFO L158 Benchmark]: Witness Printer took 36.90ms. Allocated memory is still 465.6MB. Free memory was 365.3MB in the beginning and 361.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:10:23,428 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.17ms. Allocated memory is still 107.0MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.58ms. Allocated memory is still 184.5MB. Free memory was 155.7MB in the beginning and 138.2MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.10ms. Allocated memory is still 184.5MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 184.5MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.85ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 111.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 83860.09ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 110.9MB in the beginning and 365.3MB in the end (delta: -254.4MB). Peak memory consumption was 250.8MB. Max. memory is 16.1GB. * Witness Printer took 36.90ms. Allocated memory is still 465.6MB. Free memory was 365.3MB in the beginning and 361.1MB 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: 83.8s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 755 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 4.7s 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.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 428 SyntacticMatches, 56 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 33.3s 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.1s 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, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s 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: 37.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 178, DAG_INTERPRETER_EARLY_EXITS: 10, TOOLS_POST_APPLICATIONS: 388, TOOLS_POST_TIME: 31.6s, TOOLS_POST_CALL_APPLICATIONS: 40, TOOLS_POST_CALL_TIME: 2.1s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 1.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 453, TOOLS_QUANTIFIERELIM_TIME: 35.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 6.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 718, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 80, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.4s, 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: 24.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 24.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 46, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.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-12-14 09:10:23,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,438 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: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant [2022-12-14 09:10:23,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,442 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: 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-12-14 09:10:23,444 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,444 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,445 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,445 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,446 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-12-14 09:10:23,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,448 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,449 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-12-14 09:10:23,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:10:23,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:10:23,452 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-12-14 09:10:23,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e279704-2e7e-4798-8193-0344f24af723/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE