./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW --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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- 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-4e7fbc6 [2022-11-23 14:46:08,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:46:08,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:46:08,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:46:08,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:46:08,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:46:08,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:46:08,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:46:08,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:46:08,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:46:08,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:46:08,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:46:08,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:46:08,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:46:08,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:46:08,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:46:08,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:46:08,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:46:08,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:46:08,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:46:08,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:46:08,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:46:08,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:46:08,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:46:08,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:46:08,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:46:08,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:46:08,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:46:08,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:46:08,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:46:08,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:46:08,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:46:08,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:46:08,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:46:08,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:46:08,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:46:08,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:46:08,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:46:08,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:46:08,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:46:08,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:46:08,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-23 14:46:08,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:46:08,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:46:08,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:46:08,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:46:08,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:46:08,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:46:08,902 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:46:08,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:46:08,903 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:46:08,910 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:46:08,911 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:46:08,911 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:46:08,911 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:46:08,911 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:46:08,912 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:46:08,912 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:46:08,912 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:46:08,912 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:46:08,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:46:08,913 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:46:08,913 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:46:08,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:46:08,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:46:08,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:46:08,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:46:08,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:46:08,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:46:08,915 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 14:46:08,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:46:08,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:46:08,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:46:08,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:46:08,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:46:08,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:46:08,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:46:08,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:46:08,917 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:46:08,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:46:08,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:46:08,918 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:46:08,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:46:08,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:46:08,919 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:46:08,919 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_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/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_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-23 14:46:09,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:46:09,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:46:09,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:46:09,286 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:46:09,286 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:46:09,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-23 14:46:12,468 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:46:12,708 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:46:12,709 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-23 14:46:12,721 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/data/522148e07/44e30e8bfbda45198cdf700f4ca6f87e/FLAG8b49127f2 [2022-11-23 14:46:12,738 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/data/522148e07/44e30e8bfbda45198cdf700f4ca6f87e [2022-11-23 14:46:12,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:46:12,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:46:12,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:46:12,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:46:12,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:46:12,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:12" (1/1) ... [2022-11-23 14:46:12,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd35adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:12, skipping insertion in model container [2022-11-23 14:46:12,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:12" (1/1) ... [2022-11-23 14:46:12,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:46:12,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:46:13,180 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_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-23 14:46:13,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:46:13,200 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:46:13,277 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_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-23 14:46:13,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:46:13,314 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:46:13,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13 WrapperNode [2022-11-23 14:46:13,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:46:13,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:46:13,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:46:13,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:46:13,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,409 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-11-23 14:46:13,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:46:13,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:46:13,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:46:13,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:46:13,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,467 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:46:13,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:46:13,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:46:13,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:46:13,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (1/1) ... [2022-11-23 14:46:13,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:46:13,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:13,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:46:13,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:46:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:46:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:46:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 14:46:13,552 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 14:46:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:46:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:46:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:46:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:46:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:46:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:46:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:46:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:46:13,692 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:46:13,694 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:46:14,015 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:46:14,132 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:46:14,132 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-23 14:46:14,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:14 BoogieIcfgContainer [2022-11-23 14:46:14,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:46:14,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:46:14,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:46:14,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:46:14,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:46:12" (1/3) ... [2022-11-23 14:46:14,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaceff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:46:14, skipping insertion in model container [2022-11-23 14:46:14,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:13" (2/3) ... [2022-11-23 14:46:14,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaceff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:46:14, skipping insertion in model container [2022-11-23 14:46:14,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:14" (3/3) ... [2022-11-23 14:46:14,145 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-23 14:46:14,165 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:46:14,166 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 14:46:14,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:46:14,235 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;@531ccfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:46:14,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-23 14:46:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:46:14,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:14,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:14,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 760276542, now seen corresponding path program 1 times [2022-11-23 14:46:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:14,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275455347] [2022-11-23 14:46:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:46:14,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:14,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275455347] [2022-11-23 14:46:14,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275455347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:14,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:14,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:46:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234324237] [2022-11-23 14:46:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:14,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:46:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:14,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:46:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:14,706 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:46:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:14,808 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-11-23 14:46:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:46:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-23 14:46:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:14,818 INFO L225 Difference]: With dead ends: 105 [2022-11-23 14:46:14,819 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 14:46:14,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:14,826 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:14,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 14:46:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-11-23 14:46:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-23 14:46:14,874 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2022-11-23 14:46:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:14,875 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-23 14:46:14,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 14:46:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-23 14:46:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:46:14,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:14,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:14,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:46:14,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1656630667, now seen corresponding path program 1 times [2022-11-23 14:46:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:14,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013279447] [2022-11-23 14:46:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:46:15,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013279447] [2022-11-23 14:46:15,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013279447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:15,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:15,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:46:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885756334] [2022-11-23 14:46:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:15,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:46:15,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:46:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:46:15,128 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:15,204 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-11-23 14:46:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:46:15,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-11-23 14:46:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:15,207 INFO L225 Difference]: With dead ends: 57 [2022-11-23 14:46:15,208 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 14:46:15,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:46:15,210 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:15,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:46:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 14:46:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-23 14:46:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:46:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-11-23 14:46:15,221 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2022-11-23 14:46:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:15,222 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-11-23 14:46:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-11-23 14:46:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 14:46:15,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:15,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:15,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:46:15,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash -784944300, now seen corresponding path program 1 times [2022-11-23 14:46:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:15,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411581575] [2022-11-23 14:46:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:15,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411581575] [2022-11-23 14:46:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411581575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:15,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:15,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:46:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101855518] [2022-11-23 14:46:15,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:15,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:46:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:46:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:15,326 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:15,373 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-11-23 14:46:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:46:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-11-23 14:46:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:15,375 INFO L225 Difference]: With dead ends: 55 [2022-11-23 14:46:15,375 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 14:46:15,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:15,378 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:15,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:46:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 14:46:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-23 14:46:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:46:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-11-23 14:46:15,389 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2022-11-23 14:46:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:15,389 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-11-23 14:46:15,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-11-23 14:46:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 14:46:15,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:15,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:15,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:46:15,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:15,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1821344265, now seen corresponding path program 1 times [2022-11-23 14:46:15,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:15,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416373393] [2022-11-23 14:46:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:15,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:15,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416373393] [2022-11-23 14:46:15,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416373393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:15,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:15,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:46:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420268355] [2022-11-23 14:46:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:15,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:46:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:46:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:46:15,528 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:15,596 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-23 14:46:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:46:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-23 14:46:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:15,598 INFO L225 Difference]: With dead ends: 69 [2022-11-23 14:46:15,598 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 14:46:15,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:46:15,600 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:15,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 14:46:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-11-23 14:46:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:46:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-23 14:46:15,610 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2022-11-23 14:46:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:15,611 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-23 14:46:15,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-23 14:46:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:46:15,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:15,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:15,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:46:15,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1559961141, now seen corresponding path program 1 times [2022-11-23 14:46:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:15,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429627879] [2022-11-23 14:46:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 14:46:15,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:15,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429627879] [2022-11-23 14:46:15,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429627879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:15,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648905839] [2022-11-23 14:46:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:15,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:15,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:46:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:15,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:46:15,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:46:16,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:46:16,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648905839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:16,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:46:16,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 14:46:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711357412] [2022-11-23 14:46:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:16,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:46:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:46:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:46:16,107 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:46:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:16,188 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-11-23 14:46:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:46:16,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-11-23 14:46:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:16,193 INFO L225 Difference]: With dead ends: 86 [2022-11-23 14:46:16,194 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 14:46:16,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:46:16,197 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:16,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:46:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 14:46:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-23 14:46:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-23 14:46:16,216 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2022-11-23 14:46:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:16,216 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-23 14:46:16,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:46:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-23 14:46:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:46:16,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:16,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:16,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 14:46:16,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:16,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 627097438, now seen corresponding path program 1 times [2022-11-23 14:46:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:16,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927152430] [2022-11-23 14:46:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:16,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927152430] [2022-11-23 14:46:16,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927152430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:16,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:16,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:46:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555954094] [2022-11-23 14:46:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:16,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:46:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:46:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:46:16,611 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:16,703 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-11-23 14:46:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:46:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-23 14:46:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:16,708 INFO L225 Difference]: With dead ends: 70 [2022-11-23 14:46:16,708 INFO L226 Difference]: Without dead ends: 68 [2022-11-23 14:46:16,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:46:16,717 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:16,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 55 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-23 14:46:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2022-11-23 14:46:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-23 14:46:16,742 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2022-11-23 14:46:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:16,744 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-23 14:46:16,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-23 14:46:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:46:16,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:16,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] [2022-11-23 14:46:16,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:46:16,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:16,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1345219040, now seen corresponding path program 1 times [2022-11-23 14:46:16,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:16,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919421199] [2022-11-23 14:46:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:16,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919421199] [2022-11-23 14:46:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919421199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:16,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:46:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303365067] [2022-11-23 14:46:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:16,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:46:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:46:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:16,861 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:16,900 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-11-23 14:46:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:46:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-23 14:46:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:16,902 INFO L225 Difference]: With dead ends: 49 [2022-11-23 14:46:16,903 INFO L226 Difference]: Without dead ends: 48 [2022-11-23 14:46:16,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:16,904 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:46:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-23 14:46:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-23 14:46:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-23 14:46:16,918 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2022-11-23 14:46:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:16,919 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-23 14:46:16,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-23 14:46:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:46:16,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:16,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:16,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:46:16,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1345223020, now seen corresponding path program 1 times [2022-11-23 14:46:16,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:16,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373454986] [2022-11-23 14:46:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:16,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:17,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:17,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373454986] [2022-11-23 14:46:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373454986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:17,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:17,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:46:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908232010] [2022-11-23 14:46:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:46:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:46:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:46:17,095 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:17,214 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-11-23 14:46:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:46:17,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-23 14:46:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:17,216 INFO L225 Difference]: With dead ends: 101 [2022-11-23 14:46:17,216 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 14:46:17,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:46:17,219 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 91 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:17,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 72 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 14:46:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2022-11-23 14:46:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-23 14:46:17,245 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2022-11-23 14:46:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:17,247 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-23 14:46:17,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-23 14:46:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 14:46:17,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:17,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:17,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:46:17,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1247882636, now seen corresponding path program 1 times [2022-11-23 14:46:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:17,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370705843] [2022-11-23 14:46:17,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:17,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:17,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370705843] [2022-11-23 14:46:17,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370705843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:17,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:17,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:46:17,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187291307] [2022-11-23 14:46:17,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:17,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:46:17,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:46:17,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:46:17,430 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:17,566 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-11-23 14:46:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:46:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-23 14:46:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:17,568 INFO L225 Difference]: With dead ends: 67 [2022-11-23 14:46:17,568 INFO L226 Difference]: Without dead ends: 66 [2022-11-23 14:46:17,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:46:17,571 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 126 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:17,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 84 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-23 14:46:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-11-23 14:46:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-23 14:46:17,584 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2022-11-23 14:46:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:17,585 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-23 14:46:17,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-23 14:46:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:46:17,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:17,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, 1, 1] [2022-11-23 14:46:17,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:46:17,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -919331070, now seen corresponding path program 1 times [2022-11-23 14:46:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:17,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864763882] [2022-11-23 14:46:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:17,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864763882] [2022-11-23 14:46:17,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864763882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770508767] [2022-11-23 14:46:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:17,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:17,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:17,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:46:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:17,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:46:17,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:17,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:46:17,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770508767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:17,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:46:17,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-23 14:46:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937789703] [2022-11-23 14:46:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:17,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:46:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:17,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:46:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:46:18,000 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:18,113 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-11-23 14:46:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:46:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2022-11-23 14:46:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:18,115 INFO L225 Difference]: With dead ends: 66 [2022-11-23 14:46:18,115 INFO L226 Difference]: Without dead ends: 65 [2022-11-23 14:46:18,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:46:18,116 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:18,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 75 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-23 14:46:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-11-23 14:46:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-23 14:46:18,125 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2022-11-23 14:46:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:18,125 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-23 14:46:18,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-23 14:46:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:46:18,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:18,127 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] [2022-11-23 14:46:18,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:46:18,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 14:46:18,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1565507998, now seen corresponding path program 1 times [2022-11-23 14:46:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:18,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380154050] [2022-11-23 14:46:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:18,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:18,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380154050] [2022-11-23 14:46:18,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380154050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:18,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089068356] [2022-11-23 14:46:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:18,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:18,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:18,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:18,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:46:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:18,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:46:18,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:18,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:46:18,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089068356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:18,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:46:18,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-23 14:46:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962360535] [2022-11-23 14:46:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:46:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:46:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:46:18,758 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:18,853 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-23 14:46:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:46:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 26 [2022-11-23 14:46:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:18,854 INFO L225 Difference]: With dead ends: 63 [2022-11-23 14:46:18,854 INFO L226 Difference]: Without dead ends: 61 [2022-11-23 14:46:18,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:46:18,855 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 65 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:18,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-23 14:46:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-11-23 14:46:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-23 14:46:18,864 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2022-11-23 14:46:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:18,864 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-23 14:46:18,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-23 14:46:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 14:46:18,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:18,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:18,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:46:19,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:19,073 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 80689557, now seen corresponding path program 1 times [2022-11-23 14:46:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:19,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026579525] [2022-11-23 14:46:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:46:19,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:19,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026579525] [2022-11-23 14:46:19,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026579525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:19,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:19,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:46:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838081003] [2022-11-23 14:46:19,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:46:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:46:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:46:19,255 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:19,335 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-11-23 14:46:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:46:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 31 [2022-11-23 14:46:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:19,336 INFO L225 Difference]: With dead ends: 59 [2022-11-23 14:46:19,336 INFO L226 Difference]: Without dead ends: 58 [2022-11-23 14:46:19,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:46:19,337 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:19,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 89 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:46:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-23 14:46:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-11-23 14:46:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-23 14:46:19,346 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 31 [2022-11-23 14:46:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:19,347 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-23 14:46:19,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-23 14:46:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:46:19,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:19,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:19,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:46:19,349 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1793714325, now seen corresponding path program 1 times [2022-11-23 14:46:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:19,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297737456] [2022-11-23 14:46:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:19,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:19,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:19,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297737456] [2022-11-23 14:46:19,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297737456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:19,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135931182] [2022-11-23 14:46:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:19,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:19,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:19,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:46:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:46:19,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:19,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:46:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:19,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135931182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:46:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691876010] [2022-11-23 14:46:20,021 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:46:20,021 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:46:20,026 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:46:20,032 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:46:20,032 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:46:20,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:46:20,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:46:20,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:20,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:20,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:20,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:20,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:20,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-23 14:46:20,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:20,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:20,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:46:20,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:20,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:20,719 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:20,722 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:20,724 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:20,728 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:20,730 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:20,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:21,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:46:21,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:21,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:21,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:21,055 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:21,057 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:21,061 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:21,063 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:21,066 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:21,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:21,130 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:46:21,147 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:46:21,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:46:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:21,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2022-11-23 14:46:21,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:21,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-11-23 14:46:21,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:21,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-11-23 14:46:21,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:46:21,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:46:21,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 14:46:21,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:21,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:21,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:22,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:22,139 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:46:22,140 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 152 treesize of output 146 [2022-11-23 14:46:22,189 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:46:22,190 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 148 treesize of output 142 [2022-11-23 14:46:22,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:22,617 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:46:22,618 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 150 treesize of output 144 [2022-11-23 14:46:22,693 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 14:46:22,694 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 146 treesize of output 140 [2022-11-23 14:46:23,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:23,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-11-23 14:46:23,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122 [2022-11-23 14:46:23,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-11-23 14:46:23,273 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-23 14:46:23,395 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:46:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [691876010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:27,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:46:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 7, 7] total 27 [2022-11-23 14:46:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244255594] [2022-11-23 14:46:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:46:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:46:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-11-23 14:46:27,747 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:29,033 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-11-23 14:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 14:46:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-23 14:46:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:29,034 INFO L225 Difference]: With dead ends: 59 [2022-11-23 14:46:29,035 INFO L226 Difference]: Without dead ends: 58 [2022-11-23 14:46:29,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-11-23 14:46:29,036 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:29,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 113 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:46:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-23 14:46:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-11-23 14:46:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-23 14:46:29,046 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2022-11-23 14:46:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:29,047 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-23 14:46:29,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-23 14:46:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:46:29,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:29,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:29,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:46:29,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 14:46:29,254 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash -464046655, now seen corresponding path program 1 times [2022-11-23 14:46:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:29,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355521852] [2022-11-23 14:46:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:46:29,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:29,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355521852] [2022-11-23 14:46:29,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355521852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:29,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:29,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:46:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062166232] [2022-11-23 14:46:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:29,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:46:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:29,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:46:29,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:29,346 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:29,371 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-23 14:46:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:46:29,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-23 14:46:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:29,373 INFO L225 Difference]: With dead ends: 45 [2022-11-23 14:46:29,373 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 14:46:29,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:46:29,374 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:29,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:46:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 14:46:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-23 14:46:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-23 14:46:29,382 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-11-23 14:46:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:29,382 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-23 14:46:29,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-23 14:46:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:46:29,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:29,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:29,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 14:46:29,384 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:29,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1500459427, now seen corresponding path program 1 times [2022-11-23 14:46:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:29,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870691071] [2022-11-23 14:46:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:29,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:46:29,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870691071] [2022-11-23 14:46:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870691071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:29,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:46:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:46:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178493364] [2022-11-23 14:46:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:29,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:46:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:46:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:46:29,448 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:29,494 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-23 14:46:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:46:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 35 [2022-11-23 14:46:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:29,495 INFO L225 Difference]: With dead ends: 44 [2022-11-23 14:46:29,495 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 14:46:29,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:46:29,496 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:29,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:46:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 14:46:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-23 14:46:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-23 14:46:29,506 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2022-11-23 14:46:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:29,507 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-23 14:46:29,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 14:46:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-23 14:46:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 14:46:29,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:29,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:29,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 14:46:29,509 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1500544289, now seen corresponding path program 1 times [2022-11-23 14:46:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866594242] [2022-11-23 14:46:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:46:29,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866594242] [2022-11-23 14:46:29,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866594242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871603334] [2022-11-23 14:46:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:29,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:29,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:29,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:46:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:29,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:46:29,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:29,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:46:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:29,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871603334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:46:29,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1997939859] [2022-11-23 14:46:29,894 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-23 14:46:29,894 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:46:29,895 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:46:29,895 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:46:29,895 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:46:29,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:46:29,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:46:29,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:29,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:29,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:29,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-23 14:46:29,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:29,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:30,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:30,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:30,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:30,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 14:46:30,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:30,333 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,334 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,339 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:30,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:30,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:30,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:30,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:30,593 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,595 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,597 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,600 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,601 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:46:30,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:30,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:30,672 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 189 treesize of output 173 [2022-11-23 14:46:30,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:30,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-23 14:46:30,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:30,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-23 14:46:30,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:30,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 121 [2022-11-23 14:46:30,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:30,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2022-11-23 14:46:30,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:30,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2022-11-23 14:46:30,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:46:30,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:46:31,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 14:46:31,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:31,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:31,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:31,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:31,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:31,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:31,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:31,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:31,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:32,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:32,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 121 [2022-11-23 14:46:32,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:32,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2022-11-23 14:46:32,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:32,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2022-11-23 14:46:32,450 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-23 14:46:32,543 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:46:37,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1997939859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:37,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:46:37,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 29 [2022-11-23 14:46:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236366739] [2022-11-23 14:46:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 14:46:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:37,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 14:46:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:46:37,196 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 24 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:40,467 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-11-23 14:46:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:46:40,475 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-23 14:46:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:40,476 INFO L225 Difference]: With dead ends: 69 [2022-11-23 14:46:40,476 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 14:46:40,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 14:46:40,479 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:40,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 73 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:46:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 14:46:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2022-11-23 14:46:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-11-23 14:46:40,491 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 35 [2022-11-23 14:46:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:40,491 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-11-23 14:46:40,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-11-23 14:46:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 14:46:40,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:40,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:40,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:46:40,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 14:46:40,703 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -695173633, now seen corresponding path program 1 times [2022-11-23 14:46:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:40,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968928204] [2022-11-23 14:46:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:46:40,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:40,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968928204] [2022-11-23 14:46:40,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968928204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:40,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716083971] [2022-11-23 14:46:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:40,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:40,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:40,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:46:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:40,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:46:40,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:46:41,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:46:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 14:46:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716083971] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:46:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200025960] [2022-11-23 14:46:41,101 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-23 14:46:41,102 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:46:41,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:46:41,102 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:46:41,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:46:41,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:46:41,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:46:41,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:41,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-23 14:46:41,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:41,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:41,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:41,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:41,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,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-11-23 14:46:41,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:46:41,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:41,404 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:46:41,413 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:46:41,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:41,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:41,655 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:46:41,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:46:41,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:41,678 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:46:41,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:46:41,775 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:46:41,775 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:46:41,805 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:46:41,805 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:46:42,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:42,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:42,141 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 14:46:42,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 325 [2022-11-23 14:46:42,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:42,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:42,228 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 14:46:42,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 325 [2022-11-23 14:46:42,265 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 14:46:42,266 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 341 treesize of output 340 [2022-11-23 14:46:43,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:43,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:43,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:46:43,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:43,382 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:46:43,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:46:43,415 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:46:43,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:46:44,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:44,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:44,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:44,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:44,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:44,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:44,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:44,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:44,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:44,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:44,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:44,713 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 189 treesize of output 173 [2022-11-23 14:46:44,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:44,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-23 14:46:44,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:44,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-23 14:46:44,796 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-23 14:46:44,920 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:46:52,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1200025960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:46:52,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:46:52,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 29 [2022-11-23 14:46:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473119454] [2022-11-23 14:46:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:46:52,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 14:46:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 14:46:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-11-23 14:46:52,639 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 24 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:58,682 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2022-11-23 14:46:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 14:46:58,682 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-23 14:46:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:58,683 INFO L225 Difference]: With dead ends: 84 [2022-11-23 14:46:58,683 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 14:46:58,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 14:46:58,685 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:58,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 14:46:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 14:46:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-11-23 14:46:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-23 14:46:58,705 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2022-11-23 14:46:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:58,706 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-23 14:46:58,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:46:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-23 14:46:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 14:46:58,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:58,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:46:58,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:46:58,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:58,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:46:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -72915276, now seen corresponding path program 1 times [2022-11-23 14:46:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:58,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539606288] [2022-11-23 14:46:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 14:46:59,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:59,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539606288] [2022-11-23 14:46:59,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539606288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:59,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223953599] [2022-11-23 14:46:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:59,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:59,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:59,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:59,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:46:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:59,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:46:59,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:46:59,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:46:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:46:59,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223953599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:46:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1228803811] [2022-11-23 14:46:59,319 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-23 14:46:59,319 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:46:59,319 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:46:59,320 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:46:59,320 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:46:59,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:46:59,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:46:59,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:59,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:59,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:59,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:46:59,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:59,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-23 14:46:59,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:59,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:59,642 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 189 treesize of output 173 [2022-11-23 14:46:59,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:59,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-23 14:46:59,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:59,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 98 [2022-11-23 14:46:59,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:46:59,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:59,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:59,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:59,909 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 189 treesize of output 173 [2022-11-23 14:46:59,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:59,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-23 14:46:59,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:59,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-11-23 14:46:59,999 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:46:59,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:47:00,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:00,017 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 14:47:00,050 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:47:00,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-23 14:47:00,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:00,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:00,380 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-23 14:47:00,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 442 treesize of output 408 [2022-11-23 14:47:00,447 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-23 14:47:00,447 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 436 treesize of output 433 [2022-11-23 14:47:00,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:00,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:00,512 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 14:47:00,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 430 treesize of output 408 [2022-11-23 14:47:01,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:47:01,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:47:01,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:47:02,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:47:02,122 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:47:02,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-11-23 14:47:02,155 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:47:02,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-11-23 14:47:03,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-11-23 14:47:03,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:03,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:03,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:03,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:03,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:03,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:03,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:03,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:03,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:03,344 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:47:03,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:47:03,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:03,367 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:47:03,395 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-23 14:47:03,536 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:47:12,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1228803811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:47:12,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:47:12,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [6, 6, 6] total 31 [2022-11-23 14:47:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144610301] [2022-11-23 14:47:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:47:12,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:47:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:47:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:47:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2022-11-23 14:47:12,265 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:47:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:47:18,279 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-11-23 14:47:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 14:47:18,279 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-23 14:47:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:47:18,280 INFO L225 Difference]: With dead ends: 66 [2022-11-23 14:47:18,280 INFO L226 Difference]: Without dead ends: 64 [2022-11-23 14:47:18,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=235, Invalid=1570, Unknown=1, NotChecked=0, Total=1806 [2022-11-23 14:47:18,281 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:47:18,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 122 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 14:47:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-23 14:47:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-11-23 14:47:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:47:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-11-23 14:47:18,303 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2022-11-23 14:47:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:47:18,303 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-11-23 14:47:18,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:47:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-11-23 14:47:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 14:47:18,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:47:18,305 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:47:18,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 14:47:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 14:47:18,511 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-23 14:47:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:47:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 331154561, now seen corresponding path program 1 times [2022-11-23 14:47:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:47:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357425953] [2022-11-23 14:47:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:47:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:47:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:47:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 14:47:18,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:47:18,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357425953] [2022-11-23 14:47:18,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357425953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:47:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116037955] [2022-11-23 14:47:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:47:18,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:47:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:47:18,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:47:18,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:47:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:47:18,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:47:18,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:47:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:47:18,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:47:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 14:47:18,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116037955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:47:18,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1561878373] [2022-11-23 14:47:18,925 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-23 14:47:18,925 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:47:18,926 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:47:18,926 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:47:18,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:47:18,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:47:18,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:47:18,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:18,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:47:18,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:18,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-23 14:47:18,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:18,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-23 14:47:19,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,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-11-23 14:47:19,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,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 7 treesize of output 3 [2022-11-23 14:47:19,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:19,207 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:47:19,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:47:19,237 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:47:19,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:19,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:19,450 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:47:19,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:47:19,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:19,471 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:47:19,524 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:47:19,525 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:47:19,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:47:19,563 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:47:19,564 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:47:19,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:19,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:19,817 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 14:47:19,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 325 [2022-11-23 14:47:19,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:19,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:19,879 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-23 14:47:19,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 329 [2022-11-23 14:47:19,913 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 14:47:19,914 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 341 treesize of output 340 [2022-11-23 14:47:20,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:47:20,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:47:20,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-23 14:47:20,638 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:47:20,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:47:20,667 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-11-23 14:47:20,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-11-23 14:47:20,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:47:22,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:22,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:22,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:22,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-11-23 14:47:22,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:22,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:22,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:22,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:22,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 14:47:22,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:47:22,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:22,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:47:22,348 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 189 treesize of output 173 [2022-11-23 14:47:22,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:22,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-11-23 14:47:22,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:47:22,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 98 [2022-11-23 14:47:22,410 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-23 14:47:22,530 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:47:31,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1561878373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:47:31,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:47:31,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [6, 6, 6] total 32 [2022-11-23 14:47:31,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807507148] [2022-11-23 14:47:31,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:47:31,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-23 14:47:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:47:31,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-23 14:47:31,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:47:31,678 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:47:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:47:47,259 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-11-23 14:47:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-23 14:47:47,259 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-23 14:47:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:47:47,260 INFO L225 Difference]: With dead ends: 61 [2022-11-23 14:47:47,260 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 14:47:47,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2022-11-23 14:47:47,262 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:47:47,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 14:47:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 14:47:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 14:47:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:47:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 14:47:47,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-23 14:47:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:47:47,263 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 14:47:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 14:47:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 14:47:47,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 14:47:47,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-11-23 14:47:47,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-11-23 14:47:47,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-11-23 14:47:47,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-11-23 14:47:47,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-11-23 14:47:47,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-11-23 14:47:47,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-11-23 14:47:47,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-11-23 14:47:47,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-11-23 14:47:47,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-11-23 14:47:47,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-11-23 14:47:47,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-11-23 14:47:47,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-11-23 14:47:47,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-11-23 14:47:47,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-11-23 14:47:47,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-11-23 14:47:47,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-11-23 14:47:47,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-11-23 14:47:47,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:47:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:47:47,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 14:47:55,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,707 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-11-23 14:47:55,707 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-11-23 14:47:55,707 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2022-11-23 14:47:55,707 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-23 14:47:55,707 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-11-23 14:47:55,708 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (and (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse7 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse8 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse11 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse13 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse14 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse15 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse16 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse17 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) .cse14 .cse15 .cse16 .cse17) (and .cse0 (< 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse3 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) .cse15 .cse16 .cse17))) (or (let ((.cse18 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (< .cse18 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= 0 .cse18)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) (< 0 |#StackHeapBarrier|))) (and (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0)) [2022-11-23 14:47:55,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-23 14:47:55,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 14:47:55,709 INFO L895 garLoopResultBuilder]: At program point L631(lines 631 633) the Hoare annotation is: (and (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (let ((.cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|)) (.cse8 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse9 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) .cse5 .cse6 .cse7 (< 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse8 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) .cse9) (and .cse0 .cse1 .cse2 (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse3 .cse4 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse8 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse9))) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret17#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2022-11-23 14:47:55,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,709 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-11-23 14:47:55,709 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-11-23 14:47:55,709 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2022-11-23 14:47:55,709 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-23 14:47:55,710 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse5 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse10 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3)) (.cse11 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse12 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse22 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse23 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse24 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse25 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse26 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse14 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|)) (.cse27 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|)) (.cse28 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse18 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse29 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse30 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse19 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse20 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse21 (= |#NULL.base| 0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) .cse15 .cse16 .cse17 (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse19 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) .cse21)) .cse22 (<= |ULTIMATE.start_main_~expected~0#1| 3) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse28 (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse29 (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse30 .cse31 .cse32) (and .cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse7 (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse23 .cse24 .cse25 .cse13 .cse26 .cse14 .cse27 .cse15 .cse16 .cse17 .cse28 .cse18 .cse29 .cse30 .cse19 .cse31 .cse32 .cse20 .cse21))) [2022-11-23 14:47:55,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,710 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,710 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2022-11-23 14:47:55,710 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2022-11-23 14:47:55,711 INFO L899 garLoopResultBuilder]: For program point L625(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,711 INFO L899 garLoopResultBuilder]: For program point L625-1(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,711 INFO L899 garLoopResultBuilder]: For program point L625-5(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,711 INFO L899 garLoopResultBuilder]: For program point L625-6(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,712 INFO L895 garLoopResultBuilder]: At program point L625-7(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse9 (= |#NULL.base| 0))) (or (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_sll_circular_create_~data#1|) .cse0 (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= 0 .cse3)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse4 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse9)) (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) .cse1 .cse2 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse4 .cse5 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) .cse6 (<= |ULTIMATE.start_main_~new_data~0#1| 3) .cse7 (<= 0 |#StackHeapBarrier|) .cse8 .cse9))) [2022-11-23 14:47:55,712 INFO L899 garLoopResultBuilder]: For program point L625-8(lines 625 628) no Hoare annotation was computed. [2022-11-23 14:47:55,712 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-23 14:47:55,712 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-11-23 14:47:55,713 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-23 14:47:55,713 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-23 14:47:55,713 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2022-11-23 14:47:55,713 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2022-11-23 14:47:55,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-23 14:47:55,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-11-23 14:47:55,714 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (< 0 |#StackHeapBarrier|)) (.cse8 (= |#NULL.base| 0))) (or (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse5 (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse6 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse7 .cse8) (let ((.cse9 (select |#memory_int| 1))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) .cse0 .cse1 (= (select |#valid| 1) 1) .cse2 .cse3 .cse4 (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| 0) 0) .cse5 (= (select |#valid| 2) 1) .cse6 (= (select .cse9 0) 48) (= 27 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select .cse9 1) 0) .cse7 .cse8)))) [2022-11-23 14:47:55,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 14:47:55,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-23 14:47:55,715 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-11-23 14:47:55,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-11-23 14:47:55,715 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (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 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-23 14:47:55,715 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-11-23 14:47:55,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-23 14:47:55,716 INFO L899 garLoopResultBuilder]: For program point L629(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,716 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-11-23 14:47:55,716 INFO L899 garLoopResultBuilder]: For program point L629-4(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,716 INFO L899 garLoopResultBuilder]: For program point L629-5(line 629) no Hoare annotation was computed. [2022-11-23 14:47:55,716 INFO L895 garLoopResultBuilder]: At program point L629-6(lines 629 634) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0)) [2022-11-23 14:47:55,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-23 14:47:55,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-11-23 14:47:55,717 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-11-23 14:47:55,717 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-23 14:47:55,718 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 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|)) (let ((.cse0 (not (< 0 |#StackHeapBarrier|)))) (and (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 (not (= |node_create_#in~data#1| 1)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse1 1) 0)))) (or .cse0 (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 4))) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 0) 0)) (not (= .cse2 |node_create_#in~data#1|)) (not (= (select |old(#length)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 8)) (= |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18| 0) (not (< |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18| |#StackHeapBarrier|)) (not (= .cse2 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 0) 0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 1))))))))) [2022-11-23 14:47:55,718 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-11-23 14:47:55,721 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:47:55,724 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:47:55,742 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,744 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,758 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,758 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,766 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,779 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,779 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,780 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,781 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,782 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,782 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,794 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,794 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,794 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,796 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,796 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,797 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,797 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,797 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,799 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,823 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,824 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,825 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:47:55 BoogieIcfgContainer [2022-11-23 14:47:55,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:47:55,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:47:55,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:47:55,828 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:47:55,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:14" (3/4) ... [2022-11-23 14:47:55,840 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 14:47:55,846 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-23 14:47:55,851 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-23 14:47:55,855 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-23 14:47:55,855 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 14:47:55,856 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 14:47:55,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && last == 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == unknown-#in~len-unknown) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == unknown-#in~len-unknown) && data == 1) && head == \result) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && \result == s) && !(new_head == 0)) && #NULL == 0) && 0 <= \result) && new_head == 0) && s <= 0) && len == i + 1) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && \result == s) && #NULL == 0) || ((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && unknown-#in~data-unknown <= 1) && 1 <= len) && last <= 0) && i <= 0) && \result <= 0) && 0 <= i + 2147483648) && unknown-#in~len-unknown <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-11-23 14:47:55,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && 0 <= i + 1) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && unknown-#in~data-unknown <= 1) && 1 <= len) && last == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && i <= 1) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-11-23 14:47:55,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && unknown-#in~data-unknown <= 1) && last <= 0) && #in~head == s) && 0 < i + 1) && #in~head == head) && #in~head == head) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && i == unknown-#in~index-unknown) && s == #in~head) && len <= 1) && data == 1) && data <= 1) && index == unknown-#in~index-unknown) && len + i == new_data) && head <= 0) && unknown-#in~data-unknown == data) && unknown-#in~data-unknown == new_data) || (((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 < unknown-#in~index-unknown) && unknown-#in~data-unknown <= 1) && last <= 0) && #memory_$Pointer$[#in~head][#in~head] == head) && #in~head == s) && unknown-#in~index-unknown == index + 1) && \result <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && i == unknown-#in~index-unknown) && s == #in~head) && len <= 1) && data == 1) && data <= 1) && len + i == new_data) && head == #memory_$Pointer$[#in~head][#in~head]) && head <= 0) && unknown-#in~data-unknown == data) && unknown-#in~data-unknown == new_data)) && ((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] < unknown-#StackHeapBarrier-unknown) && head == #memory_$Pointer$[last][last]) && head == new_head) && len + 1 == unknown-#in~len-unknown) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && head == \result) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && \result == s) && !(new_head == 0)) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) || (1 <= len && i <= 0))) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-11-23 14:47:55,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && s == #in~head) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && s == #in~head) && unknown-#in~data-unknown <= 1) && 1 <= len) && last == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && index == unknown-#in~index-unknown) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && head == #in~head) && new_head == 0) && head == #in~head) && #NULL == 0) || (((((((((((((((((((((2 <= unknown-#in~len-unknown && s == #in~head) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && s == #in~head) && unknown-#in~data-unknown <= 1) && 1 <= len) && last == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && #memory_$Pointer$[#in~head][#in~head] == head) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && index + 1 == unknown-#in~index-unknown) && new_head == 0) && head == #memory_$Pointer$[#in~head][#in~head]) && #NULL == 0)) && 1 <= unknown-#in~data-unknown) && expected <= 3) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data <= 1) && head <= 0) && 0 <= #in~head) && 0 <= #in~head) && 1 <= unknown-#in~index-unknown) && 0 <= \result) && 3 <= expected) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) || ((((((((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && s == #in~head) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && s == #in~head) && unknown-#in~data-unknown <= 1) && 1 <= len) && i <= 0) && last == 0) && 0 < i + 1) && len + i == expected) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && index == unknown-#in~index-unknown) && head <= 0) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && 0 <= #in~head) && head == #in~head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == #in~head) && #NULL == 0) [2022-11-23 14:47:55,883 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= unknown-#in~len-unknown) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && index <= 0) && unknown-#in~data-unknown <= 1) && 1 <= len) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data <= 1) && head <= 0) && ((((((((((((((s == #in~head && s == #in~head) && last == 0) && len + i == expected) && data == 1) && #memory_$Pointer$[#in~head][#in~head] == head) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && 0 < unknown-#in~index-unknown) && index + 1 == unknown-#in~index-unknown) && new_head == 0) && head == #memory_$Pointer$[#in~head][#in~head]) && #NULL == 0) || (((((((((((((s == #in~head && s == #in~head) && last == 0) && 0 < i + 1) && len + i == expected) && data == 1) && index == unknown-#in~index-unknown) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && head == #in~head) && new_head == 0) && head == #in~head) && #NULL == 0))) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= #in~head) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0 [2022-11-23 14:47:55,898 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:47:55,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:47:55,899 INFO L158 Benchmark]: Toolchain (without parser) took 103156.15ms. Allocated memory was 138.4MB in the beginning and 375.4MB in the end (delta: 237.0MB). Free memory was 100.4MB in the beginning and 221.3MB in the end (delta: -120.9MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,900 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:47:55,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.04ms. Allocated memory is still 138.4MB. Free memory was 100.4MB in the beginning and 82.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.12ms. Allocated memory is still 138.4MB. Free memory was 82.6MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,901 INFO L158 Benchmark]: Boogie Preprocessor took 61.08ms. Allocated memory is still 138.4MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,901 INFO L158 Benchmark]: RCFGBuilder took 663.99ms. Allocated memory is still 138.4MB. Free memory was 78.7MB in the beginning and 58.1MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,901 INFO L158 Benchmark]: TraceAbstraction took 101688.70ms. Allocated memory was 138.4MB in the beginning and 375.4MB in the end (delta: 237.0MB). Free memory was 57.4MB in the beginning and 224.5MB in the end (delta: -167.1MB). Peak memory consumption was 179.4MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,902 INFO L158 Benchmark]: Witness Printer took 71.40ms. Allocated memory is still 375.4MB. Free memory was 224.5MB in the beginning and 221.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:47:55,903 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.04ms. Allocated memory is still 138.4MB. Free memory was 100.4MB in the beginning and 82.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.12ms. Allocated memory is still 138.4MB. Free memory was 82.6MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.08ms. Allocated memory is still 138.4MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.99ms. Allocated memory is still 138.4MB. Free memory was 78.7MB in the beginning and 58.1MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 101688.70ms. Allocated memory was 138.4MB in the beginning and 375.4MB in the end (delta: 237.0MB). Free memory was 57.4MB in the beginning and 224.5MB in the end (delta: -167.1MB). Peak memory consumption was 179.4MB. Max. memory is 16.1GB. * Witness Printer took 71.40ms. Allocated memory is still 375.4MB. Free memory was 224.5MB in the beginning and 221.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: 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: 101.5s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1016 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1015 mSDsluCounter, 1404 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 927 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3893 IncrementalHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 477 mSDtfsCounter, 3893 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 478 SyntacticMatches, 55 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 60.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 37 NumberOfFragments, 1627 HoareAnnotationTreeSize, 16 FomulaSimplifications, 605 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 12 FomulaSimplificationsInter, 56580 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 922 ConstructedInterpolants, 0 QuantifiedInterpolants, 1921 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2267 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 218/240 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: 17.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 174, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 408, TOOLS_POST_TIME: 12.1s, TOOLS_POST_CALL_APPLICATIONS: 50, TOOLS_POST_CALL_TIME: 1.4s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 1.9s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 498, TOOLS_QUANTIFIERELIM_TIME: 15.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 769, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 83, DOMAIN_JOIN_TIME: 1.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 19, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 54, DOMAIN_ISSUBSETEQ_TIME: 0.2s, DOMAIN_ISBOTTOM_APPLICATIONS: 174, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 9.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 9.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 54, CALL_SUMMARIZER_APPLICATIONS: 40, 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: 4054, DAG_COMPRESSION_RETAINED_NODES: 533, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-11-23 14:47:55,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= unknown-#in~len-unknown) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && index <= 0) && unknown-#in~data-unknown <= 1) && 1 <= len) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data <= 1) && head <= 0) && ((((((((((((((s == #in~head && s == #in~head) && last == 0) && len + i == expected) && data == 1) && #memory_$Pointer$[#in~head][#in~head] == head) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && 0 < unknown-#in~index-unknown) && index + 1 == unknown-#in~index-unknown) && new_head == 0) && head == #memory_$Pointer$[#in~head][#in~head]) && #NULL == 0) || (((((((((((((s == #in~head && s == #in~head) && last == 0) && 0 < i + 1) && len + i == expected) && data == 1) && index == unknown-#in~index-unknown) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && head == #in~head) && new_head == 0) && head == #in~head) && #NULL == 0))) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= #in~head) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-11-23 14:47:55,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == unknown-#in~len-unknown) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown == data) && \valid[new_head] == 1) && len == unknown-#in~len-unknown) && data == 1) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && new_head == 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((#memory_$Pointer$[head][0] == 0 && unknown-#length-unknown[head] == 8) && head == 0) && 2 == unknown-#length-unknown[1]) && \valid[head] == 1) && head == last) && unknown-#in~len-unknown == len) && unknown-#memory_int-unknown[head][4] == data) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown == data) && \valid[1] == 1) && len == unknown-#in~len-unknown) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && 0 <= i + 1) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && unknown-#in~data-unknown <= 1) && 1 <= len) && last == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && i <= 1) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 625]: Loop Invariant [2022-11-23 14:47:55,928 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && last == 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == unknown-#in~len-unknown) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == unknown-#in~len-unknown) && data == 1) && head == \result) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && \result == s) && !(new_head == 0)) && #NULL == 0) && 0 <= \result) && new_head == 0) && s <= 0) && len == i + 1) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && \result == s) && #NULL == 0) || ((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && unknown-#in~data-unknown <= 1) && 1 <= len) && last <= 0) && i <= 0) && \result <= 0) && 0 <= i + 2147483648) && unknown-#in~len-unknown <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 614]: Loop Invariant [2022-11-23 14:47:55,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,934 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,938 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && unknown-#in~data-unknown <= 1) && last <= 0) && #in~head == s) && 0 < i + 1) && #in~head == head) && #in~head == head) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && i == unknown-#in~index-unknown) && s == #in~head) && len <= 1) && data == 1) && data <= 1) && index == unknown-#in~index-unknown) && len + i == new_data) && head <= 0) && unknown-#in~data-unknown == data) && unknown-#in~data-unknown == new_data) || (((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 < unknown-#in~index-unknown) && unknown-#in~data-unknown <= 1) && last <= 0) && #memory_$Pointer$[#in~head][#in~head] == head) && #in~head == s) && unknown-#in~index-unknown == index + 1) && \result <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && i == unknown-#in~index-unknown) && s == #in~head) && len <= 1) && data == 1) && data <= 1) && len + i == new_data) && head == #memory_$Pointer$[#in~head][#in~head]) && head <= 0) && unknown-#in~data-unknown == data) && unknown-#in~data-unknown == new_data)) && ((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] < unknown-#StackHeapBarrier-unknown) && head == #memory_$Pointer$[last][last]) && head == new_head) && len + 1 == unknown-#in~len-unknown) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && head == \result) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && \result == s) && !(new_head == 0)) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) || (1 <= len && i <= 0))) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 607]: Loop Invariant [2022-11-23 14:47:55,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,942 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 14:47:55,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 14:47:55,944 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && s == #in~head) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && s == #in~head) && unknown-#in~data-unknown <= 1) && 1 <= len) && last == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && index == unknown-#in~index-unknown) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && head == #in~head) && new_head == 0) && head == #in~head) && #NULL == 0) || (((((((((((((((((((((2 <= unknown-#in~len-unknown && s == #in~head) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && s == #in~head) && unknown-#in~data-unknown <= 1) && 1 <= len) && last == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && #memory_$Pointer$[#in~head][#in~head] == head) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && index + 1 == unknown-#in~index-unknown) && new_head == 0) && head == #memory_$Pointer$[#in~head][#in~head]) && #NULL == 0)) && 1 <= unknown-#in~data-unknown) && expected <= 3) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data <= 1) && head <= 0) && 0 <= #in~head) && 0 <= #in~head) && 1 <= unknown-#in~index-unknown) && 0 <= \result) && 3 <= expected) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) || ((((((((((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && s == #in~head) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && s == #in~head) && unknown-#in~data-unknown <= 1) && 1 <= len) && i <= 0) && last == 0) && 0 < i + 1) && len + i == expected) && \result <= 0) && unknown-#in~len-unknown <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= unknown-#in~data-unknown) && index <= 0) && len <= 1) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && index == unknown-#in~index-unknown) && head <= 0) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && 0 <= #in~head) && head == #in~head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == #in~head) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-23 14:47:55,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f0bd5d2-2cfc-45b4-84de-78a70b05690b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE