./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- 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-8393723 [2022-11-19 08:27:03,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:27:03,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:27:03,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:27:03,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:27:03,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:27:03,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:27:03,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:27:03,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:27:03,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:27:03,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:27:03,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:27:03,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:27:03,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:27:03,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:27:03,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:27:03,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:27:03,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:27:03,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:27:03,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:27:03,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:27:03,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:27:03,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:27:03,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:27:03,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:27:03,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:27:03,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:27:03,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:27:03,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:27:03,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:27:03,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:27:03,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:27:03,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:27:03,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:27:03,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:27:03,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:27:03,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:27:03,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:27:03,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:27:03,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:27:03,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:27:03,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 08:27:03,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:27:03,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:27:03,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:27:03,383 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:27:03,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:27:03,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:27:03,384 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:27:03,385 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:27:03,385 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:27:03,385 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:27:03,386 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:27:03,386 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:27:03,386 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:27:03,387 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:27:03,387 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:27:03,387 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:27:03,387 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:27:03,387 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:27:03,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:27:03,388 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:27:03,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:27:03,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:27:03,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:27:03,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:27:03,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:27:03,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:27:03,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:27:03,391 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 08:27:03,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:27:03,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:27:03,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:27:03,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:27:03,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:27:03,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:27:03,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:27:03,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:27:03,393 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:27:03,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:27:03,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:27:03,393 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:27:03,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:27:03,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:27:03,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:27:03,394 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_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/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_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-19 08:27:03,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:27:03,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:27:03,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:27:03,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:27:03,734 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:27:03,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-19 08:27:03,823 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/data/1557fb9ae/71b809b18d8344ce9a37d3566d7f1da6/FLAGb9d54bb24 [2022-11-19 08:27:04,358 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:27:04,359 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-19 08:27:04,378 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/data/1557fb9ae/71b809b18d8344ce9a37d3566d7f1da6/FLAGb9d54bb24 [2022-11-19 08:27:04,666 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/data/1557fb9ae/71b809b18d8344ce9a37d3566d7f1da6 [2022-11-19 08:27:04,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:27:04,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:27:04,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:27:04,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:27:04,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:27:04,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:27:04" (1/1) ... [2022-11-19 08:27:04,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605306af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:04, skipping insertion in model container [2022-11-19 08:27:04,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:27:04" (1/1) ... [2022-11-19 08:27:04,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:27:04,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:27:05,180 WARN L234 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_70305372-2c8c-48fb-8ab1-b34d3464a774/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-19 08:27:05,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:27:05,195 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:27:05,262 WARN L234 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_70305372-2c8c-48fb-8ab1-b34d3464a774/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-19 08:27:05,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:27:05,300 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:27:05,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05 WrapperNode [2022-11-19 08:27:05,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:27:05,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:27:05,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:27:05,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:27:05,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,344 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2022-11-19 08:27:05,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:27:05,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:27:05,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:27:05,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:27:05,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,373 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:27:05,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:27:05,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:27:05,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:27:05,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (1/1) ... [2022-11-19 08:27:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:27:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:05,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:27:05,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:27:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:27:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:27:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:27:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:27:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:27:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:27:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:27:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:27:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:27:05,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:27:05,624 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:27:05,626 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:27:05,926 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:27:06,018 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:27:06,018 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-19 08:27:06,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:27:06 BoogieIcfgContainer [2022-11-19 08:27:06,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:27:06,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:27:06,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:27:06,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:27:06,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:27:04" (1/3) ... [2022-11-19 08:27:06,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a7dca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:27:06, skipping insertion in model container [2022-11-19 08:27:06,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:27:05" (2/3) ... [2022-11-19 08:27:06,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a7dca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:27:06, skipping insertion in model container [2022-11-19 08:27:06,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:27:06" (3/3) ... [2022-11-19 08:27:06,031 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-19 08:27:06,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:27:06,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-19 08:27:06,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:27:06,115 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;@1f36caf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:27:06,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-19 08:27:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.896551724137931) internal successors, (55), 47 states have internal predecessors, (55), 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-19 08:27:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:27:06,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:06,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:27:06,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:06,133 INFO L85 PathProgramCache]: Analyzing trace with hash 181817, now seen corresponding path program 1 times [2022-11-19 08:27:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:06,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031945904] [2022-11-19 08:27:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:06,379 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-19 08:27:06,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:06,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031945904] [2022-11-19 08:27:06,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031945904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:06,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:06,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:27:06,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611060326] [2022-11-19 08:27:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:06,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:27:06,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:27:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:27:06,419 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.896551724137931) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:06,562 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-11-19 08:27:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:27:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:27:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:06,574 INFO L225 Difference]: With dead ends: 95 [2022-11-19 08:27:06,574 INFO L226 Difference]: Without dead ends: 50 [2022-11-19 08:27:06,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:27:06,581 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:06,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:27:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-19 08:27:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-19 08:27:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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-19 08:27:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-19 08:27:06,629 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 3 [2022-11-19 08:27:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:06,629 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-19 08:27:06,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-19 08:27:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-19 08:27:06,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:06,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-19 08:27:06,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:27:06,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 5496013, now seen corresponding path program 1 times [2022-11-19 08:27:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:06,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390198676] [2022-11-19 08:27:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:06,841 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-19 08:27:06,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:06,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390198676] [2022-11-19 08:27:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390198676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:06,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:06,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:27:06,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709795375] [2022-11-19 08:27:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:27:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:27:06,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:27:06,845 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:06,888 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-19 08:27:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:27:06,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-19 08:27:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:06,890 INFO L225 Difference]: With dead ends: 45 [2022-11-19 08:27:06,890 INFO L226 Difference]: Without dead ends: 44 [2022-11-19 08:27:06,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:27:06,892 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:06,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 72 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:27:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-19 08:27:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-19 08:27:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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-19 08:27:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-19 08:27:06,899 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 4 [2022-11-19 08:27:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:06,902 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-19 08:27:06,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-19 08:27:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:27:06,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:06,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:27:06,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:27:06,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:06,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:06,909 INFO L85 PathProgramCache]: Analyzing trace with hash 170376459, now seen corresponding path program 1 times [2022-11-19 08:27:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:06,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581438273] [2022-11-19 08:27:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:07,010 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-19 08:27:07,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:07,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581438273] [2022-11-19 08:27:07,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581438273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:07,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:27:07,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344094754] [2022-11-19 08:27:07,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:07,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:27:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:27:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:27:07,017 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-19 08:27:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:07,080 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-19 08:27:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:27:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 08:27:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:07,082 INFO L225 Difference]: With dead ends: 44 [2022-11-19 08:27:07,083 INFO L226 Difference]: Without dead ends: 43 [2022-11-19 08:27:07,084 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-19 08:27:07,085 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:07,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:27:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-19 08:27:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-19 08:27:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 42 states have internal predecessors, (47), 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-19 08:27:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-19 08:27:07,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2022-11-19 08:27:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-19 08:27:07,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-19 08:27:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-19 08:27:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:27:07,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:07,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:07,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:27:07,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 523025805, now seen corresponding path program 1 times [2022-11-19 08:27:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:07,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310390453] [2022-11-19 08:27:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:07,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:07,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310390453] [2022-11-19 08:27:07,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310390453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:07,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:07,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:27:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363470319] [2022-11-19 08:27:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:07,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:27:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:27:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:27:07,214 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:07,278 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-19 08:27:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:27:07,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 08:27:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:07,281 INFO L225 Difference]: With dead ends: 43 [2022-11-19 08:27:07,282 INFO L226 Difference]: Without dead ends: 41 [2022-11-19 08:27:07,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 08:27:07,287 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:07,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:27:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-19 08:27:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-19 08:27:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 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-19 08:27:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-19 08:27:07,293 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-11-19 08:27:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:07,293 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-19 08:27:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-19 08:27:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:27:07,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:07,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:07,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:27:07,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash -966069163, now seen corresponding path program 1 times [2022-11-19 08:27:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228595963] [2022-11-19 08:27:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:07,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:07,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228595963] [2022-11-19 08:27:07,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228595963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:07,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:07,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:27:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416841284] [2022-11-19 08:27:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:27:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:27:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:27:07,343 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:07,385 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-11-19 08:27:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:27:07,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 08:27:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:07,390 INFO L225 Difference]: With dead ends: 41 [2022-11-19 08:27:07,391 INFO L226 Difference]: Without dead ends: 39 [2022-11-19 08:27:07,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 08:27:07,396 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:07,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:27:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-19 08:27:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-19 08:27:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 38 states have internal predecessors, (43), 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-19 08:27:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-19 08:27:07,411 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 8 [2022-11-19 08:27:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:07,411 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-19 08:27:07,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-19 08:27:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:27:07,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:07,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:07,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:27:07,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash -679527337, now seen corresponding path program 1 times [2022-11-19 08:27:07,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:07,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570561161] [2022-11-19 08:27:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:07,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:07,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570561161] [2022-11-19 08:27:07,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570561161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:07,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:07,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:27:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552766735] [2022-11-19 08:27:07,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:07,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:27:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:07,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:27:07,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:27:07,525 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:07,606 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-11-19 08:27:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:27:07,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 08:27:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:07,610 INFO L225 Difference]: With dead ends: 66 [2022-11-19 08:27:07,610 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 08:27:07,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:27:07,616 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:07,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 40 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:27:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 08:27:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2022-11-19 08:27:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 42 states have internal predecessors, (48), 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-19 08:27:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-19 08:27:07,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2022-11-19 08:27:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:07,637 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-19 08:27:07,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-19 08:27:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:27:07,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:07,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:07,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:27:07,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 409489111, now seen corresponding path program 1 times [2022-11-19 08:27:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:07,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121494691] [2022-11-19 08:27:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:07,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121494691] [2022-11-19 08:27:07,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121494691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:07,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:27:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441676732] [2022-11-19 08:27:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:07,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:27:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:27:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:27:07,720 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 08:27:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:07,777 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-11-19 08:27:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:27:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 08:27:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:07,779 INFO L225 Difference]: With dead ends: 45 [2022-11-19 08:27:07,779 INFO L226 Difference]: Without dead ends: 43 [2022-11-19 08:27:07,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:27:07,780 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:07,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:27:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-19 08:27:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-11-19 08:27:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 40 states have internal predecessors, (46), 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-19 08:27:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-11-19 08:27:07,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2022-11-19 08:27:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:07,788 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-11-19 08:27:07,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 08:27:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-11-19 08:27:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:27:07,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:07,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:07,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:27:07,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1617949353, now seen corresponding path program 1 times [2022-11-19 08:27:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:07,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535793549] [2022-11-19 08:27:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:07,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535793549] [2022-11-19 08:27:07,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535793549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:07,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:07,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:27:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009348095] [2022-11-19 08:27:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:07,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:27:07,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:27:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:27:07,903 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 08:27:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:07,983 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-11-19 08:27:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:27:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:27:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:07,985 INFO L225 Difference]: With dead ends: 50 [2022-11-19 08:27:07,985 INFO L226 Difference]: Without dead ends: 49 [2022-11-19 08:27:07,991 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-19 08:27:07,992 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:07,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 76 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:27:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-19 08:27:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-11-19 08:27:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 42 states have internal predecessors, (49), 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-19 08:27:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-19 08:27:08,006 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 13 [2022-11-19 08:27:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:08,006 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-19 08:27:08,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 08:27:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-19 08:27:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:27:08,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:08,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:08,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:27:08,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1617952775, now seen corresponding path program 1 times [2022-11-19 08:27:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:08,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550359220] [2022-11-19 08:27:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:08,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:08,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:08,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550359220] [2022-11-19 08:27:08,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550359220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:08,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869528506] [2022-11-19 08:27:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:08,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:08,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:27:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:08,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:08,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:08,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:08,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869528506] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1235473139] [2022-11-19 08:27:08,411 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-19 08:27:08,411 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:08,415 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:08,421 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:08,422 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:08,598 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 08:27:08,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 08:27:08,664 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:08,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:08,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:08,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:08,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:08,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:08,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:08,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:08,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:08,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:08,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:08,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:08,951 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:08,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:08,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 08:27:09,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:09,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:09,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:09,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:09,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:09,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:09,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:09,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:09,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:09,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:09,659 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 08:27:09,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:09,776 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 08:27:09,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 08:27:10,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,388 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 08:27:10,388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-19 08:27:10,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,478 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 08:27:10,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-19 08:27:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,534 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 08:27:10,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-19 08:27:10,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,629 INFO L321 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2022-11-19 08:27:10,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 442 treesize of output 398 [2022-11-19 08:27:10,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:10,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,695 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 08:27:10,696 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 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-19 08:27:10,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:10,756 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 08:27:10,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-19 08:27:11,272 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-19 08:27:11,284 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-19 08:27:11,289 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:13,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1235473139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:13,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4, 4] total 12 [2022-11-19 08:27:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788604341] [2022-11-19 08:27:13,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:13,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:27:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:27:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:27:13,359 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-19 08:27:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:13,645 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-11-19 08:27:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:27:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:27:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:13,646 INFO L225 Difference]: With dead ends: 100 [2022-11-19 08:27:13,647 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 08:27:13,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:27:13,651 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 127 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:13,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 69 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:27:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 08:27:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-11-19 08:27:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 46 states have internal predecessors, (52), 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-19 08:27:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-19 08:27:13,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 13 [2022-11-19 08:27:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:13,685 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-19 08:27:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-19 08:27:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-19 08:27:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:27:13,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:13,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:13,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:13,893 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1986936642, now seen corresponding path program 1 times [2022-11-19 08:27:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857188475] [2022-11-19 08:27:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:14,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:14,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857188475] [2022-11-19 08:27:14,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857188475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:14,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88367845] [2022-11-19 08:27:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:14,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:14,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:27:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:14,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:14,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:14,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:27:14,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88367845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:14,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404626104] [2022-11-19 08:27:14,206 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 08:27:14,206 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:14,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:14,207 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:14,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:14,278 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:14,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:14,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:27:14,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:14,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:14,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:14,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:14,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:14,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:14,455 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 08:27:14,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 08:27:14,521 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:14,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:14,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:14,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:14,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:14,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:14,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:14,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:14,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:15,032 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 08:27:15,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 08:27:15,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 08:27:15,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:15,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:15,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:15,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 08:27:15,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:15,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:15,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:15,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:15,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:15,682 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-19 08:27:15,690 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-19 08:27:15,698 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-19 08:27:15,726 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-19 08:27:15,735 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-19 08:27:15,744 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:17,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1404626104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:17,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:17,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2022-11-19 08:27:17,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956057437] [2022-11-19 08:27:17,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:17,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:27:17,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:17,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:27:17,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:27:17,730 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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-19 08:27:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:18,493 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-11-19 08:27:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:27:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:27:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:18,495 INFO L225 Difference]: With dead ends: 67 [2022-11-19 08:27:18,495 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 08:27:18,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:27:18,497 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 82 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:18,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 85 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:27:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 08:27:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2022-11-19 08:27:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.4) internal successors, (56), 49 states have internal predecessors, (56), 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-19 08:27:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-19 08:27:18,525 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 16 [2022-11-19 08:27:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:18,525 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-19 08:27:18,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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-19 08:27:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-19 08:27:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 08:27:18,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:18,531 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:18,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:18,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 08:27:18,738 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -409670297, now seen corresponding path program 1 times [2022-11-19 08:27:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:18,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972177546] [2022-11-19 08:27:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:18,828 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-19 08:27:18,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972177546] [2022-11-19 08:27:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972177546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:18,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83100256] [2022-11-19 08:27:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:18,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:18,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:18,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:27:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:18,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:18,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:18,953 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-19 08:27:18,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:18,976 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-19 08:27:18,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83100256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:18,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1549373418] [2022-11-19 08:27:18,980 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-19 08:27:18,980 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:18,980 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:18,981 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:18,981 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:19,039 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:19,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:19,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:27:19,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:19,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:19,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:19,202 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 08:27:19,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 08:27:19,270 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:19,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:19,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:19,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:19,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-11-19 08:27:19,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-19 08:27:19,783 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 08:27:19,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 08:27:19,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 08:27:19,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 08:27:19,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:19,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:19,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:19,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:20,323 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-19 08:27:20,336 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-19 08:27:20,345 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-19 08:27:20,478 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-19 08:27:20,486 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-19 08:27:20,510 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-19 08:27:20,634 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-19 08:27:20,642 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-19 08:27:20,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 15 treesize of output 1 [2022-11-19 08:27:20,678 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-19 08:27:20,686 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-19 08:27:20,695 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1549373418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:22,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:22,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 14 [2022-11-19 08:27:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032542211] [2022-11-19 08:27:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:22,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 08:27:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 08:27:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:27:22,681 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:23,733 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-11-19 08:27:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:27:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 08:27:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:23,735 INFO L225 Difference]: With dead ends: 61 [2022-11-19 08:27:23,735 INFO L226 Difference]: Without dead ends: 56 [2022-11-19 08:27:23,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-19 08:27:23,736 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:23,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 42 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:27:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-19 08:27:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2022-11-19 08:27:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 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-19 08:27:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-19 08:27:23,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 19 [2022-11-19 08:27:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:23,745 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-19 08:27:23,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-19 08:27:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 08:27:23,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:23,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:23,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-19 08:27:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 08:27:23,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash 791559902, now seen corresponding path program 1 times [2022-11-19 08:27:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:23,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965030797] [2022-11-19 08:27:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:27:24,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965030797] [2022-11-19 08:27:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965030797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022216679] [2022-11-19 08:27:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:24,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:24,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:24,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:24,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:27:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:24,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:24,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:27:24,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:27:24,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022216679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:24,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1381499963] [2022-11-19 08:27:24,222 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-19 08:27:24,222 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:24,223 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:24,223 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:24,223 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:24,267 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 08:27:24,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 08:27:24,309 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:24,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:24,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:24,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:24,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:24,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:24,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:24,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:24,458 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 08:27:24,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 08:27:24,526 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:24,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:24,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:24,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:24,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:24,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:24,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:24,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:24,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:24,948 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 08:27:24,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:25,039 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-19 08:27:25,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-19 08:27:25,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:25,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:25,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:25,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:25,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 08:27:25,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:25,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:25,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:25,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:25,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:25,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:25,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:27:25,484 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-19 08:27:25,491 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-19 08:27:25,624 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-19 08:27:25,633 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-19 08:27:25,643 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-19 08:27:25,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:27:25,789 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-19 08:27:25,799 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-19 08:27:25,886 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-19 08:27:25,894 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-19 08:27:25,896 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:28,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1381499963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:28,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:28,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 18 [2022-11-19 08:27:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121255492] [2022-11-19 08:27:28,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:28,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 08:27:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 08:27:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-19 08:27:28,544 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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-19 08:27:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:30,863 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-11-19 08:27:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 08:27:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-19 08:27:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:30,871 INFO L225 Difference]: With dead ends: 76 [2022-11-19 08:27:30,871 INFO L226 Difference]: Without dead ends: 58 [2022-11-19 08:27:30,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2022-11-19 08:27:30,872 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 133 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:30,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 48 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:27:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-19 08:27:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2022-11-19 08:27:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 45 states have internal predecessors, (51), 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-19 08:27:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-11-19 08:27:30,884 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 25 [2022-11-19 08:27:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:30,884 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-11-19 08:27:30,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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-19 08:27:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-11-19 08:27:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 08:27:30,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:30,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:30,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:31,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 08:27:31,091 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 219437840, now seen corresponding path program 1 times [2022-11-19 08:27:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:31,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153271993] [2022-11-19 08:27:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:27:31,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:31,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153271993] [2022-11-19 08:27:31,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153271993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:31,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346064730] [2022-11-19 08:27:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:31,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:31,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:27:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:31,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:31,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:27:31,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:27:31,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346064730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:31,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1321964487] [2022-11-19 08:27:31,449 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-19 08:27:31,450 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:31,450 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:31,450 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:31,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:31,498 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:31,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:31,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:27:31,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:31,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:31,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:31,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:31,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:31,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:31,671 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:31,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:31,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 08:27:31,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:31,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:31,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:31,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:31,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:31,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:31,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:32,143 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-19 08:27:32,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-19 08:27:32,191 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-19 08:27:32,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:32,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:32,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,607 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 08:27:32,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-19 08:27:32,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,685 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 08:27:32,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-19 08:27:32,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:32,732 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 08:27:32,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-19 08:27:32,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:32,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:32,791 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-19 08:27:32,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-19 08:27:32,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:32,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,856 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 08:27:32,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-19 08:27:32,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:32,908 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 08:27:32,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-19 08:27:33,316 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-19 08:27:33,328 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-19 08:27:33,336 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-19 08:27:33,464 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-19 08:27:33,473 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-19 08:27:33,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:27:33,614 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-19 08:27:33,623 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-19 08:27:33,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 15 treesize of output 1 [2022-11-19 08:27:33,760 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-19 08:27:33,774 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-19 08:27:33,782 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:36,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1321964487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:36,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:36,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 18 [2022-11-19 08:27:36,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789231650] [2022-11-19 08:27:36,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:36,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 08:27:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 08:27:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-19 08:27:36,480 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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-19 08:27:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:38,813 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-19 08:27:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 08:27:38,813 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-19 08:27:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:38,814 INFO L225 Difference]: With dead ends: 58 [2022-11-19 08:27:38,814 INFO L226 Difference]: Without dead ends: 56 [2022-11-19 08:27:38,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2022-11-19 08:27:38,815 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 98 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:38,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 41 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:27:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-19 08:27:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2022-11-19 08:27:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 46 states have internal predecessors, (53), 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-19 08:27:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-19 08:27:38,830 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 34 [2022-11-19 08:27:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:38,830 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-19 08:27:38,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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-19 08:27:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-19 08:27:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:27:38,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:38,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:38,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:39,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 08:27:39,042 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1787300487, now seen corresponding path program 1 times [2022-11-19 08:27:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:39,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407663825] [2022-11-19 08:27:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 08:27:39,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407663825] [2022-11-19 08:27:39,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407663825] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:39,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245714205] [2022-11-19 08:27:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:39,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:39,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:27:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:39,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:39,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 08:27:39,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 08:27:39,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245714205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828545030] [2022-11-19 08:27:39,328 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:27:39,328 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:39,329 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:39,329 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:39,329 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:39,375 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 08:27:39,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 08:27:39,410 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:39,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:39,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:39,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:39,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 08:27:39,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:39,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 08:27:39,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:39,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:39,580 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:39,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:39,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 08:27:39,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:39,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:39,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:39,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:39,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:39,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:40,023 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-19 08:27:40,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-19 08:27:40,075 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-19 08:27:40,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:40,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:40,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,476 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 08:27:40,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 353 [2022-11-19 08:27:40,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,537 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 08:27:40,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 417 treesize of output 356 [2022-11-19 08:27:40,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:40,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:40,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,576 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 08:27:40,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 391 [2022-11-19 08:27:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:40,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:40,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,645 INFO L321 Elim1Store]: treesize reduction 86, result has 19.6 percent of original size [2022-11-19 08:27:40,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 442 treesize of output 398 [2022-11-19 08:27:40,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:40,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,699 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 08:27:40,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 427 treesize of output 416 [2022-11-19 08:27:40,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:40,744 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 08:27:40,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 429 treesize of output 419 [2022-11-19 08:27:41,183 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-19 08:27:41,190 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-19 08:27:41,198 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-19 08:27:41,354 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-19 08:27:41,363 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-19 08:27:41,371 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-19 08:27:41,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:27:41,562 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-19 08:27:41,568 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-19 08:27:41,869 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 08:27:41,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 08:27:41,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-19 08:27:41,940 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1828545030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:45,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:45,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 20 [2022-11-19 08:27:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541557048] [2022-11-19 08:27:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:45,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:27:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:27:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-19 08:27:45,303 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-19 08:27:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:46,310 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-11-19 08:27:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 08:27:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-19 08:27:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:46,311 INFO L225 Difference]: With dead ends: 67 [2022-11-19 08:27:46,311 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 08:27:46,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-11-19 08:27:46,312 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:46,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 57 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 20 Unchecked, 0.4s Time] [2022-11-19 08:27:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 08:27:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2022-11-19 08:27:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 51 states have internal predecessors, (58), 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-19 08:27:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-11-19 08:27:46,326 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 35 [2022-11-19 08:27:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:46,327 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-11-19 08:27:46,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-19 08:27:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-11-19 08:27:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 08:27:46,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:46,328 INFO L195 NwaCegarLoop]: trace histogram [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-19 08:27:46,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-19 08:27:46,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 08:27:46,534 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1042935429, now seen corresponding path program 1 times [2022-11-19 08:27:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:46,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036031321] [2022-11-19 08:27:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 08:27:46,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:46,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036031321] [2022-11-19 08:27:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036031321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947495476] [2022-11-19 08:27:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:46,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:46,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:27:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:46,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:46,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 08:27:46,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 08:27:46,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947495476] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:46,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1417243362] [2022-11-19 08:27:46,842 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-19 08:27:46,843 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:46,843 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:46,843 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:46,844 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:46,910 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:46,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:46,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:27:46,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:46,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:46,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:46,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:46,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:46,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:46,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:46,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:46,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:46,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:47,048 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 08:27:47,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 08:27:47,105 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:47,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:47,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:47,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:47,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:47,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:47,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:47,455 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 08:27:47,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:47,544 INFO L321 Elim1Store]: treesize reduction 196, result has 10.5 percent of original size [2022-11-19 08:27:47,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 406 [2022-11-19 08:27:47,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:47,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2022-11-19 08:27:47,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:47,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:47,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:47,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:47,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:47,995 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-19 08:27:48,004 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-19 08:27:48,012 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-19 08:27:48,135 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-19 08:27:48,143 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-19 08:27:48,152 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-19 08:27:48,319 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-19 08:27:48,325 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-19 08:27:48,335 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-19 08:27:49,198 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 08:27:49,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:49,287 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 08:27:49,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 08:27:49,549 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:27:52,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1417243362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:52,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:27:52,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 20 [2022-11-19 08:27:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574414910] [2022-11-19 08:27:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:52,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:27:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:52,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:27:52,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-19 08:27:52,990 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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-19 08:27:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:54,684 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-11-19 08:27:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 08:27:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-19 08:27:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:54,686 INFO L225 Difference]: With dead ends: 53 [2022-11-19 08:27:54,686 INFO L226 Difference]: Without dead ends: 49 [2022-11-19 08:27:54,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2022-11-19 08:27:54,687 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:54,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 23 Unchecked, 0.3s Time] [2022-11-19 08:27:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-19 08:27:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-11-19 08:27:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-19 08:27:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-11-19 08:27:54,699 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2022-11-19 08:27:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:54,700 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-11-19 08:27:54,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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-19 08:27:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-11-19 08:27:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-19 08:27:54,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:54,701 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] [2022-11-19 08:27:54,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:27:54,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:54,902 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:27:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1531674134, now seen corresponding path program 1 times [2022-11-19 08:27:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:54,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040887054] [2022-11-19 08:27:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:27:55,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:55,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040887054] [2022-11-19 08:27:55,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040887054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:27:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687797031] [2022-11-19 08:27:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:55,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:27:55,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:27:55,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:27:55,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:27:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:55,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:27:55,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:27:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:27:55,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:27:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:27:55,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687797031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:27:55,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1696784618] [2022-11-19 08:27:55,221 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-19 08:27:55,221 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:27:55,221 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:27:55,222 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:27:55,222 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:27:55,266 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 08:27:55,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-19 08:27:55,309 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 08:27:55,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-19 08:27:55,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:55,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-19 08:27:55,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-19 08:27:55,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:55,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-19 08:27:55,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:55,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-19 08:27:55,474 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-19 08:27:55,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 38 [2022-11-19 08:27:55,538 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 08:27:55,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 08:27:55,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:55,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2022-11-19 08:27:55,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:55,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-11-19 08:27:55,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:55,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:55,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2022-11-19 08:27:55,881 INFO L321 Elim1Store]: treesize reduction 132, result has 17.0 percent of original size [2022-11-19 08:27:55,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:55,961 INFO L321 Elim1Store]: treesize reduction 188, result has 14.2 percent of original size [2022-11-19 08:27:55,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 414 [2022-11-19 08:27:56,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,344 INFO L321 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-11-19 08:27:56,345 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 387 treesize of output 325 [2022-11-19 08:27:56,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,406 INFO L321 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2022-11-19 08:27:56,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 389 treesize of output 328 [2022-11-19 08:27:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,446 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-19 08:27:56,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 398 treesize of output 379 [2022-11-19 08:27:56,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,508 INFO L321 Elim1Store]: treesize reduction 102, result has 21.5 percent of original size [2022-11-19 08:27:56,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 414 treesize of output 386 [2022-11-19 08:27:56,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:27:56,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,557 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-11-19 08:27:56,557 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 3 case distinctions, treesize of input 399 treesize of output 388 [2022-11-19 08:27:56,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:27:56,616 INFO L321 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-11-19 08:27:56,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 401 treesize of output 391 [2022-11-19 08:27:57,043 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-19 08:27:57,069 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-19 08:27:57,078 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-19 08:27:57,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 11 treesize of output 7 [2022-11-19 08:27:57,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:27:57,231 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-19 08:27:58,030 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-19 08:27:58,038 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-19 08:27:58,046 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-19 08:27:58,187 INFO L321 Elim1Store]: treesize reduction 180, result has 17.8 percent of original size [2022-11-19 08:27:58,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 406 treesize of output 422 [2022-11-19 08:27:58,229 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-11-19 08:27:58,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 401 treesize of output 406 [2022-11-19 08:27:58,499 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:28:01,952 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3559#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 3) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (< (+ 2147483647 |ULTIMATE.start_main_#t~post14#1|) 0) (= |#NULL.base| 0))' at error location [2022-11-19 08:28:01,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:28:01,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:28:01,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-19 08:28:01,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016379801] [2022-11-19 08:28:01,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:28:01,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:28:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:28:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-11-19 08:28:01,955 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-19 08:28:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:02,044 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-11-19 08:28:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:28:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-19 08:28:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:02,047 INFO L225 Difference]: With dead ends: 90 [2022-11-19 08:28:02,047 INFO L226 Difference]: Without dead ends: 50 [2022-11-19 08:28:02,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-11-19 08:28:02,052 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:02,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-19 08:28:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-19 08:28:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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-19 08:28:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-19 08:28:02,072 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 43 [2022-11-19 08:28:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:02,073 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-19 08:28:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-19 08:28:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-19 08:28:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-19 08:28:02,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:02,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-11-19 08:28:02,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:02,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 08:28:02,283 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-11-19 08:28:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1424594238, now seen corresponding path program 2 times [2022-11-19 08:28:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:02,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006536290] [2022-11-19 08:28:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:28:02,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:02,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006536290] [2022-11-19 08:28:02,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006536290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:02,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:02,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:28:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600994172] [2022-11-19 08:28:02,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:02,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:28:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:02,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:28:02,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:28:02,484 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-19 08:28:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:02,565 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-11-19 08:28:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:28:02,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-19 08:28:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:02,566 INFO L225 Difference]: With dead ends: 58 [2022-11-19 08:28:02,566 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 08:28:02,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:28:02,567 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:02,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:28:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 08:28:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 08:28:02,569 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-19 08:28:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 08:28:02,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-11-19 08:28:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:02,569 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 08:28:02,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-19 08:28:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 08:28:02,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 08:28:02,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-11-19 08:28:02,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-11-19 08:28:02,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-11-19 08:28:02,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-11-19 08:28:02,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-11-19 08:28:02,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-11-19 08:28:02,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-11-19 08:28:02,574 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-11-19 08:28:02,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-11-19 08:28:02,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-11-19 08:28:02,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-11-19 08:28:02,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-11-19 08:28:02,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-11-19 08:28:02,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-11-19 08:28:02,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-11-19 08:28:02,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-11-19 08:28:02,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-11-19 08:28:02,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-11-19 08:28:02,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 08:28:02,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 08:28:06,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,419 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-19 08:28:06,420 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-19 08:28:06,420 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,420 INFO L899 garLoopResultBuilder]: For program point L622-4(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,420 INFO L899 garLoopResultBuilder]: For program point L622-5(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,420 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-19 08:28:06,420 INFO L895 garLoopResultBuilder]: At program point L622-6(lines 622 627) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |#NULL.offset| 0))) (or (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse0 .cse1 .cse2))) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 08:28:06,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-19 08:28:06,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 08:28:06,421 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-19 08:28:06,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,421 INFO L899 garLoopResultBuilder]: For program point L623(line 623) no Hoare annotation was computed. [2022-11-19 08:28:06,421 INFO L899 garLoopResultBuilder]: For program point L623-1(line 623) no Hoare annotation was computed. [2022-11-19 08:28:06,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2022-11-19 08:28:06,422 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (or (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= 0 (+ |ULTIMATE.start_sll_update_at_~index#1| 1)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_update_at_#in~index#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 2 |ULTIMATE.start_sll_update_at_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 2 |ULTIMATE.start_sll_update_at_#in~data#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1) (<= 2 |ULTIMATE.start_main_~new_data~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 08:28:06,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,423 INFO L895 garLoopResultBuilder]: At program point L624(lines 624 626) the Hoare annotation is: (let ((.cse6 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret15#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_#t~ret15#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_#t~ret15#1| 2147483647) (<= |ULTIMATE.start_sll_create_~data#1| 1) (let ((.cse0 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse1 (= .cse6 |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (let ((.cse3 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) (.cse2 (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (and .cse0 .cse1 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse2)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| .cse3) (< 0 .cse3) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse2) |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse4 .cse5)) (and (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse0 .cse1 .cse4 .cse5 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|)))) (<= 2 .cse6) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (let ((.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |#NULL.offset| 0)) (.cse10 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse7 .cse8 .cse9 .cse10) (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse7 .cse8 .cse9 .cse10))) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (not (< 0 |ULTIMATE.start_sll_get_data_at_~index#1|)) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) [2022-11-19 08:28:06,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,423 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (and (or (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse7 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse13 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse14 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse15 (<= 0 |ULTIMATE.start_sll_create_~len#1|)) (.cse16 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse19 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse20 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse21 (<= 0 |#StackHeapBarrier|)) (.cse22 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse23 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse25 (= |#NULL.base| 0))) (or (let ((.cse9 (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) (.cse6 (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse6)) .cse7 .cse8 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| .cse9) (< 0 .cse9) .cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) .cse6) |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)) (and .cse0 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse19 .cse20 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse21 .cse22 .cse23 .cse24 .cse25)))) [2022-11-19 08:28:06,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,424 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-11-19 08:28:06,424 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (and (let ((.cse0 (<= 1 |ULTIMATE.start_node_create_~data#1|))) (or (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 1)) (and .cse0 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~len#1|) (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_node_create_~data#1| 1) (let ((.cse13 (select |#memory_int| 1))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= (select |#valid| 1) 1)) (.cse5 (= (select |#valid| 0) 0)) (.cse6 (= (select |#valid| 2) 1)) (.cse7 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse8 (= (select .cse13 0) 48)) (.cse9 (= 27 (select |#length| 2))) (.cse10 (= (select .cse13 1) 0)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse1 .cse2 (= |ULTIMATE.start_sll_create_~len#1| |ULTIMATE.start_sll_create_#in~len#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (and .cse1 .cse2 (= |ULTIMATE.start_sll_create_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0)) .cse3 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) .cse10 (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|) .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12) 0)))))) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 08:28:06,424 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-11-19 08:28:06,425 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-19 08:28:06,425 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-11-19 08:28:06,425 INFO L899 garLoopResultBuilder]: For program point L618-1(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,425 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2022-11-19 08:28:06,425 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2022-11-19 08:28:06,425 INFO L899 garLoopResultBuilder]: For program point L618-5(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,426 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse4 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse6 (let ((.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |#NULL.offset| 0)) (.cse13 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse10 .cse11 .cse12 .cse13) (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse10 .cse11 .cse12 .cse13)))) (.cse7 (<= 0 |#StackHeapBarrier|)) (.cse8 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse9 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9) (and (<= 1 |ULTIMATE.start_node_create_~data#1|) .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_node_create_#in~data#1|) (<= |ULTIMATE.start_node_create_#in~data#1| 1) .cse4 (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) .cse5 (<= 0 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse6 (<= |ULTIMATE.start_node_create_~data#1| 1) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_create_~len#1| 2)))) [2022-11-19 08:28:06,426 INFO L899 garLoopResultBuilder]: For program point L618-6(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,426 INFO L895 garLoopResultBuilder]: At program point L618-7(lines 618 621) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |#NULL.offset| 0))) (or (and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse0 .cse1 .cse2))) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0)) [2022-11-19 08:28:06,426 INFO L899 garLoopResultBuilder]: For program point L618-8(lines 618 621) no Hoare annotation was computed. [2022-11-19 08:28:06,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-19 08:28:06,427 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-19 08:28:06,427 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-19 08:28:06,427 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-19 08:28:06,427 INFO L899 garLoopResultBuilder]: For program point L619(line 619) no Hoare annotation was computed. [2022-11-19 08:28:06,427 INFO L899 garLoopResultBuilder]: For program point L619-1(line 619) no Hoare annotation was computed. [2022-11-19 08:28:06,427 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 08:28:06,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 619) no Hoare annotation was computed. [2022-11-19 08:28:06,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 623) no Hoare annotation was computed. [2022-11-19 08:28:06,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2022-11-19 08:28:06,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-19 08:28:06,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-11-19 08:28:06,431 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:06,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:28:06,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,453 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,456 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:28:06 BoogieIcfgContainer [2022-11-19 08:28:06,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:28:06,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:28:06,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:28:06,480 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:28:06,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:27:06" (3/4) ... [2022-11-19 08:28:06,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 08:28:06,494 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-19 08:28:06,494 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-19 08:28:06,495 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 08:28:06,495 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 08:28:06,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && len == len) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) || (((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && temp <= 0) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) [2022-11-19 08:28:06,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((1 <= data && 0 <= new_head) && new_head <= 0) && len <= 1) || ((1 <= data && 0 <= head) && head <= 0)) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= \old(data)) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && data == \old(data)) && data <= 1) && ((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 [2022-11-19 08:28:06,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-19 08:28:06,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-19 08:28:06,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((temp == 0 || head == 0) && 0 <= index + 1) && s == \result) && \old(data) <= 3) && head == \result) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && len <= 0) && 2 <= data) && 1 <= data) && data <= 3) && 0 <= i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && 2 <= \old(data)) && \result == s) && \old(index) <= 1) && 2 <= new_data) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 [2022-11-19 08:28:06,522 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((temp == 0 || head == 0) && s == \result) && head == \result) && ((((((((((((((((((((((((((((0 <= s && \old(index) == i) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && len <= 0) && \result <= 0) && \old(index) == index + 1) && 0 < index + 1) && 1 <= data) && #memory_$Pointer$[head][head + 4] == head) && data == 1) && data <= 1) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && head == s) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0) || (((((((((((((((((((((((((((0 <= s && head == head) && \old(index) == i) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && len <= 0) && \result <= 0) && 1 <= data) && 0 <= i) && data == 1) && data <= 1) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && head == s) && \old(index) == index) && 0 <= \result) && i <= 1) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0)) [2022-11-19 08:28:06,523 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s == \result && unknown-#memory_int-unknown[head][head] == \result) && head == \result) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && 1 <= data) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && data <= 1) && ((((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && 0 < index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && head == s) || ((((((head == head && \old(index) == i) && len + i == expected) && head == s) && head == s) && \old(index) == index) && head == head))) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && \result == head) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && \result == s) && !(0 < index)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head [2022-11-19 08:28:06,539 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 08:28:06,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:28:06,540 INFO L158 Benchmark]: Toolchain (without parser) took 61869.77ms. Allocated memory was 125.8MB in the beginning and 343.9MB in the end (delta: 218.1MB). Free memory was 90.5MB in the beginning and 301.5MB in the end (delta: -211.0MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,540 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:28:06,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.66ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 94.6MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.27ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,540 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 125.8MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,541 INFO L158 Benchmark]: RCFGBuilder took 643.78ms. Allocated memory is still 125.8MB. Free memory was 90.4MB in the beginning and 70.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,541 INFO L158 Benchmark]: TraceAbstraction took 60456.01ms. Allocated memory was 125.8MB in the beginning and 343.9MB in the end (delta: 218.1MB). Free memory was 70.1MB in the beginning and 304.7MB in the end (delta: -234.6MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,541 INFO L158 Benchmark]: Witness Printer took 59.30ms. Allocated memory is still 343.9MB. Free memory was 304.7MB in the beginning and 301.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:28:06,542 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.26ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.66ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 94.6MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.27ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 125.8MB. Free memory was 92.5MB in the beginning and 90.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 643.78ms. Allocated memory is still 125.8MB. Free memory was 90.4MB in the beginning and 70.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 60456.01ms. Allocated memory was 125.8MB in the beginning and 343.9MB in the end (delta: 218.1MB). Free memory was 70.1MB in the beginning and 304.7MB in the end (delta: -234.6MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB. * Witness Printer took 59.30ms. Allocated memory is still 343.9MB. Free memory was 304.7MB in the beginning and 301.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: 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: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 623]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 60.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1039 mSDsluCounter, 923 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 43 IncrementalHoareTripleChecker+Unchecked, 600 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1607 IncrementalHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 323 mSDtfsCounter, 1607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 492 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=14, InterpolantAutomatonStates: 144, 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, 17 MinimizatonAttempts, 121 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 31 NumberOfFragments, 1043 HoareAnnotationTreeSize, 10 FomulaSimplifications, 185 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 10 FomulaSimplificationsInter, 52874 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1772 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 225/249 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: 15.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 148, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 404, TOOLS_POST_TIME: 14.0s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 404, TOOLS_QUANTIFIERELIM_TIME: 13.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 698, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 47, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 19, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 54, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 148, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 10.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 10.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 54, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 3220, DAG_COMPRESSION_RETAINED_NODES: 493, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && len == len) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) || (((((((((((((((((1 <= data && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && 1 <= \old(data)) && \old(data) <= 1) && data <= 1) && 0 <= temp) && \old(len) <= 2) && 0 <= len) && temp <= 0) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) - InvariantResult [Line: 576]: Loop Invariant [2022-11-19 08:28:06,554 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,554 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,556 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,556 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((1 <= data && 0 <= new_head) && new_head <= 0) && len <= 1) || ((1 <= data && 0 <= head) && head <= 0)) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= \old(data)) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && data == \old(data)) && data <= 1) && ((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && len == \old(len)) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((\valid[temp] == 1 && 8 == unknown-#length-unknown[temp]) && data == unknown-#memory_int-unknown[new_head][0]) && 2 == unknown-#length-unknown[1]) && !(temp == new_head)) && head == new_head) && unknown-#length-unknown[new_head] == 8) && #memory_$Pointer$[new_head][4 + new_head] == 0) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && temp < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[1][1] == 0) && new_head < unknown-#StackHeapBarrier-unknown) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[new_head][4 + new_head] == 0))) && 2 <= \old(len)) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 600]: Loop Invariant [2022-11-19 08:28:06,559 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,559 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,561 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,561 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((temp == 0 || head == 0) && s == \result) && head == \result) && ((((((((((((((((((((((((((((0 <= s && \old(index) == i) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && len <= 0) && \result <= 0) && \old(index) == index + 1) && 0 < index + 1) && 1 <= data) && #memory_$Pointer$[head][head + 4] == head) && data == 1) && data <= 1) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && head == s) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0) || (((((((((((((((((((((((((((0 <= s && head == head) && \old(index) == i) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && len + i == expected) && len <= 0) && \result <= 0) && 1 <= data) && 0 <= i) && data == 1) && data <= 1) && \old(len) <= 2) && head == s) && 0 <= len) && len == 2) && #NULL == 0) && head == s) && \old(index) == index) && 0 <= \result) && i <= 1) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0)) - InvariantResult [Line: 624]: Loop Invariant [2022-11-19 08:28:06,563 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,563 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 08:28:06,565 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 08:28:06,565 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((s == \result && unknown-#memory_int-unknown[head][head] == \result) && head == \result) && \result == aux-sll_get_data_at(s, i)-aux) && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 0 <= aux-sll_get_data_at(s, i)-aux + 2147483648) && len <= 0) && 1 <= data) && aux-sll_get_data_at(s, i)-aux <= 2147483647) && data <= 1) && ((((((((\old(index) == i && len + i == expected) && head == #memory_$Pointer$[head][head + 4]) && \old(index) == index + 1) && 0 < index + 1) && #memory_$Pointer$[head][head + 4] == head) && head == s) && head == s) || ((((((head == head && \old(index) == i) && len + i == expected) && head == s) && head == s) && \old(index) == index) && head == head))) && 2 <= len + i) && \old(len) <= 2) && 0 <= len) && \result == head) && (((((head == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0) || ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) && #NULL == 0))) && \result == s) && !(0 < index)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((temp == 0 || head == 0) && 0 <= index + 1) && s == \result) && \old(data) <= 3) && head == \result) && 0 <= head) && 1 <= \old(data)) && 0 <= \old(index)) && \old(data) <= 1) && len <= 0) && 2 <= data) && 1 <= data) && data <= 3) && 0 <= i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && 0 <= len) && len == 2) && \result == head) && #NULL == 0) && 2 <= \old(data)) && \result == s) && \old(index) <= 1) && 2 <= new_data) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((((((((s == \result && head == \result) && 1 <= \old(data)) && \old(data) <= 1) && ((((temp == 0 && data == 1) && len == 2) && #NULL == 0) || (((head == 0 && data == 1) && len == 2) && #NULL == 0))) && 0 <= i + 2147483648) && len <= 0) && 1 <= data) && data <= 1) && \old(len) <= 2) && 0 <= len) && \result == head) && \result == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2022-11-19 08:28:06,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70305372-2c8c-48fb-8ab1-b34d3464a774/bin/utaipan-I9t0OCRTmS/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