./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9 --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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- 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-6b4ec56 [2022-11-20 20:06:46,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:06:46,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:06:46,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:06:46,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:06:46,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:06:46,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:06:46,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:06:46,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:06:46,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:06:46,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:06:46,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:06:46,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:06:46,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:06:46,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:06:46,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:06:46,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:06:46,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:06:46,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:06:46,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:06:46,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:06:46,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:06:46,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:06:46,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:06:46,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:06:46,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:06:46,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:06:46,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:06:46,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:06:46,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:06:46,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:06:46,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:06:46,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:06:46,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:06:46,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:06:46,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:06:46,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:06:46,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:06:46,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:06:46,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:06:46,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:06:46,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-20 20:06:46,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:06:46,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:06:46,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:06:46,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:06:46,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:06:46,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:06:46,289 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:06:46,289 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:06:46,290 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:06:46,290 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:06:46,291 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:06:46,292 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:06:46,292 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:06:46,292 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:06:46,292 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:06:46,293 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:06:46,293 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:06:46,293 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:06:46,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:06:46,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:06:46,295 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:06:46,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:06:46,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:06:46,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:06:46,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:06:46,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:06:46,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:06:46,298 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 20:06:46,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:06:46,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:06:46,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:06:46,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:06:46,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:06:46,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:06:46,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:06:46,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:06:46,302 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:06:46,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:06:46,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:06:46,303 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:06:46,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:06:46,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:06:46,304 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:06:46,304 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_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/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_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-11-20 20:06:46,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:06:46,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:06:46,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:06:46,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:06:46,681 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:06:46,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-11-20 20:06:49,819 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:06:50,081 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:06:50,082 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-11-20 20:06:50,093 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/data/0f732eb2d/ae24a2eb28324001a2c1ac9370d7947f/FLAGda27e6d98 [2022-11-20 20:06:50,108 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/data/0f732eb2d/ae24a2eb28324001a2c1ac9370d7947f [2022-11-20 20:06:50,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:06:50,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:06:50,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:06:50,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:06:50,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:06:50,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d806ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50, skipping insertion in model container [2022-11-20 20:06:50,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:06:50,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:06:50,459 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_ed56501f-e4ee-4c3a-bd77-59471259adc1/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-11-20 20:06:50,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:06:50,470 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:06:50,510 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_ed56501f-e4ee-4c3a-bd77-59471259adc1/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-11-20 20:06:50,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:06:50,536 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:06:50,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50 WrapperNode [2022-11-20 20:06:50,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:06:50,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:06:50,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:06:50,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:06:50,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,583 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2022-11-20 20:06:50,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:06:50,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:06:50,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:06:50,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:06:50,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,609 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:06:50,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:06:50,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:06:50,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:06:50,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (1/1) ... [2022-11-20 20:06:50,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:06:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:06:50,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:06:50,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:06:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:06:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:06:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 20:06:50,692 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 20:06:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:06:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:06:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:06:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:06:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:06:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:06:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:06:50,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:06:50,834 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:06:50,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:06:51,148 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:06:51,251 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:06:51,259 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 20:06:51,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:06:51 BoogieIcfgContainer [2022-11-20 20:06:51,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:06:51,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:06:51,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:06:51,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:06:51,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:06:50" (1/3) ... [2022-11-20 20:06:51,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dea8758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:06:51, skipping insertion in model container [2022-11-20 20:06:51,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:50" (2/3) ... [2022-11-20 20:06:51,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dea8758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:06:51, skipping insertion in model container [2022-11-20 20:06:51,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:06:51" (3/3) ... [2022-11-20 20:06:51,284 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-11-20 20:06:51,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:06:51,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-20 20:06:51,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:06:51,383 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;@fd24f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:06:51,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-20 20:06:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 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-20 20:06:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:06:51,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:51,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:51,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1414268203, now seen corresponding path program 1 times [2022-11-20 20:06:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:51,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247786441] [2022-11-20 20:06:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:51,792 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-20 20:06:51,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:51,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247786441] [2022-11-20 20:06:51,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247786441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:51,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:51,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:06:51,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880154954] [2022-11-20 20:06:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:51,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:06:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:06:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:06:51,833 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-20 20:06:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:51,895 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-11-20 20:06:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:06:51,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 [2022-11-20 20:06:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:51,904 INFO L225 Difference]: With dead ends: 89 [2022-11-20 20:06:51,905 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 20:06:51,908 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-20 20:06:51,911 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:51,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 86 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:06:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 20:06:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-11-20 20:06:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 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-20 20:06:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-20 20:06:51,953 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2022-11-20 20:06:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:51,954 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-20 20:06:51,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-20 20:06:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-20 20:06:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:06:51,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:51,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:51,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:06:51,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -955466361, now seen corresponding path program 1 times [2022-11-20 20:06:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:51,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544204650] [2022-11-20 20:06:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:52,119 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-20 20:06:52,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:52,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544204650] [2022-11-20 20:06:52,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544204650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:52,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:52,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:06:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152710298] [2022-11-20 20:06:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:52,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:52,128 INFO L87 Difference]: Start difference. First operand 43 states and 48 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-20 20:06:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:52,223 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-11-20 20:06:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:06:52,225 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-20 20:06:52,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:52,229 INFO L225 Difference]: With dead ends: 49 [2022-11-20 20:06:52,230 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 20:06:52,231 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-20 20:06:52,233 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:52,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:06:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 20:06:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-11-20 20:06:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 41 states have internal predecessors, (46), 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-20 20:06:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-20 20:06:52,250 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 13 [2022-11-20 20:06:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:52,251 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-20 20:06:52,251 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-20 20:06:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-20 20:06:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:06:52,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:52,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:52,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:06:52,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash 445313930, now seen corresponding path program 1 times [2022-11-20 20:06:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:52,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333257837] [2022-11-20 20:06:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:52,419 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-20 20:06:52,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:52,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333257837] [2022-11-20 20:06:52,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333257837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:52,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:52,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:06:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132131626] [2022-11-20 20:06:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:52,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:52,422 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 20:06:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:52,470 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-20 20:06:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:06:52,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 14 [2022-11-20 20:06:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:52,471 INFO L225 Difference]: With dead ends: 48 [2022-11-20 20:06:52,472 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 20:06:52,472 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-20 20:06:52,473 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:52,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:06:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 20:06:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-20 20:06:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 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-20 20:06:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-20 20:06:52,481 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2022-11-20 20:06:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:52,482 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-20 20:06:52,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 20:06:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-20 20:06:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:06:52,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:52,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:52,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:06:52,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -806494496, now seen corresponding path program 1 times [2022-11-20 20:06:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:52,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93349070] [2022-11-20 20:06:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:52,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:06:52,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:52,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93349070] [2022-11-20 20:06:52,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93349070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:06:52,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401662339] [2022-11-20 20:06:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:52,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:06:52,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:06:52,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:06:52,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:06:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:52,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:06:52,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:06:53,012 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-20 20:06:53,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:06:53,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401662339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:53,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:06:53,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-20 20:06:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719689599] [2022-11-20 20:06:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:53,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:53,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:06:53,018 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-20 20:06:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:53,107 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-20 20:06:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:06:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-11-20 20:06:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:53,111 INFO L225 Difference]: With dead ends: 76 [2022-11-20 20:06:53,111 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 20:06:53,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:06:53,120 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:53,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:06:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 20:06:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2022-11-20 20:06:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 46 states have internal predecessors, (52), 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-20 20:06:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-11-20 20:06:53,132 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2022-11-20 20:06:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:53,134 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-11-20 20:06:53,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-20 20:06:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-11-20 20:06:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:06:53,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:53,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:53,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:06:53,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:06:53,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 768474467, now seen corresponding path program 1 times [2022-11-20 20:06:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:53,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610070691] [2022-11-20 20:06:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:06:53,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:53,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610070691] [2022-11-20 20:06:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610070691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:53,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:06:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359012254] [2022-11-20 20:06:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:53,435 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 20:06:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:53,488 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-11-20 20:06:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:06:53,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-11-20 20:06:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:53,489 INFO L225 Difference]: With dead ends: 74 [2022-11-20 20:06:53,490 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 20:06:53,490 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-20 20:06:53,491 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:53,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 62 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:06:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 20:06:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-11-20 20:06:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.542857142857143) internal successors, (54), 48 states have internal predecessors, (54), 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-20 20:06:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-11-20 20:06:53,499 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2022-11-20 20:06:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:53,499 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-11-20 20:06:53,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 20:06:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-11-20 20:06:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:06:53,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:53,500 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-20 20:06:53,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:06:53,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash -230405773, now seen corresponding path program 1 times [2022-11-20 20:06:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:53,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138084392] [2022-11-20 20:06:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:53,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:53,579 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-20 20:06:53,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:53,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138084392] [2022-11-20 20:06:53,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138084392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:53,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:53,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:06:53,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105923551] [2022-11-20 20:06:53,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:53,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:53,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:53,581 INFO L87 Difference]: Start difference. First operand 53 states and 60 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-20 20:06:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:53,648 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-11-20 20:06:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:06:53,649 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-20 20:06:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:53,649 INFO L225 Difference]: With dead ends: 72 [2022-11-20 20:06:53,650 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 20:06:53,650 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-20 20:06:53,651 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:53,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:06:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 20:06:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2022-11-20 20:06:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.55) internal successors, (62), 53 states have internal predecessors, (62), 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-20 20:06:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-11-20 20:06:53,659 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 20 [2022-11-20 20:06:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:53,659 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-11-20 20:06:53,659 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-20 20:06:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-11-20 20:06:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:06:53,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:53,661 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-20 20:06:53,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:06:53,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash -230409691, now seen corresponding path program 1 times [2022-11-20 20:06:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009769248] [2022-11-20 20:06:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:53,746 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-20 20:06:53,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009769248] [2022-11-20 20:06:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009769248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:53,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:53,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:06:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132451862] [2022-11-20 20:06:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:53,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:53,748 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-20 20:06:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:53,830 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2022-11-20 20:06:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:06:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-20 20:06:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:53,832 INFO L225 Difference]: With dead ends: 136 [2022-11-20 20:06:53,832 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 20:06:53,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:06:53,833 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:53,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 116 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:06:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 20:06:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 56. [2022-11-20 20:06:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.5) internal successors, (57), 51 states have internal predecessors, (57), 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-20 20:06:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-20 20:06:53,842 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2022-11-20 20:06:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:53,843 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-20 20:06:53,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-20 20:06:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-20 20:06:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:06:53,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:53,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:53,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:06:53,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1269849070, now seen corresponding path program 1 times [2022-11-20 20:06:53,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:53,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633398416] [2022-11-20 20:06:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:53,972 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-20 20:06:53,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:53,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633398416] [2022-11-20 20:06:53,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633398416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:06:53,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059554405] [2022-11-20 20:06:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:06:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:06:53,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:06:54,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:06:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:54,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:06:54,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:06:54,161 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-20 20:06:54,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:06:54,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059554405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:54,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:06:54,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-20 20:06:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964165719] [2022-11-20 20:06:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:54,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:06:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:06:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:06:54,164 INFO L87 Difference]: Start difference. First operand 56 states and 63 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-20 20:06:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:54,204 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2022-11-20 20:06:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:06:54,205 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-20 20:06:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:54,205 INFO L225 Difference]: With dead ends: 98 [2022-11-20 20:06:54,206 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 20:06:54,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:06:54,207 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 72 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-20 20:06:54,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 72 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:06:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 20:06:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 20:06:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 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-20 20:06:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-20 20:06:54,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 21 [2022-11-20 20:06:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:54,214 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-20 20:06:54,214 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-20 20:06:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-20 20:06:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:06:54,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:54,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:54,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:06:54,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 20:06:54,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1054413508, now seen corresponding path program 1 times [2022-11-20 20:06:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:54,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23632978] [2022-11-20 20:06:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:54,495 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-20 20:06:54,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:54,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23632978] [2022-11-20 20:06:54,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23632978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:54,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:54,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:06:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871983745] [2022-11-20 20:06:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:54,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:54,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:54,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:54,498 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-20 20:06:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:54,557 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-20 20:06:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:06:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-11-20 20:06:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:54,559 INFO L225 Difference]: With dead ends: 76 [2022-11-20 20:06:54,559 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 20:06:54,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:06:54,560 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:54,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:06:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 20:06:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-11-20 20:06:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4444444444444444) 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-20 20:06:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-20 20:06:54,568 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 21 [2022-11-20 20:06:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:54,569 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-20 20:06:54,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-20 20:06:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-20 20:06:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 20:06:54,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:54,570 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-20 20:06:54,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:06:54,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1672833769, now seen corresponding path program 1 times [2022-11-20 20:06:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:54,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429465366] [2022-11-20 20:06:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:54,644 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-20 20:06:54,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:54,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429465366] [2022-11-20 20:06:54,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429465366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:06:54,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:06:54,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:06:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534135393] [2022-11-20 20:06:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:06:54,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:06:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:06:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:06:54,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:06:54,647 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:06:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:06:54,750 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-11-20 20:06:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:06:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-20 20:06:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:06:54,752 INFO L225 Difference]: With dead ends: 56 [2022-11-20 20:06:54,752 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 20:06:54,752 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-20 20:06:54,753 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:06:54,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:06:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 20:06:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-20 20:06:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) 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-20 20:06:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-11-20 20:06:54,762 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 22 [2022-11-20 20:06:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:06:54,763 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-11-20 20:06:54,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:06:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-11-20 20:06:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:06:54,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:06:54,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:06:54,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:06:54,769 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:06:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:06:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -660554005, now seen corresponding path program 1 times [2022-11-20 20:06:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:06:54,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789418297] [2022-11-20 20:06:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:06:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:06:54,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:06:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789418297] [2022-11-20 20:06:54,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789418297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:06:54,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478346340] [2022-11-20 20:06:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:06:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:06:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:06:54,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:06:54,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:06:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:06:55,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:06:55,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:06:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:06:55,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:06:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:06:55,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478346340] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:06:55,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750723566] [2022-11-20 20:06:55,323 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-20 20:06:55,323 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:06:55,327 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:06:55,332 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:06:55,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:06:55,421 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-20 20:06:55,428 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-20 20:06:55,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:55,442 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-20 20:06:55,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:55,450 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-20 20:06:55,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:55,466 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-20 20:06:55,922 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-20 20:06:55,933 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-20 20:06:55,943 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-20 20:06:55,954 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-20 20:06:55,965 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-20 20:06:55,979 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:55,981 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:55,983 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:55,985 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:55,988 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:56,251 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-20 20:06:56,260 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-20 20:06:56,270 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-20 20:06:56,281 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-20 20:06:56,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-20 20:06:56,303 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:56,306 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:56,309 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:56,311 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:56,313 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:56,365 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-20 20:06:56,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:56,378 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-20 20:06:56,392 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-20 20:06:56,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:56,634 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-20 20:06:56,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:06:56,649 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-20 20:06:56,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:06:56,663 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 122 treesize of output 110 [2022-11-20 20:06:56,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:56,906 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-20 20:06:56,923 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-20 20:06:56,937 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-20 20:06:57,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 20:06:57,032 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-20 20:06:57,045 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-20 20:06:57,127 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-20 20:06:57,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:57,150 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 27 treesize of output 11 [2022-11-20 20:06:57,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:57,179 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 27 treesize of output 11 [2022-11-20 20:06:57,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:06:57,322 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 27 treesize of output 11 [2022-11-20 20:06:57,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:06:57,342 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 67 treesize of output 33 [2022-11-20 20:06:57,359 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:06:57,487 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-20 20:06:57,608 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:00,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1750723566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:07:00,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:00,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 5, 5] total 25 [2022-11-20 20:07:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930630796] [2022-11-20 20:07:00,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:07:00,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:07:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:00,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:07:00,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:07:00,162 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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-20 20:07:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:00,535 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-11-20 20:07:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:07:00,537 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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 23 [2022-11-20 20:07:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:00,537 INFO L225 Difference]: With dead ends: 86 [2022-11-20 20:07:00,537 INFO L226 Difference]: Without dead ends: 60 [2022-11-20 20:07:00,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:07:00,538 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:07:00,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-11-20 20:07:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-20 20:07:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-20 20:07:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.372093023255814) internal successors, (59), 54 states have internal predecessors, (59), 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-20 20:07:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-20 20:07:00,556 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 23 [2022-11-20 20:07:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:00,557 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-20 20:07:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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-20 20:07:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-20 20:07:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 20:07:00,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:00,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:07:00,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:07:00,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 20:07:00,766 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash 975854138, now seen corresponding path program 1 times [2022-11-20 20:07:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:00,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321845381] [2022-11-20 20:07:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:00,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:00,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321845381] [2022-11-20 20:07:00,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321845381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:07:00,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185867021] [2022-11-20 20:07:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:00,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:00,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:07:00,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:07:00,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:07:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:01,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:07:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:07:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:01,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:01,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185867021] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:01,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [622888476] [2022-11-20 20:07:01,180 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-20 20:07:01,181 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:01,181 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:01,181 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:01,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:01,216 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-20 20:07:01,220 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-20 20:07:01,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:01,229 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-20 20:07:01,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:01,237 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-20 20:07:01,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:01,248 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-20 20:07:01,596 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-20 20:07:01,608 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-20 20:07:01,617 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-20 20:07:01,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:07:01,639 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-20 20:07:01,650 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,652 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,654 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,658 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,912 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-20 20:07:01,922 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-20 20:07:01,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:07:01,941 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-20 20:07:01,950 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-20 20:07:01,963 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,965 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,968 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,970 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:01,971 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:02,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,048 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-20 20:07:02,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,061 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-20 20:07:02,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,077 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-20 20:07:02,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,240 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-20 20:07:02,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,251 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-20 20:07:02,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,262 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-20 20:07:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,475 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-20 20:07:02,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,491 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-20 20:07:02,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,503 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-20 20:07:02,569 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-20 20:07:02,580 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-20 20:07:02,588 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-20 20:07:02,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:07:02,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,674 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 27 treesize of output 11 [2022-11-20 20:07:02,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,688 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 27 treesize of output 11 [2022-11-20 20:07:02,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,793 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 27 treesize of output 11 [2022-11-20 20:07:02,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:02,807 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 27 treesize of output 11 [2022-11-20 20:07:02,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:02,825 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 67 treesize of output 33 [2022-11-20 20:07:03,045 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-20 20:07:03,148 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:06,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [622888476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:07:06,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:06,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2022-11-20 20:07:06,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310650561] [2022-11-20 20:07:06,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:07:06,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 20:07:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 20:07:06,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:07:06,073 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-20 20:07:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:06,390 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-20 20:07:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:07:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 26 [2022-11-20 20:07:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:06,393 INFO L225 Difference]: With dead ends: 60 [2022-11-20 20:07:06,393 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 20:07:06,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:07:06,394 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:07:06,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-11-20 20:07:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 20:07:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-20 20:07:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 55 states have internal predecessors, (60), 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-20 20:07:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-20 20:07:06,410 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 26 [2022-11-20 20:07:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:06,411 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-20 20:07:06,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-20 20:07:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-20 20:07:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:07:06,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:06,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:07:06,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:07:06,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:06,616 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:06,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash 186707286, now seen corresponding path program 1 times [2022-11-20 20:07:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:06,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816285265] [2022-11-20 20:07:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 20:07:06,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816285265] [2022-11-20 20:07:06,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816285265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:07:06,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:07:06,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:07:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270047675] [2022-11-20 20:07:06,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:07:06,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:07:06,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:06,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:07:06,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:07:06,691 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:07:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:06,724 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-11-20 20:07:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:07:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-11-20 20:07:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:06,725 INFO L225 Difference]: With dead ends: 59 [2022-11-20 20:07:06,725 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 20:07:06,726 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-20 20:07:06,727 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 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-20 20:07:06,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:07:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 20:07:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-20 20:07:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 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-20 20:07:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-20 20:07:06,739 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 27 [2022-11-20 20:07:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:06,740 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-20 20:07:06,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:07:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-20 20:07:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 20:07:06,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:06,741 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] [2022-11-20 20:07:06,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:07:06,742 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -962918234, now seen corresponding path program 1 times [2022-11-20 20:07:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166837245] [2022-11-20 20:07:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:06,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166837245] [2022-11-20 20:07:06,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166837245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:07:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151191125] [2022-11-20 20:07:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:06,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:07:06,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:07:06,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:07:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:07,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:07:07,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:07:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:07:07,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:07:07,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151191125] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:07,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [914841885] [2022-11-20 20:07:07,174 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 20:07:07,174 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:07,175 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:07,175 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:07,175 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:07,197 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-20 20:07:07,201 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-20 20:07:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:07,209 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-20 20:07:07,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:07,220 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-20 20:07:07,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:07,226 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-20 20:07:07,319 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-20 20:07:07,326 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-20 20:07:07,335 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-20 20:07:07,343 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-20 20:07:07,351 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-20 20:07:07,386 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-20 20:07:07,395 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-20 20:07:07,404 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-20 20:07:07,412 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-20 20:07:07,420 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-20 20:07:07,452 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-20 20:07:07,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:07,464 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-20 20:07:07,473 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-20 20:07:07,744 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,754 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,758 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,760 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,769 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-20 20:07:07,777 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-20 20:07:07,795 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-20 20:07:07,803 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-20 20:07:07,811 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-20 20:07:07,990 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,992 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,994 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,996 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:07,998 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,006 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-20 20:07:08,018 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-20 20:07:08,026 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-20 20:07:08,035 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-20 20:07:08,048 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-20 20:07:08,088 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-20 20:07:08,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:08,107 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-20 20:07:08,120 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-20 20:07:08,369 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-20 20:07:08,378 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-20 20:07:08,387 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-20 20:07:08,394 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-20 20:07:08,402 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-20 20:07:08,412 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,415 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,417 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,420 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,614 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-20 20:07:08,623 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-20 20:07:08,630 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-20 20:07:08,640 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-20 20:07:08,647 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-20 20:07:08,659 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,660 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,662 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,665 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,667 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:08,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:08,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:08,760 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-20 20:07:08,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:08,772 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-20 20:07:08,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:08,785 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-20 20:07:08,985 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:08,985 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-20 20:07:09,000 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-20 20:07:09,033 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:09,033 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-20 20:07:09,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:09,156 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:07:09,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2022-11-20 20:07:09,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,171 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 21 treesize of output 13 [2022-11-20 20:07:09,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:09,198 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:07:09,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2022-11-20 20:07:09,683 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-20 20:07:09,684 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 360 treesize of output 357 [2022-11-20 20:07:09,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,762 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:09,763 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 354 treesize of output 332 [2022-11-20 20:07:09,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:09,836 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:09,836 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 354 treesize of output 332 [2022-11-20 20:07:10,247 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:07:10,247 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 155 treesize of output 149 [2022-11-20 20:07:10,286 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:07:10,286 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 151 treesize of output 145 [2022-11-20 20:07:10,399 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-20 20:07:10,922 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-20 20:07:11,058 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:16,607 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2813#(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) (<= 0 |ULTIMATE.start_sll_circular_update_at_~index#1|) (<= |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) (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 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|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (< 2147483646 |ULTIMATE.start_main_#t~post15#1|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#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|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-20 20:07:16,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:07:16,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:16,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-11-20 20:07:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735236232] [2022-11-20 20:07:16,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:07:16,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 20:07:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 20:07:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-20 20:07:16,609 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 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-20 20:07:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:17,057 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2022-11-20 20:07:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 20:07:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-20 20:07:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:17,060 INFO L225 Difference]: With dead ends: 93 [2022-11-20 20:07:17,060 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 20:07:17,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 20:07:17,063 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:07:17,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 184 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:07:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 20:07:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2022-11-20 20:07:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.453125) internal successors, (93), 74 states have internal predecessors, (93), 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-20 20:07:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-11-20 20:07:17,078 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 29 [2022-11-20 20:07:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:17,078 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-11-20 20:07:17,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 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-20 20:07:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-11-20 20:07:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 20:07:17,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:17,079 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] [2022-11-20 20:07:17,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:07:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 20:07:17,284 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:17,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash -962922152, now seen corresponding path program 1 times [2022-11-20 20:07:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:17,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916167268] [2022-11-20 20:07:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:17,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916167268] [2022-11-20 20:07:17,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916167268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:07:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032102072] [2022-11-20 20:07:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:07:17,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:07:17,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:07:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:17,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:07:17,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:07:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:17,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:07:17,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032102072] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:17,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [922515508] [2022-11-20 20:07:17,688 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 20:07:17,688 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:17,688 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:17,689 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:17,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:17,707 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-20 20:07:17,711 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-20 20:07:17,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:17,719 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-20 20:07:17,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:17,730 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-20 20:07:17,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:17,737 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-20 20:07:17,829 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-20 20:07:17,839 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-20 20:07:17,850 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-20 20:07:17,865 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-20 20:07:17,872 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-20 20:07:17,908 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-20 20:07:17,915 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-20 20:07:17,929 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-20 20:07:17,937 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-20 20:07:17,945 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-20 20:07:18,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,025 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-20 20:07:18,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,038 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-20 20:07:18,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,051 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-20 20:07:18,134 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-20 20:07:18,141 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-20 20:07:18,149 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-20 20:07:18,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-20 20:07:18,168 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-20 20:07:18,205 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-20 20:07:18,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-20 20:07:18,222 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-20 20:07:18,231 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-20 20:07:18,240 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-20 20:07:18,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,306 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-20 20:07:18,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,320 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-20 20:07:18,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,336 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-20 20:07:18,419 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-20 20:07:18,427 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-20 20:07:18,438 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-20 20:07:18,446 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-20 20:07:18,454 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-20 20:07:18,493 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-20 20:07:18,500 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-20 20:07:18,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-20 20:07:18,518 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-20 20:07:18,528 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-20 20:07:18,566 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-20 20:07:18,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,581 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-20 20:07:18,589 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-20 20:07:18,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,653 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:18,654 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-20 20:07:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,671 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-20 20:07:18,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,695 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:18,696 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 26 treesize of output 21 [2022-11-20 20:07:18,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,812 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 23 treesize of output 13 [2022-11-20 20:07:18,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,856 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:07:18,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2022-11-20 20:07:18,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:18,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:18,892 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:07:18,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-11-20 20:07:19,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:19,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:19,396 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:19,397 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 358 treesize of output 336 [2022-11-20 20:07:19,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:19,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:19,460 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-20 20:07:19,461 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 358 treesize of output 340 [2022-11-20 20:07:19,494 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-20 20:07:19,496 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 352 treesize of output 349 [2022-11-20 20:07:19,893 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:07:19,893 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 160 treesize of output 154 [2022-11-20 20:07:19,925 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 20:07:19,925 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 156 treesize of output 150 [2022-11-20 20:07:19,989 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-20 20:07:20,659 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-20 20:07:20,787 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:26,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [922515508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:07:26,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:26,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 8, 8] total 25 [2022-11-20 20:07:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390535787] [2022-11-20 20:07:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:07:26,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 20:07:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 20:07:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2022-11-20 20:07:26,456 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:07:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:28,034 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-11-20 20:07:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:07:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-20 20:07:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:28,036 INFO L225 Difference]: With dead ends: 78 [2022-11-20 20:07:28,036 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 20:07:28,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:07:28,037 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:07:28,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 97 Unchecked, 0.5s Time] [2022-11-20 20:07:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 20:07:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-11-20 20:07:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.253968253968254) internal successors, (79), 69 states have internal predecessors, (79), 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-20 20:07:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-20 20:07:28,051 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 29 [2022-11-20 20:07:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:28,051 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-20 20:07:28,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:07:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-20 20:07:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 20:07:28,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:28,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-20 20:07:28,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:07:28,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 20:07:28,255 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:28,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1900983667, now seen corresponding path program 1 times [2022-11-20 20:07:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:28,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70492652] [2022-11-20 20:07:28,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 20:07:28,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:28,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70492652] [2022-11-20 20:07:28,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70492652] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:07:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276768303] [2022-11-20 20:07:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:28,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:07:28,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:07:28,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:07:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:28,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:07:28,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:07:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:28,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:28,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276768303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:28,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [313584910] [2022-11-20 20:07:28,761 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-20 20:07:28,762 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:28,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:28,762 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:28,762 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:28,779 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-20 20:07:28,783 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-20 20:07:28,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:28,792 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-20 20:07:28,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:28,801 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-20 20:07:28,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:28,807 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-20 20:07:28,890 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-20 20:07:28,897 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-20 20:07:28,906 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-20 20:07:28,915 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-20 20:07:28,923 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-20 20:07:28,952 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-20 20:07:28,961 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-20 20:07:28,974 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-20 20:07:28,982 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-20 20:07:28,990 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-20 20:07:29,022 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-20 20:07:29,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:29,031 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-20 20:07:29,039 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-20 20:07:29,113 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-20 20:07:29,120 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-20 20:07:29,128 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-20 20:07:29,137 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-20 20:07:29,146 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-20 20:07:29,177 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-20 20:07:29,185 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-20 20:07:29,195 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-20 20:07:29,202 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-20 20:07:29,211 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-20 20:07:29,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:29,242 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-20 20:07:29,250 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-20 20:07:29,261 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-20 20:07:29,318 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-20 20:07:29,327 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-20 20:07:29,335 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-20 20:07:29,347 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-20 20:07:29,370 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-20 20:07:29,403 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-20 20:07:29,422 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-20 20:07:29,431 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-20 20:07:29,439 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-20 20:07:29,456 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-20 20:07:29,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:29,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:29,517 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-20 20:07:29,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:29,535 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-20 20:07:29,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:29,548 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-20 20:07:29,626 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:29,626 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-20 20:07:29,638 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-20 20:07:29,660 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:29,660 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-20 20:07:29,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:29,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:29,962 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-20 20:07:29,962 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 414 treesize of output 396 [2022-11-20 20:07:29,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:29,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:30,030 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-20 20:07:30,030 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 414 treesize of output 396 [2022-11-20 20:07:30,059 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-20 20:07:30,060 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 408 treesize of output 396 [2022-11-20 20:07:30,417 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-20 20:07:30,432 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-20 20:07:30,443 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-20 20:07:30,899 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-20 20:07:30,908 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-20 20:07:30,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:07:30,956 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-20 20:07:31,075 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:36,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [313584910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:07:36,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:36,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [6, 5, 5] total 32 [2022-11-20 20:07:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135018583] [2022-11-20 20:07:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:07:36,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 20:07:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 20:07:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 20:07:36,902 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-20 20:07:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:39,043 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-11-20 20:07:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 20:07:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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 40 [2022-11-20 20:07:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:39,044 INFO L225 Difference]: With dead ends: 94 [2022-11-20 20:07:39,044 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 20:07:39,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=257, Invalid=1149, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 20:07:39,046 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:07:39,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 128 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 270 Invalid, 0 Unknown, 118 Unchecked, 0.4s Time] [2022-11-20 20:07:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 20:07:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2022-11-20 20:07:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 52 states have internal predecessors, (58), 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-20 20:07:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-20 20:07:39,064 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2022-11-20 20:07:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:39,064 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-20 20:07:39,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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-20 20:07:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-20 20:07:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 20:07:39,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:39,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-11-20 20:07:39,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 20:07:39,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 20:07:39,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1234448993, now seen corresponding path program 1 times [2022-11-20 20:07:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:39,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138048499] [2022-11-20 20:07:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:39,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138048499] [2022-11-20 20:07:39,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138048499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:07:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254099585] [2022-11-20 20:07:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:07:39,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:07:39,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:07:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:39,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:07:39,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:07:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:39,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:39,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254099585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:39,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442471117] [2022-11-20 20:07:39,701 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-20 20:07:39,701 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:39,702 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:39,702 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:39,702 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:39,723 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-20 20:07:39,728 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-20 20:07:39,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:39,739 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-20 20:07:39,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:39,746 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-20 20:07:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:39,754 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-20 20:07:39,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:07:39,845 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-20 20:07:39,853 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-20 20:07:39,863 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-20 20:07:39,870 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-20 20:07:39,909 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-20 20:07:39,917 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-20 20:07:39,924 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-20 20:07:39,934 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-20 20:07:39,941 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-20 20:07:39,970 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-20 20:07:39,981 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-20 20:07:39,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:39,990 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-20 20:07:40,057 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-20 20:07:40,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-20 20:07:40,073 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-20 20:07:40,081 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-20 20:07:40,092 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-20 20:07:40,123 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-20 20:07:40,131 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-20 20:07:40,139 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-20 20:07:40,148 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-20 20:07:40,157 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-20 20:07:40,186 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-20 20:07:40,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:40,197 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-20 20:07:40,224 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-20 20:07:40,281 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-20 20:07:40,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:07:40,305 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-20 20:07:40,315 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-20 20:07:40,323 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-20 20:07:40,357 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-20 20:07:40,365 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-20 20:07:40,374 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-20 20:07:40,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:07:40,389 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-20 20:07:40,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:40,451 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-20 20:07:40,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,464 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-20 20:07:40,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,476 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-20 20:07:40,541 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:40,541 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-20 20:07:40,564 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:40,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-20 20:07:40,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:40,582 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-20 20:07:40,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,793 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:40,794 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 415 treesize of output 393 [2022-11-20 20:07:40,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:40,856 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:40,856 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 415 treesize of output 393 [2022-11-20 20:07:40,887 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-20 20:07:40,887 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 409 treesize of output 397 [2022-11-20 20:07:41,219 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-20 20:07:41,227 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-20 20:07:41,237 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-20 20:07:41,622 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-20 20:07:41,631 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-20 20:07:41,639 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-20 20:07:41,678 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-20 20:07:41,794 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:07:48,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1442471117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:07:48,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:07:48,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 33 [2022-11-20 20:07:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184410586] [2022-11-20 20:07:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:07:48,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 20:07:48,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:07:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 20:07:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 20:07:48,402 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-20 20:07:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:07:52,465 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-20 20:07:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 20:07:52,466 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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 43 [2022-11-20 20:07:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:07:52,466 INFO L225 Difference]: With dead ends: 70 [2022-11-20 20:07:52,467 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 20:07:52,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=276, Invalid=1616, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 20:07:52,468 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:07:52,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 86 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 321 Invalid, 0 Unknown, 123 Unchecked, 0.5s Time] [2022-11-20 20:07:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 20:07:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-20 20:07:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 54 states have internal predecessors, (60), 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-20 20:07:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-20 20:07:52,486 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 43 [2022-11-20 20:07:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:07:52,486 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-20 20:07:52,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 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-20 20:07:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-20 20:07:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 20:07:52,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:07:52,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2022-11-20 20:07:52,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 20:07:52,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 20:07:52,688 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:07:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:07:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1960082138, now seen corresponding path program 1 times [2022-11-20 20:07:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:07:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948183813] [2022-11-20 20:07:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:07:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:52,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:07:52,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948183813] [2022-11-20 20:07:52,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948183813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:07:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903829598] [2022-11-20 20:07:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:07:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:07:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:07:52,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:07:52,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:07:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:07:53,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:07:53,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:07:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:53,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:07:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:07:53,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903829598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:07:53,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1111973888] [2022-11-20 20:07:53,112 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 20:07:53,112 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:07:53,112 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:07:53,113 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:07:53,113 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:07:53,139 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-20 20:07:53,142 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-20 20:07:53,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:53,150 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-20 20:07:53,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:53,155 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-20 20:07:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:53,164 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-20 20:07:53,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:07:53,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:07:53,267 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-20 20:07:53,274 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-20 20:07:53,282 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-20 20:07:53,314 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-20 20:07:53,324 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-20 20:07:53,331 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-20 20:07:53,344 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-20 20:07:53,355 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-20 20:07:53,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:53,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:53,418 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-20 20:07:53,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:53,435 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-20 20:07:53,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:53,448 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-20 20:07:53,616 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,618 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,620 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,629 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-20 20:07:53,639 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-20 20:07:53,647 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-20 20:07:53,655 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-20 20:07:53,663 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-20 20:07:53,782 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,786 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,788 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:53,797 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-20 20:07:53,805 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-20 20:07:53,813 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-20 20:07:53,821 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-20 20:07:53,831 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-20 20:07:53,862 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-20 20:07:53,870 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-20 20:07:53,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:53,884 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-20 20:07:54,034 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,035 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,037 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,039 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,048 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-20 20:07:54,055 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-20 20:07:54,063 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-20 20:07:54,071 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-20 20:07:54,080 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-20 20:07:54,245 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-20 20:07:54,256 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-20 20:07:54,263 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-20 20:07:54,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-20 20:07:54,281 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-20 20:07:54,292 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,293 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,295 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:07:54,330 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-20 20:07:54,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:54,338 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-20 20:07:54,350 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-20 20:07:54,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:07:54,520 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-20 20:07:54,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:54,541 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:54,541 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-20 20:07:54,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:54,566 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:07:54,566 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 26 treesize of output 21 [2022-11-20 20:07:54,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:54,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:54,790 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:54,790 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 439 treesize of output 401 [2022-11-20 20:07:54,822 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-11-20 20:07:54,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 433 treesize of output 417 [2022-11-20 20:07:54,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:54,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:07:54,892 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-20 20:07:54,893 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 427 treesize of output 405 [2022-11-20 20:07:55,213 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-20 20:07:55,230 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-20 20:07:55,249 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-20 20:07:55,944 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-20 20:07:55,955 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-20 20:07:55,965 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-20 20:07:55,996 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-20 20:07:56,117 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:08:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1111973888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:08:01,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:08:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [8, 8, 8] total 29 [2022-11-20 20:08:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702071599] [2022-11-20 20:08:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:08:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 20:08:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:08:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 20:08:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2022-11-20 20:08:01,977 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-20 20:08:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:08:03,971 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-11-20 20:08:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:08:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 46 [2022-11-20 20:08:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:08:03,979 INFO L225 Difference]: With dead ends: 66 [2022-11-20 20:08:03,980 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 20:08:03,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2022-11-20 20:08:03,980 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:08:03,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 139 Unchecked, 0.4s Time] [2022-11-20 20:08:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 20:08:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-11-20 20:08:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 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-20 20:08:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-20 20:08:03,995 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 46 [2022-11-20 20:08:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:08:03,995 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-20 20:08:03,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-20 20:08:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-20 20:08:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 20:08:03,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:08:03,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-11-20 20:08:04,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:08:04,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 20:08:04,203 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 20:08:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:08:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 633004255, now seen corresponding path program 1 times [2022-11-20 20:08:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:08:04,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128253656] [2022-11-20 20:08:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:08:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:08:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:08:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 20:08:04,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:08:04,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128253656] [2022-11-20 20:08:04,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128253656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:08:04,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:08:04,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:08:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712480724] [2022-11-20 20:08:04,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:08:04,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:08:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:08:04,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:08:04,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:08:04,275 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:08:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:08:04,312 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-11-20 20:08:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:08:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-20 20:08:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:08:04,314 INFO L225 Difference]: With dead ends: 53 [2022-11-20 20:08:04,314 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 20:08:04,315 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-20 20:08:04,316 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:08:04,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:08:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 20:08:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 20:08:04,318 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-20 20:08:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 20:08:04,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-11-20 20:08:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:08:04,318 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 20:08:04,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:08:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 20:08:04,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 20:08:04,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-20 20:08:04,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-20 20:08:04,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-20 20:08:04,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-20 20:08:04,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-20 20:08:04,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-20 20:08:04,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-20 20:08:04,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-20 20:08:04,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-20 20:08:04,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-20 20:08:04,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-20 20:08:04,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-20 20:08:04,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-20 20:08:04,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-20 20:08:04,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 20:08:04,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 20:08:08,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-20 20:08:08,095 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-11-20 20:08:08,095 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-11-20 20:08:08,095 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2022-11-20 20:08:08,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-20 20:08:08,095 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (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_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 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|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 4) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#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|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 2) (<= 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0)) [2022-11-20 20:08:08,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-20 20:08:08,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 20:08:08,096 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|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) (<= |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|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 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|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#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) (= |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|) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 2) (= |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-20 20:08:08,096 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-11-20 20:08:08,096 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-11-20 20:08:08,096 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2022-11-20 20:08:08,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-11-20 20:08:08,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-20 20:08:08,097 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 4) (<= |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_main_~i~0#1| 2) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 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|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 2) (= |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_get_data_at_#in~head#1.offset|) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 2) (= |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-20 20:08:08,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-11-20 20:08:08,097 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2022-11-20 20:08:08,097 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2022-11-20 20:08:08,097 INFO L899 garLoopResultBuilder]: For program point L625-3(line 625) no Hoare annotation was computed. [2022-11-20 20:08:08,098 INFO L899 garLoopResultBuilder]: For program point L625-4(line 625) no Hoare annotation was computed. [2022-11-20 20:08:08,098 INFO L895 garLoopResultBuilder]: At program point L625-5(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse8 (= |#NULL.base| 0))) (or (let ((.cse4 (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 .cse0 (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse1 (= |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|) .cse2 (< |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|) (= |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|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) .cse3 (= (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 .cse4)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |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)) (= |#NULL.offset| 0) .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) (< 0 |#StackHeapBarrier|) .cse8)) (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse0 (<= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_~index#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 4) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 2) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 4) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse2 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 4) .cse3 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |#NULL.offset|) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse5 (<= 1 |ULTIMATE.start_main_~data~0#1|) .cse6 (<= 0 |#StackHeapBarrier|) .cse7 .cse8))) [2022-11-20 20:08:08,098 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-20 20:08:08,099 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) (= 19 (select |#length| 2)) (= |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) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-20 20:08:08,099 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-11-20 20:08:08,099 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-20 20:08:08,099 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-20 20:08:08,099 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2022-11-20 20:08:08,099 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2022-11-20 20:08:08,099 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-20 20:08:08,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-11-20 20:08:08,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-20 20:08:08,100 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_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= (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 (= 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) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (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) (= (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|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) .cse0 .cse1 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) .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|) .cse5 .cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse7 .cse8))) [2022-11-20 20:08:08,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 20:08:08,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-11-20 20:08:08,100 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (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) (= (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|) (= (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|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) (= |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|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-20 20:08:08,101 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L899 garLoopResultBuilder]: For program point L629-3(line 629) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L899 garLoopResultBuilder]: For program point L629-4(line 629) no Hoare annotation was computed. [2022-11-20 20:08:08,101 INFO L895 garLoopResultBuilder]: At program point L629-5(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|) (<= |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) (<= 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|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#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_create_#res#1.offset|) (= |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-20 20:08:08,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-20 20:08:08,102 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-11-20 20:08:08,102 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-20 20:08:08,102 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (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 .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse1 1) 0)) (not (= 19 (select |old(#length)| 2))))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32| Int)) (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 4))) (or (not (= 8 (select |old(#length)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|))) (not (= .cse2 |node_create_#in~data#1|)) (= |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32| 0) (not (= .cse2 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 0) 0)) (not (< |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32| |#StackHeapBarrier|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 0) 0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_32|) 1))))) .cse0))) (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|))) [2022-11-20 20:08:08,103 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-11-20 20:08:08,106 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-20 20:08:08,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:08:08,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,150 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:08:08 BoogieIcfgContainer [2022-11-20 20:08:08,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:08:08,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:08:08,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:08:08,157 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:08:08,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:06:51" (3/4) ... [2022-11-20 20:08:08,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 20:08:08,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-20 20:08:08,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-20 20:08:08,172 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-20 20:08:08,173 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 20:08:08,173 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 20:08:08,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] == last) && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == \old(len)) && 1 <= \old(data)) && \old(data) == data) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && 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) || (((((((((((((((((((2 == len && #memory_$Pointer$[head][0] == 0) && unknown-#length-unknown[head] == 8) && head == 0) && \valid[head] == 1) && head == last) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && \old(data) == data) && !(head == 0)) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && len == 2) && #NULL == 0) && #memory_$Pointer$[head][0] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-11-20 20:08:08,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((0 <= s && new_head < unknown-#StackHeapBarrier-unknown) && i == 0) && last == 0) && \result <= 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && \old(data) == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == \old(len)) && 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) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && data <= 1) && head <= 0) && 2 <= len) && 0 <= index) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && \result <= 0) && i <= 2) && data <= 4) && \old(len) <= 2) && #NULL <= 0) && len <= 2) && 2 <= data) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && index <= 0) && len <= 1) && new_data <= 4) && data <= 1) && 2 <= \old(data)) && head <= 0) && 0 <= head) && 0 <= #NULL) && 2 <= new_data) && 0 <= \result) && 1 <= data) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-11-20 20:08:08,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= \old(len) && 0 <= s) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-11-20 20:08:08,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= i) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= new_data) && 0 <= \result) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-11-20 20:08:08,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && expected <= 4) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && i <= 2) && \old(len) <= 2) && head <= 0) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= i) && len <= 1) && index <= 2) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 2 <= expected) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-11-20 20:08:08,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && 0 <= s) && expected <= 4) && index <= 0) && \old(data) <= 1) && 1 <= len) && last == 0) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && i <= 2) && \old(len) <= 2) && head <= 0) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 2 <= expected) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-11-20 20:08:08,213 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 20:08:08,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:08:08,214 INFO L158 Benchmark]: Toolchain (without parser) took 78101.69ms. Allocated memory was 172.0MB in the beginning and 438.3MB in the end (delta: 266.3MB). Free memory was 126.5MB in the beginning and 344.6MB in the end (delta: -218.1MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2022-11-20 20:08:08,214 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:08:08,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.97ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 109.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 20:08:08,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.47ms. Allocated memory is still 172.0MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 20:08:08,215 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 172.0MB. Free memory was 106.3MB in the beginning and 105.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:08:08,215 INFO L158 Benchmark]: RCFGBuilder took 659.76ms. Allocated memory is still 172.0MB. Free memory was 105.1MB in the beginning and 84.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 20:08:08,216 INFO L158 Benchmark]: TraceAbstraction took 76879.95ms. Allocated memory was 172.0MB in the beginning and 438.3MB in the end (delta: 266.3MB). Free memory was 83.8MB in the beginning and 348.8MB in the end (delta: -265.0MB). Peak memory consumption was 211.0MB. Max. memory is 16.1GB. [2022-11-20 20:08:08,216 INFO L158 Benchmark]: Witness Printer took 56.80ms. Allocated memory is still 438.3MB. Free memory was 348.8MB in the beginning and 344.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 20:08:08,217 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.29ms. Allocated memory is still 142.6MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.97ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 109.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.47ms. Allocated memory is still 172.0MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 172.0MB. Free memory was 106.3MB in the beginning and 105.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 659.76ms. Allocated memory is still 172.0MB. Free memory was 105.1MB in the beginning and 84.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 76879.95ms. Allocated memory was 172.0MB in the beginning and 438.3MB in the end (delta: 266.3MB). Free memory was 83.8MB in the beginning and 348.8MB in the end (delta: -265.0MB). Peak memory consumption was 211.0MB. Max. memory is 16.1GB. * Witness Printer took 56.80ms. Allocated memory is still 438.3MB. Free memory was 348.8MB in the beginning and 344.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 - 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: 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: 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, 48 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 76.8s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 1821 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 574 IncrementalHoareTripleChecker+Unchecked, 1301 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2137 IncrementalHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 520 mSDtfsCounter, 2137 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 532 SyntacticMatches, 69 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=14, InterpolantAutomatonStates: 189, 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, 183 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 35 NumberOfFragments, 1087 HoareAnnotationTreeSize, 16 FomulaSimplifications, 8656 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7039 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 960 ConstructedInterpolants, 0 QuantifiedInterpolants, 2048 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 35 InterpolantComputations, 12 PerfectInterpolantSequences, 274/363 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: 14.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 149, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 391, TOOLS_POST_TIME: 8.9s, TOOLS_POST_CALL_APPLICATIONS: 60, TOOLS_POST_CALL_TIME: 2.0s, TOOLS_POST_RETURN_APPLICATIONS: 48, TOOLS_POST_RETURN_TIME: 2.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 499, TOOLS_QUANTIFIERELIM_TIME: 12.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 752, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 65, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 20, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 52, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 149, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 32, LOOP_SUMMARIZER_CACHE_MISSES: 32, LOOP_SUMMARIZER_OVERALL_TIME: 8.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 8.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 52, CALL_SUMMARIZER_APPLICATIONS: 48, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.3s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2168, DAG_COMPRESSION_RETAINED_NODES: 523, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= \old(len) && 0 <= s) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 625]: Loop Invariant [2022-11-20 20:08:08,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,231 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((0 <= s && new_head < unknown-#StackHeapBarrier-unknown) && i == 0) && last == 0) && \result <= 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && 1 <= data) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && \old(data) == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == \old(len)) && 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) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && data <= 1) && head <= 0) && 2 <= len) && 0 <= index) && 1 <= i) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && last <= 0) && \old(index) <= 2) && \result <= 0) && i <= 2) && data <= 4) && \old(len) <= 2) && #NULL <= 0) && len <= 2) && 2 <= data) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && index <= 0) && len <= 1) && new_data <= 4) && data <= 1) && 2 <= \old(data)) && head <= 0) && 0 <= head) && 0 <= #NULL) && 2 <= new_data) && 0 <= \result) && 1 <= data) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && 0 <= s) && expected <= 4) && index <= 0) && \old(data) <= 1) && 1 <= len) && last == 0) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && i <= 2) && \old(len) <= 2) && head <= 0) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 2 <= expected) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-11-20 20:08:08,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,238 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 20:08:08,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 20:08:08,240 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 && #memory_$Pointer$[new_head][new_head] == last) && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == \old(len)) && 1 <= \old(data)) && \old(data) == data) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && 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) || (((((((((((((((((((2 == len && #memory_$Pointer$[head][0] == 0) && unknown-#length-unknown[head] == 8) && head == 0) && \valid[head] == 1) && head == last) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && \old(data) == data) && !(head == 0)) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && len == 2) && #NULL == 0) && #memory_$Pointer$[head][0] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && \old(data) <= 1) && \old(data) <= 4) && 1 <= len) && \old(index) <= 2) && last == 0) && \result <= 0) && data <= 4) && \old(len) <= 2) && 2 <= data) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= i) && len <= 1) && new_data <= 4) && data == 1) && data <= 1) && 2 <= \old(data)) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && index <= 2) && 0 <= index + 1) && 2 <= new_data) && 0 <= \result) && new_head == 0) && i < len) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && expected <= 4) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && i <= 2) && \old(len) <= 2) && head <= 0) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && 0 <= i) && len <= 1) && index <= 2) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 2 <= expected) && 0 <= \result) && \old(index) <= 2) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-20 20:08:08,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed56501f-e4ee-4c3a-bd77-59471259adc1/bin/utaipan-6cKwYrpEi9/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