./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/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 d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- 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 07:03:31,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:03:31,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:03:31,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:03:31,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:03:31,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:03:31,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:03:31,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:03:31,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:03:31,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:03:31,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:03:31,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:03:31,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:03:31,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:03:31,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:03:31,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:03:31,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:03:31,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:03:31,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:03:31,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:03:31,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:03:31,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:03:31,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:03:31,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:03:31,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:03:31,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:03:31,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:03:31,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:03:31,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:03:31,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:03:31,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:03:31,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:03:31,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:03:31,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:03:31,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:03:31,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:03:31,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:03:31,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:03:31,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:03:31,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:03:31,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:03:31,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 07:03:31,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:03:31,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:03:31,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:03:31,534 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:03:31,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:03:31,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:03:31,535 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:03:31,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:03:31,536 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:03:31,536 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:03:31,536 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:03:31,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:03:31,537 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:03:31,537 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:03:31,537 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:03:31,538 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:03:31,538 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:03:31,538 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:03:31,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:03:31,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:03:31,539 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:03:31,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:03:31,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:03:31,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:03:31,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:03:31,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:03:31,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:03:31,541 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:03:31,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:03:31,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:03:31,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:03:31,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:03:31,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:03:31,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:03:31,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:03:31,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:03:31,544 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:03:31,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:03:31,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:03:31,544 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:03:31,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:03:31,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:03:31,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:03:31,545 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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/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 -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2022-11-19 07:03:31,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:03:31,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:03:31,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:03:31,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:03:31,900 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:03:31,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-19 07:03:31,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/data/9bf6d5429/652d65de010f43d79341de87c87c504f/FLAGb3f28fef7 [2022-11-19 07:03:32,555 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:03:32,556 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-19 07:03:32,572 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/data/9bf6d5429/652d65de010f43d79341de87c87c504f/FLAGb3f28fef7 [2022-11-19 07:03:32,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/data/9bf6d5429/652d65de010f43d79341de87c87c504f [2022-11-19 07:03:32,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:03:32,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:03:32,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:03:32,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:03:32,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:03:32,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:32" (1/1) ... [2022-11-19 07:03:32,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6751b6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:32, skipping insertion in model container [2022-11-19 07:03:32,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:32" (1/1) ... [2022-11-19 07:03:32,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:03:32,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:03:33,215 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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-11-19 07:03:33,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:03:33,241 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:03:33,272 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_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-11-19 07:03:33,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:03:33,316 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:03:33,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33 WrapperNode [2022-11-19 07:03:33,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:03:33,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:03:33,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:03:33,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:03:33,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,392 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 281 [2022-11-19 07:03:33,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:03:33,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:03:33,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:03:33,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:03:33,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:03:33,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:03:33,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:03:33,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:03:33,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (1/1) ... [2022-11-19 07:03:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:03:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:03:33,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:03:33,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:03:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:03:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:03:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:03:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:03:33,715 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:03:33,718 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:03:34,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:03:34,236 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:03:34,236 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:03:34,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:34 BoogieIcfgContainer [2022-11-19 07:03:34,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:03:34,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:03:34,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:03:34,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:03:34,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:03:32" (1/3) ... [2022-11-19 07:03:34,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de44541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:34, skipping insertion in model container [2022-11-19 07:03:34,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:33" (2/3) ... [2022-11-19 07:03:34,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de44541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:34, skipping insertion in model container [2022-11-19 07:03:34,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:34" (3/3) ... [2022-11-19 07:03:34,249 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-19 07:03:34,270 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:03:34,270 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-19 07:03:34,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:03:34,361 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;@1a2c1503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:03:34,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-19 07:03:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 72 states have internal predecessors, (103), 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 07:03:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:03:34,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:34,375 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] [2022-11-19 07:03:34,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1190146159, now seen corresponding path program 1 times [2022-11-19 07:03:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:34,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705758674] [2022-11-19 07:03:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:34,648 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 07:03:34,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:34,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705758674] [2022-11-19 07:03:34,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705758674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:34,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:34,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:03:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088136888] [2022-11-19 07:03:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:34,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:03:34,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:34,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:03:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:03:34,705 INFO L87 Difference]: Start difference. First operand has 73 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 72 states have internal predecessors, (103), 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 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 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 07:03:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:34,773 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2022-11-19 07:03:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:03:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2022-11-19 07:03:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:34,786 INFO L225 Difference]: With dead ends: 75 [2022-11-19 07:03:34,786 INFO L226 Difference]: Without dead ends: 69 [2022-11-19 07:03:34,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:03:34,793 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:34,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:03:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-19 07:03:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-19 07:03:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 68 states have internal predecessors, (82), 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 07:03:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-19 07:03:34,847 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 21 [2022-11-19 07:03:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:34,848 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-19 07:03:34,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 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 07:03:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-19 07:03:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:03:34,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:34,852 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, 1, 1, 1] [2022-11-19 07:03:34,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:03:34,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1628803833, now seen corresponding path program 1 times [2022-11-19 07:03:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:34,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546454894] [2022-11-19 07:03:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:35,044 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 07:03:35,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:35,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546454894] [2022-11-19 07:03:35,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546454894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:35,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:35,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714622416] [2022-11-19 07:03:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:35,052 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 07:03:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:35,156 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-11-19 07:03:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:35,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-11-19 07:03:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:35,161 INFO L225 Difference]: With dead ends: 165 [2022-11-19 07:03:35,161 INFO L226 Difference]: Without dead ends: 114 [2022-11-19 07:03:35,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:35,166 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 59 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:35,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 181 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-19 07:03:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-19 07:03:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 101 states have internal predecessors, (137), 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 07:03:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-11-19 07:03:35,218 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 28 [2022-11-19 07:03:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:35,220 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-11-19 07:03:35,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 07:03:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-11-19 07:03:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 07:03:35,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:35,225 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, 1, 1, 1, 1] [2022-11-19 07:03:35,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:03:35,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1333674629, now seen corresponding path program 1 times [2022-11-19 07:03:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:35,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381698220] [2022-11-19 07:03:35,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:35,374 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 07:03:35,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:35,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381698220] [2022-11-19 07:03:35,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381698220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:35,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:35,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031293372] [2022-11-19 07:03:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:35,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:35,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:35,377 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 07:03:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:35,483 INFO L93 Difference]: Finished difference Result 262 states and 363 transitions. [2022-11-19 07:03:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 29 [2022-11-19 07:03:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:35,486 INFO L225 Difference]: With dead ends: 262 [2022-11-19 07:03:35,488 INFO L226 Difference]: Without dead ends: 178 [2022-11-19 07:03:35,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:35,491 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 56 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:35,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-19 07:03:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-11-19 07:03:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.5714285714285714) internal successors, (242), 165 states have internal predecessors, (242), 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 07:03:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2022-11-19 07:03:35,527 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 29 [2022-11-19 07:03:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:35,528 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2022-11-19 07:03:35,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 07:03:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2022-11-19 07:03:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 07:03:35,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:35,531 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:35,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:03:35,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2007586470, now seen corresponding path program 1 times [2022-11-19 07:03:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479007859] [2022-11-19 07:03:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:35,663 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 07:03:35,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:35,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479007859] [2022-11-19 07:03:35,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479007859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:35,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:35,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261546858] [2022-11-19 07:03:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:35,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:35,666 INFO L87 Difference]: Start difference. First operand 166 states and 242 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 07:03:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:35,757 INFO L93 Difference]: Finished difference Result 446 states and 666 transitions. [2022-11-19 07:03:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:35,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-11-19 07:03:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:35,762 INFO L225 Difference]: With dead ends: 446 [2022-11-19 07:03:35,762 INFO L226 Difference]: Without dead ends: 298 [2022-11-19 07:03:35,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:35,774 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:35,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:03:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-19 07:03:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2022-11-19 07:03:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 274 states have (on average 1.5985401459854014) internal successors, (438), 285 states have internal predecessors, (438), 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 07:03:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2022-11-19 07:03:35,835 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 32 [2022-11-19 07:03:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:35,836 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2022-11-19 07:03:35,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 07:03:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2022-11-19 07:03:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:03:35,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:35,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:35,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:03:35,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 62503230, now seen corresponding path program 1 times [2022-11-19 07:03:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:35,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603310709] [2022-11-19 07:03:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:35,948 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 07:03:35,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:35,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603310709] [2022-11-19 07:03:35,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603310709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:35,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:35,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877067973] [2022-11-19 07:03:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:35,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:03:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:03:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:03:35,951 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 07:03:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:36,143 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-11-19 07:03:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:03:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 07:03:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:36,146 INFO L225 Difference]: With dead ends: 529 [2022-11-19 07:03:36,147 INFO L226 Difference]: Without dead ends: 526 [2022-11-19 07:03:36,147 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 07:03:36,148 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 176 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:36,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 154 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-19 07:03:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 364. [2022-11-19 07:03:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 352 states have (on average 1.5880681818181819) internal successors, (559), 363 states have internal predecessors, (559), 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 07:03:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 559 transitions. [2022-11-19 07:03:36,191 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 559 transitions. Word has length 35 [2022-11-19 07:03:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:36,191 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 559 transitions. [2022-11-19 07:03:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 07:03:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 559 transitions. [2022-11-19 07:03:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 07:03:36,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:36,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:36,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:03:36,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1937600266, now seen corresponding path program 1 times [2022-11-19 07:03:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:36,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051789258] [2022-11-19 07:03:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:36,264 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 07:03:36,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:36,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051789258] [2022-11-19 07:03:36,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051789258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:36,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:36,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386976491] [2022-11-19 07:03:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:36,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:03:36,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:36,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:03:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:03:36,267 INFO L87 Difference]: Start difference. First operand 364 states and 559 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 07:03:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:36,428 INFO L93 Difference]: Finished difference Result 513 states and 787 transitions. [2022-11-19 07:03:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:03:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-19 07:03:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:36,431 INFO L225 Difference]: With dead ends: 513 [2022-11-19 07:03:36,431 INFO L226 Difference]: Without dead ends: 510 [2022-11-19 07:03:36,432 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 07:03:36,432 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 168 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:36,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-19 07:03:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 496. [2022-11-19 07:03:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 484 states have (on average 1.572314049586777) internal successors, (761), 495 states have internal predecessors, (761), 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 07:03:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 761 transitions. [2022-11-19 07:03:36,490 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 761 transitions. Word has length 36 [2022-11-19 07:03:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:36,490 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 761 transitions. [2022-11-19 07:03:36,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 07:03:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 761 transitions. [2022-11-19 07:03:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 07:03:36,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:36,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:36,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:03:36,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash -63933760, now seen corresponding path program 1 times [2022-11-19 07:03:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:36,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352928263] [2022-11-19 07:03:36,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:36,586 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 07:03:36,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:36,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352928263] [2022-11-19 07:03:36,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352928263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:36,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:36,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:03:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317674891] [2022-11-19 07:03:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:36,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:36,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:36,588 INFO L87 Difference]: Start difference. First operand 496 states and 761 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 07:03:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:37,065 INFO L93 Difference]: Finished difference Result 1292 states and 1942 transitions. [2022-11-19 07:03:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:03:37,066 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 37 [2022-11-19 07:03:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:37,070 INFO L225 Difference]: With dead ends: 1292 [2022-11-19 07:03:37,070 INFO L226 Difference]: Without dead ends: 822 [2022-11-19 07:03:37,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:03:37,072 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 309 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:37,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 359 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:03:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-19 07:03:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 766. [2022-11-19 07:03:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 754 states have (on average 1.530503978779841) internal successors, (1154), 765 states have internal predecessors, (1154), 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 07:03:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1154 transitions. [2022-11-19 07:03:37,175 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1154 transitions. Word has length 37 [2022-11-19 07:03:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:37,176 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1154 transitions. [2022-11-19 07:03:37,176 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 07:03:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1154 transitions. [2022-11-19 07:03:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 07:03:37,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:37,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:37,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:03:37,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1981946420, now seen corresponding path program 1 times [2022-11-19 07:03:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:37,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199591057] [2022-11-19 07:03:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:37,312 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 07:03:37,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:37,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199591057] [2022-11-19 07:03:37,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199591057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:37,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:37,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:03:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255970374] [2022-11-19 07:03:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:37,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:37,316 INFO L87 Difference]: Start difference. First operand 766 states and 1154 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 07:03:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:37,667 INFO L93 Difference]: Finished difference Result 984 states and 1441 transitions. [2022-11-19 07:03:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:03:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2022-11-19 07:03:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:37,673 INFO L225 Difference]: With dead ends: 984 [2022-11-19 07:03:37,674 INFO L226 Difference]: Without dead ends: 981 [2022-11-19 07:03:37,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:03:37,676 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 310 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:37,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 180 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:03:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-11-19 07:03:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 945. [2022-11-19 07:03:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 933 states have (on average 1.4812433011789925) internal successors, (1382), 944 states have internal predecessors, (1382), 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 07:03:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1382 transitions. [2022-11-19 07:03:37,837 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1382 transitions. Word has length 38 [2022-11-19 07:03:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:37,837 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1382 transitions. [2022-11-19 07:03:37,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 07:03:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1382 transitions. [2022-11-19 07:03:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 07:03:37,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:37,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:37,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:03:37,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1551716282, now seen corresponding path program 1 times [2022-11-19 07:03:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:37,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412931755] [2022-11-19 07:03:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:37,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:37,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412931755] [2022-11-19 07:03:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412931755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:03:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132482232] [2022-11-19 07:03:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:37,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:03:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:37,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:03:37,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:37,953 INFO L87 Difference]: Start difference. First operand 945 states and 1382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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 07:03:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:38,148 INFO L93 Difference]: Finished difference Result 1814 states and 2650 transitions. [2022-11-19 07:03:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:03:38,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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) Word has length 53 [2022-11-19 07:03:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:38,152 INFO L225 Difference]: With dead ends: 1814 [2022-11-19 07:03:38,153 INFO L226 Difference]: Without dead ends: 895 [2022-11-19 07:03:38,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:03:38,154 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:38,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:03:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-19 07:03:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-19 07:03:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4637514384349828) internal successors, (1272), 880 states have internal predecessors, (1272), 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 07:03:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1272 transitions. [2022-11-19 07:03:38,283 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1272 transitions. Word has length 53 [2022-11-19 07:03:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:38,284 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1272 transitions. [2022-11-19 07:03:38,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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 07:03:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1272 transitions. [2022-11-19 07:03:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-19 07:03:38,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:38,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:38,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:03:38,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2090750529, now seen corresponding path program 1 times [2022-11-19 07:03:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:38,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088577544] [2022-11-19 07:03:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:03:38,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:38,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088577544] [2022-11-19 07:03:38,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088577544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:38,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:38,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:03:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361282529] [2022-11-19 07:03:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:38,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:38,534 INFO L87 Difference]: Start difference. First operand 881 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 07:03:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:38,815 INFO L93 Difference]: Finished difference Result 1750 states and 2524 transitions. [2022-11-19 07:03:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:03:38,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2022-11-19 07:03:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:38,819 INFO L225 Difference]: With dead ends: 1750 [2022-11-19 07:03:38,819 INFO L226 Difference]: Without dead ends: 895 [2022-11-19 07:03:38,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:03:38,821 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 151 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:38,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 140 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:03:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-19 07:03:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-19 07:03:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4602991944764097) internal successors, (1269), 880 states have internal predecessors, (1269), 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 07:03:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1269 transitions. [2022-11-19 07:03:38,963 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1269 transitions. Word has length 57 [2022-11-19 07:03:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:38,964 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1269 transitions. [2022-11-19 07:03:38,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 07:03:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1269 transitions. [2022-11-19 07:03:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 07:03:38,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:38,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:38,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:03:38,965 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash 847640831, now seen corresponding path program 1 times [2022-11-19 07:03:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:38,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352615463] [2022-11-19 07:03:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:03:39,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:39,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352615463] [2022-11-19 07:03:39,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352615463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:39,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:39,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:03:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374717766] [2022-11-19 07:03:39,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:39,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:39,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:39,104 INFO L87 Difference]: Start difference. First operand 881 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 07:03:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:39,287 INFO L93 Difference]: Finished difference Result 1736 states and 2510 transitions. [2022-11-19 07:03:39,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:03:39,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 58 [2022-11-19 07:03:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:39,291 INFO L225 Difference]: With dead ends: 1736 [2022-11-19 07:03:39,291 INFO L226 Difference]: Without dead ends: 881 [2022-11-19 07:03:39,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:39,293 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:39,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:03:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-19 07:03:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-19 07:03:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4464902186421174) internal successors, (1257), 880 states have internal predecessors, (1257), 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 07:03:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1257 transitions. [2022-11-19 07:03:39,455 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1257 transitions. Word has length 58 [2022-11-19 07:03:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:39,455 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1257 transitions. [2022-11-19 07:03:39,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 07:03:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1257 transitions. [2022-11-19 07:03:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 07:03:39,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:39,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:03:39,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2119941276, now seen corresponding path program 1 times [2022-11-19 07:03:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119630962] [2022-11-19 07:03:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:03:39,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119630962] [2022-11-19 07:03:39,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119630962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:03:39,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:03:39,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:03:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396007163] [2022-11-19 07:03:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:03:39,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:03:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:03:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:03:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:03:39,602 INFO L87 Difference]: Start difference. First operand 881 states and 1257 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 07:03:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:03:39,808 INFO L93 Difference]: Finished difference Result 1736 states and 2486 transitions. [2022-11-19 07:03:39,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:03:39,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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) Word has length 58 [2022-11-19 07:03:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:03:39,812 INFO L225 Difference]: With dead ends: 1736 [2022-11-19 07:03:39,812 INFO L226 Difference]: Without dead ends: 881 [2022-11-19 07:03:39,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:03:39,814 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:03:39,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 68 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:03:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-19 07:03:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-19 07:03:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.425776754890679) internal successors, (1239), 880 states have internal predecessors, (1239), 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 07:03:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1239 transitions. [2022-11-19 07:03:39,977 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1239 transitions. Word has length 58 [2022-11-19 07:03:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:03:39,977 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1239 transitions. [2022-11-19 07:03:39,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 07:03:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1239 transitions. [2022-11-19 07:03:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-19 07:03:39,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:03:39,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:03:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:03:39,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:03:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:03:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash -398610401, now seen corresponding path program 1 times [2022-11-19 07:03:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:03:39,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695062637] [2022-11-19 07:03:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:03:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:03:40,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:03:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695062637] [2022-11-19 07:03:40,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695062637] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:03:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569273158] [2022-11-19 07:03:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:03:40,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:03:40,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:03:40,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:03:40,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:03:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:03:40,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:03:40,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:03:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:03:41,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:03:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:03:41,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569273158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:03:41,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [269426371] [2022-11-19 07:03:41,665 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-19 07:03:41,665 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:03:41,670 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:03:41,675 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:03:41,676 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:03:42,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:42,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:03:42,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-19 07:03:42,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:42,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:42,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:03:42,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-19 07:03:53,584 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:04:08,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [269426371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:08,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:04:08,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [5, 5, 5] total 51 [2022-11-19 07:04:08,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918698220] [2022-11-19 07:04:08,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:08,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-19 07:04:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:08,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-19 07:04:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2033, Unknown=0, NotChecked=0, Total=2652 [2022-11-19 07:04:08,595 INFO L87 Difference]: Start difference. First operand 881 states and 1239 transitions. Second operand has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 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 07:04:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:18,560 INFO L93 Difference]: Finished difference Result 2217 states and 3149 transitions. [2022-11-19 07:04:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-19 07:04:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 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 58 [2022-11-19 07:04:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:18,573 INFO L225 Difference]: With dead ends: 2217 [2022-11-19 07:04:18,573 INFO L226 Difference]: Without dead ends: 1358 [2022-11-19 07:04:18,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 118 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=1085, Invalid=4317, Unknown=0, NotChecked=0, Total=5402 [2022-11-19 07:04:18,580 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 156 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:18,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 140 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-19 07:04:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-11-19 07:04:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1306. [2022-11-19 07:04:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1294 states have (on average 1.3415765069551777) internal successors, (1736), 1305 states have internal predecessors, (1736), 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 07:04:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1736 transitions. [2022-11-19 07:04:18,884 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1736 transitions. Word has length 58 [2022-11-19 07:04:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:18,885 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1736 transitions. [2022-11-19 07:04:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 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 07:04:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1736 transitions. [2022-11-19 07:04:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-19 07:04:18,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:18,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:18,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:04:19,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 07:04:19,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash -545673620, now seen corresponding path program 1 times [2022-11-19 07:04:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:19,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295596811] [2022-11-19 07:04:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:04:19,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:19,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295596811] [2022-11-19 07:04:19,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295596811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:19,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:19,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:04:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018052437] [2022-11-19 07:04:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:19,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:19,261 INFO L87 Difference]: Start difference. First operand 1306 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 07:04:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:19,569 INFO L93 Difference]: Finished difference Result 2460 states and 3269 transitions. [2022-11-19 07:04:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:19,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 81 [2022-11-19 07:04:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:19,575 INFO L225 Difference]: With dead ends: 2460 [2022-11-19 07:04:19,575 INFO L226 Difference]: Without dead ends: 1180 [2022-11-19 07:04:19,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:19,580 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:19,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 161 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-11-19 07:04:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1025. [2022-11-19 07:04:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1013 states have (on average 1.3484698914116486) internal successors, (1366), 1024 states have internal predecessors, (1366), 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 07:04:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1366 transitions. [2022-11-19 07:04:19,747 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1366 transitions. Word has length 81 [2022-11-19 07:04:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:19,747 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 1366 transitions. [2022-11-19 07:04:19,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 07:04:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1366 transitions. [2022-11-19 07:04:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-19 07:04:19,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:19,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:19,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:04:19,750 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1816895466, now seen corresponding path program 2 times [2022-11-19 07:04:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557086229] [2022-11-19 07:04:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:04:19,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557086229] [2022-11-19 07:04:19,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557086229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:19,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:19,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:04:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709337291] [2022-11-19 07:04:19,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:19,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:19,816 INFO L87 Difference]: Start difference. First operand 1025 states and 1366 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 07:04:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:20,101 INFO L93 Difference]: Finished difference Result 1026 states and 1366 transitions. [2022-11-19 07:04:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:20,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2022-11-19 07:04:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:20,106 INFO L225 Difference]: With dead ends: 1026 [2022-11-19 07:04:20,107 INFO L226 Difference]: Without dead ends: 1023 [2022-11-19 07:04:20,109 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 07:04:20,110 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 54 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:20,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 61 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-11-19 07:04:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2022-11-19 07:04:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1013 states have (on average 1.3060217176702862) internal successors, (1323), 1022 states have internal predecessors, (1323), 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 07:04:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1323 transitions. [2022-11-19 07:04:20,349 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1323 transitions. Word has length 81 [2022-11-19 07:04:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:20,349 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1323 transitions. [2022-11-19 07:04:20,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 07:04:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1323 transitions. [2022-11-19 07:04:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-19 07:04:20,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:20,351 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:20,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:04:20,353 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1325175212, now seen corresponding path program 3 times [2022-11-19 07:04:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:20,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595476485] [2022-11-19 07:04:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:04:20,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:20,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595476485] [2022-11-19 07:04:20,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595476485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:20,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:20,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:04:20,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565884240] [2022-11-19 07:04:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:20,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:20,483 INFO L87 Difference]: Start difference. First operand 1023 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 07:04:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:20,620 INFO L93 Difference]: Finished difference Result 1444 states and 1849 transitions. [2022-11-19 07:04:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:20,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 81 [2022-11-19 07:04:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:20,623 INFO L225 Difference]: With dead ends: 1444 [2022-11-19 07:04:20,623 INFO L226 Difference]: Without dead ends: 441 [2022-11-19 07:04:20,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:20,625 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:20,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-19 07:04:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 422. [2022-11-19 07:04:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 412 states have (on average 1.2888349514563107) internal successors, (531), 421 states have internal predecessors, (531), 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 07:04:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 531 transitions. [2022-11-19 07:04:20,714 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 531 transitions. Word has length 81 [2022-11-19 07:04:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:20,714 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 531 transitions. [2022-11-19 07:04:20,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 07:04:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 531 transitions. [2022-11-19 07:04:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-19 07:04:20,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:20,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:04:20,716 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash -489184462, now seen corresponding path program 1 times [2022-11-19 07:04:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685098962] [2022-11-19 07:04:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:04:20,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685098962] [2022-11-19 07:04:20,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685098962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:20,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:20,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:04:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922088895] [2022-11-19 07:04:20,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:20,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:20,777 INFO L87 Difference]: Start difference. First operand 422 states and 531 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 07:04:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:20,947 INFO L93 Difference]: Finished difference Result 423 states and 531 transitions. [2022-11-19 07:04:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 82 [2022-11-19 07:04:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:20,949 INFO L225 Difference]: With dead ends: 423 [2022-11-19 07:04:20,950 INFO L226 Difference]: Without dead ends: 420 [2022-11-19 07:04:20,950 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 07:04:20,951 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 51 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:20,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-19 07:04:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 414. [2022-11-19 07:04:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 406 states have (on average 1.2413793103448276) internal successors, (504), 413 states have internal predecessors, (504), 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 07:04:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 504 transitions. [2022-11-19 07:04:21,059 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 504 transitions. Word has length 82 [2022-11-19 07:04:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:21,059 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 504 transitions. [2022-11-19 07:04:21,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 07:04:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 504 transitions. [2022-11-19 07:04:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-19 07:04:21,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:21,061 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:21,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:04:21,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2015151000, now seen corresponding path program 1 times [2022-11-19 07:04:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:21,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812555420] [2022-11-19 07:04:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:04:21,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:21,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812555420] [2022-11-19 07:04:21,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812555420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:21,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:21,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:04:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435821000] [2022-11-19 07:04:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:21,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:21,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:21,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:21,172 INFO L87 Difference]: Start difference. First operand 414 states and 504 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 07:04:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:21,250 INFO L93 Difference]: Finished difference Result 628 states and 755 transitions. [2022-11-19 07:04:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 83 [2022-11-19 07:04:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:21,252 INFO L225 Difference]: With dead ends: 628 [2022-11-19 07:04:21,253 INFO L226 Difference]: Without dead ends: 255 [2022-11-19 07:04:21,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:21,254 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:21,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-19 07:04:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2022-11-19 07:04:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 241 states have (on average 1.2074688796680497) internal successors, (291), 248 states have internal predecessors, (291), 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 07:04:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 291 transitions. [2022-11-19 07:04:21,318 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 291 transitions. Word has length 83 [2022-11-19 07:04:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:21,318 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 291 transitions. [2022-11-19 07:04:21,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 07:04:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 291 transitions. [2022-11-19 07:04:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-19 07:04:21,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:21,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:21,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:04:21,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash -428955692, now seen corresponding path program 2 times [2022-11-19 07:04:21,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:21,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842267007] [2022-11-19 07:04:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 07:04:21,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:21,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842267007] [2022-11-19 07:04:21,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842267007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:21,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:21,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:04:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403837319] [2022-11-19 07:04:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:21,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:21,414 INFO L87 Difference]: Start difference. First operand 249 states and 291 transitions. Second operand has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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 07:04:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:21,514 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2022-11-19 07:04:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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 83 [2022-11-19 07:04:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:21,516 INFO L225 Difference]: With dead ends: 250 [2022-11-19 07:04:21,516 INFO L226 Difference]: Without dead ends: 247 [2022-11-19 07:04:21,517 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 07:04:21,517 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:21,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-19 07:04:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2022-11-19 07:04:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 237 states have (on average 1.1729957805907174) internal successors, (278), 242 states have internal predecessors, (278), 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 07:04:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 278 transitions. [2022-11-19 07:04:21,576 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 278 transitions. Word has length 83 [2022-11-19 07:04:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:21,576 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 278 transitions. [2022-11-19 07:04:21,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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 07:04:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 278 transitions. [2022-11-19 07:04:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-19 07:04:21,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:21,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:21,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 07:04:21,578 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:21,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1457080370, now seen corresponding path program 1 times [2022-11-19 07:04:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:21,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154460454] [2022-11-19 07:04:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:21,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 07:04:21,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154460454] [2022-11-19 07:04:21,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154460454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:21,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:21,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:04:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627869517] [2022-11-19 07:04:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:21,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:21,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:21,634 INFO L87 Difference]: Start difference. First operand 243 states and 278 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 07:04:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:21,728 INFO L93 Difference]: Finished difference Result 446 states and 521 transitions. [2022-11-19 07:04:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 86 [2022-11-19 07:04:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:21,730 INFO L225 Difference]: With dead ends: 446 [2022-11-19 07:04:21,730 INFO L226 Difference]: Without dead ends: 303 [2022-11-19 07:04:21,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:21,731 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:21,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 158 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-19 07:04:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2022-11-19 07:04:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 292 states have (on average 1.1643835616438356) internal successors, (340), 297 states have internal predecessors, (340), 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 07:04:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 340 transitions. [2022-11-19 07:04:21,802 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 340 transitions. Word has length 86 [2022-11-19 07:04:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:21,803 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 340 transitions. [2022-11-19 07:04:21,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 07:04:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 340 transitions. [2022-11-19 07:04:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-19 07:04:21,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:21,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 07:04:21,805 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2145486061, now seen corresponding path program 1 times [2022-11-19 07:04:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850557669] [2022-11-19 07:04:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:04:21,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850557669] [2022-11-19 07:04:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850557669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:21,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:04:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478604664] [2022-11-19 07:04:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:21,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:21,874 INFO L87 Difference]: Start difference. First operand 298 states and 340 transitions. Second operand has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 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 07:04:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:21,990 INFO L93 Difference]: Finished difference Result 299 states and 340 transitions. [2022-11-19 07:04:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 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 90 [2022-11-19 07:04:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:21,992 INFO L225 Difference]: With dead ends: 299 [2022-11-19 07:04:21,992 INFO L226 Difference]: Without dead ends: 296 [2022-11-19 07:04:21,993 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 07:04:21,993 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:21,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 51 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-19 07:04:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 254. [2022-11-19 07:04:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.144) internal successors, (286), 253 states have internal predecessors, (286), 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 07:04:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2022-11-19 07:04:22,065 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 90 [2022-11-19 07:04:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:22,066 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2022-11-19 07:04:22,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 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 07:04:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2022-11-19 07:04:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-19 07:04:22,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:22,067 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:22,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 07:04:22,068 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1284876936, now seen corresponding path program 4 times [2022-11-19 07:04:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:22,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387954658] [2022-11-19 07:04:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:04:23,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387954658] [2022-11-19 07:04:23,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387954658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:04:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410956350] [2022-11-19 07:04:23,269 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:04:23,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:04:23,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:04:23,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:04:23,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:04:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:23,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:04:23,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:04:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 07:04:23,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:04:23,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410956350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:23,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:04:23,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2022-11-19 07:04:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683279064] [2022-11-19 07:04:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:23,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:04:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:04:23,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-19 07:04:23,511 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 07:04:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:23,674 INFO L93 Difference]: Finished difference Result 383 states and 434 transitions. [2022-11-19 07:04:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:04:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 97 [2022-11-19 07:04:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:23,676 INFO L225 Difference]: With dead ends: 383 [2022-11-19 07:04:23,676 INFO L226 Difference]: Without dead ends: 222 [2022-11-19 07:04:23,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:04:23,679 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 31 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:23,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 255 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-19 07:04:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-19 07:04:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 218 states have (on average 1.114678899082569) internal successors, (243), 221 states have internal predecessors, (243), 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 07:04:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2022-11-19 07:04:23,754 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 97 [2022-11-19 07:04:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:23,754 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2022-11-19 07:04:23,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 07:04:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2022-11-19 07:04:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-19 07:04:23,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:23,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:23,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:04:23,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:04:23,962 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2121831527, now seen corresponding path program 1 times [2022-11-19 07:04:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:23,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402857642] [2022-11-19 07:04:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:04:24,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402857642] [2022-11-19 07:04:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402857642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:04:24,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:04:24,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:04:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906616474] [2022-11-19 07:04:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:04:24,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:04:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:04:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:24,044 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 07:04:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:24,152 INFO L93 Difference]: Finished difference Result 349 states and 387 transitions. [2022-11-19 07:04:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:04:24,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 103 [2022-11-19 07:04:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:24,153 INFO L225 Difference]: With dead ends: 349 [2022-11-19 07:04:24,154 INFO L226 Difference]: Without dead ends: 222 [2022-11-19 07:04:24,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:04:24,155 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:24,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:04:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-19 07:04:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2022-11-19 07:04:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 188 states have (on average 1.1063829787234043) internal successors, (208), 191 states have internal predecessors, (208), 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 07:04:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2022-11-19 07:04:24,216 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 103 [2022-11-19 07:04:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:24,217 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2022-11-19 07:04:24,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 07:04:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2022-11-19 07:04:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-19 07:04:24,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:04:24,218 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:04:24,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-19 07:04:24,219 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-19 07:04:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:04:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 283875224, now seen corresponding path program 1 times [2022-11-19 07:04:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:04:24,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889570729] [2022-11-19 07:04:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:04:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:04:25,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:04:25,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889570729] [2022-11-19 07:04:25,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889570729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:04:25,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280430132] [2022-11-19 07:04:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:04:25,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:04:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:04:25,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:04:25,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:04:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:04:25,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 07:04:25,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:04:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-19 07:04:26,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:04:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-19 07:04:27,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280430132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:04:27,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721117582] [2022-11-19 07:04:27,576 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-19 07:04:27,577 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:04:27,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:04:27,577 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:04:27,578 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:04:28,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:04:28,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:04:28,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:04:28,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-19 07:04:28,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:04:28,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:04:28,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-19 07:04:37,945 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:04:56,673 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '48340#(and (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 0 ~id1~0) (<= 0 ~__return_1470~0) (= ~p2~0 0) (<= 0 ~mode3~0) (= ~p3_new~0 ~nomsg~0) (<= ~mode2~0 1) (<= 0 ~st1~0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= 0 ~send2~0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= ~__return_1394~0 1) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= 1 ~__return_1394~0) (= ~p3~0 0) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~__return_main~0 0) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))' at error location [2022-11-19 07:04:56,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:04:56,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:04:56,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-19 07:04:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108386854] [2022-11-19 07:04:56,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:04:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 07:04:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:04:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 07:04:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=859, Invalid=3563, Unknown=0, NotChecked=0, Total=4422 [2022-11-19 07:04:56,681 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 25 states, 24 states have (on average 11.708333333333334) internal successors, (281), 25 states have internal predecessors, (281), 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 07:04:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:04:57,414 INFO L93 Difference]: Finished difference Result 238 states and 258 transitions. [2022-11-19 07:04:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:04:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 11.708333333333334) internal successors, (281), 25 states have internal predecessors, (281), 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 109 [2022-11-19 07:04:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:04:57,415 INFO L225 Difference]: With dead ends: 238 [2022-11-19 07:04:57,415 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:04:57,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 249 SyntacticMatches, 20 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3621 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=1120, Invalid=4430, Unknown=0, NotChecked=0, Total=5550 [2022-11-19 07:04:57,418 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 718 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:04:57,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 145 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:04:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:04:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:04:57,419 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 07:04:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:04:57,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-11-19 07:04:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:04:57,420 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:04:57,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 11.708333333333334) internal successors, (281), 25 states have internal predecessors, (281), 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 07:04:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:04:57,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:04:57,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-19 07:04:57,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-19 07:04:57,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-19 07:04:57,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-19 07:04:57,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-19 07:04:57,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-19 07:04:57,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-19 07:04:57,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-19 07:04:57,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-19 07:04:57,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-19 07:04:57,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-19 07:04:57,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-19 07:04:57,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-19 07:04:57,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-19 07:04:57,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:04:57,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:04:57,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:05:07,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,344 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-11-19 07:05:07,344 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2022-11-19 07:05:07,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:05:07,345 INFO L895 garLoopResultBuilder]: At program point L284(lines 265 285) the Hoare annotation is: (let ((.cse12 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse12 ~id3~0)) (.cse1 (<= .cse12 ~send3~0)) (.cse3 (= ~mode2~0 1)) (.cse4 (<= .cse12 ~send2~0)) (.cse9 (= ~st3~0 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse10 (<= .cse12 ~id2~0)) (.cse11 (<= .cse12 0)) (.cse2 (= ~st2~0 0))) (or (and .cse0 .cse1 (or (= ~st2~0 1) .cse2) .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 (or .cse9 (= ~st3~0 1)) .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse9 (<= .cse5 0) .cse6 .cse7 .cse8 .cse10 .cse11 .cse2)))) [2022-11-19 07:05:07,345 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2022-11-19 07:05:07,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,345 INFO L895 garLoopResultBuilder]: At program point L318(lines 146 331) the Hoare annotation is: (let ((.cse14 (+ ~nomsg~0 1)) (.cse13 (= ~st2~0 0)) (.cse12 (= ~st3~0 0))) (let ((.cse3 (or .cse12 (= ~st3~0 1))) (.cse7 (or .cse13 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0))))) (.cse0 (<= .cse14 ~id3~0)) (.cse1 (<= .cse14 ~send3~0)) (.cse8 (= ~mode2~0 1)) (.cse2 (<= .cse14 ~send2~0)) (.cse9 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (= ~mode1~0 1)) (.cse4 (<= .cse14 ~id2~0)) (.cse5 (<= .cse14 0))) (or (and .cse0 .cse1 (= ~mode3~0 1) .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) .cse3 .cse4 .cse5 (= ~mode1~0 0) (or (and (<= ~st1~0 0) .cse6) (and (<= ~st1~0 1) (<= 1 ~st1~0))) .cse7) (and .cse0 .cse1 .cse8 .cse2 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse9 1) .cse6 .cse10 .cse11 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse12 (<= .cse9 0) .cse6 .cse10 .cse11 .cse4 .cse5 .cse13)))) [2022-11-19 07:05:07,346 INFO L902 garLoopResultBuilder]: At program point L467(lines 58 470) the Hoare annotation is: true [2022-11-19 07:05:07,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,346 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2022-11-19 07:05:07,346 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2022-11-19 07:05:07,346 INFO L895 garLoopResultBuilder]: At program point L369(lines 126 382) the Hoare annotation is: (let ((.cse11 (= ~st2~0 0)) (.cse4 (= ~st3~0 0)) (.cse14 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse14 ~id3~0)) (.cse1 (<= .cse14 ~send3~0)) (.cse2 (<= .cse14 ~send2~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse12 (or .cse4 (= ~st3~0 1))) (.cse9 (<= .cse14 ~id2~0)) (.cse10 (<= .cse14 0)) (.cse13 (or .cse11 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse12 .cse9 .cse10 (= ~mode1~0 0) (or (and (<= ~st1~0 0) .cse6) (and (<= ~st1~0 1) (<= 1 ~st1~0))) .cse13) (and .cse0 .cse1 .cse2 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse13)))) [2022-11-19 07:05:07,347 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2022-11-19 07:05:07,347 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2022-11-19 07:05:07,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,347 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 384) the Hoare annotation is: (let ((.cse19 (+ ~nomsg~0 1)) (.cse18 (= ~st2~0 0)) (.cse15 (= ~st3~0 0)) (.cse27 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse3 (<= .cse27 1)) (.cse5 (or .cse15 (= ~st3~0 1))) (.cse8 (or .cse18 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0))))) (.cse10 (* (div ~r1~0 256) 256)) (.cse0 (<= .cse19 ~id3~0)) (.cse1 (<= .cse19 ~send3~0)) (.cse2 (<= .cse19 ~send2~0)) (.cse9 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse4 (<= 0 ~st1~0)) (.cse11 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse6 (<= .cse19 ~id2~0)) (.cse7 (<= .cse19 0)) (.cse12 (= ~mode1~0 0))) (or (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse3 .cse4 (= ~mode1~0 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 (< (+ .cse10 2) ~r1~0) .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8) (let ((.cse16 (+ ~p2_new~0 1)) (.cse17 (+ ~st2~0 ~st1~0)) (.cse13 (+ ~p3_new~0 1)) (.cse14 (+ ~p1_new~0 1))) (and (<= 0 ~id3~0) (<= 0 .cse13) (<= 0 ~id1~0) (<= 0 ~__return_1470~0) .cse9 (<= .cse14 0) (<= |ULTIMATE.start_main_~main__c1~0#1| 1) (= (* 256 (div ~mode1~0 256)) ~mode1~0) .cse15 .cse11 (<= 0 ~send2~0) (<= ~id1~0 127) (<= 0 .cse16) .cse7 (<= ~__return_1394~0 1) (<= .cse16 0) (<= ~r1~0 .cse10) (<= .cse17 0) (<= ~id3~0 127) (<= 0 ~id2~0) .cse18 (<= 0 .cse19) (<= 0 .cse17) (let ((.cse20 (= ~p2~0 0)) (.cse21 (= |#NULL.offset| 0)) (.cse22 (= ~p3~0 0)) (.cse23 (= ~p1~0 0)) (.cse24 (= ~__return_main~0 0)) (.cse25 (= |#NULL.base| 0)) (.cse26 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (= ~__return_1470~0 0) .cse20 (= |ULTIMATE.start_main_~main__c1~0#1| 0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse20 (= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) (<= ~id2~0 127) (<= 1 ~__return_1394~0) (<= .cse13 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= ~__return_1470~0 1) (<= 0 .cse14) (<= 0 ~send3~0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|))) (and .cse0 .cse1 .cse2 .cse9 .cse15 (<= .cse27 0) .cse4 .cse11 .cse6 .cse7 .cse12 .cse18)))) [2022-11-19 07:05:07,348 INFO L895 garLoopResultBuilder]: At program point L355(lines 128 356) the Hoare annotation is: (let ((.cse0 (+ ~nomsg~0 1))) (and (<= .cse0 ~id3~0) (<= .cse0 ~send3~0) (= ~mode3~0 1) (or (= ~st2~0 1) (= ~st2~0 0)) (= ~mode2~0 1) (<= .cse0 ~send2~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (<= 0 ~st1~0) (= ~mode1~0 1) (or (= ~st3~0 0) (= ~st3~0 1)) (<= .cse0 ~id2~0) (<= .cse0 0))) [2022-11-19 07:05:07,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:05:07,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,348 INFO L895 garLoopResultBuilder]: At program point L273(lines 161 286) the Hoare annotation is: (let ((.cse13 (= ~st2~0 0)) (.cse12 (= ~st3~0 0)) (.cse14 (+ ~nomsg~0 1))) (let ((.cse2 (= ~mode3~0 1)) (.cse3 (= ~mode2~0 1)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (= ~mode1~0 1)) (.cse0 (<= .cse14 ~id3~0)) (.cse1 (<= .cse14 ~send3~0)) (.cse4 (<= .cse14 ~send2~0)) (.cse8 (or .cse12 (= ~st3~0 1))) (.cse9 (<= .cse14 ~id2~0)) (.cse10 (<= .cse14 0)) (.cse6 (<= 0 ~st1~0)) (.cse11 (or .cse13 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 (<= .cse5 0) .cse6 .cse7 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse8 .cse9 .cse10 (= ~mode1~0 0) (or (and (<= ~st1~0 0) .cse6) (and (<= ~st1~0 1) (<= 1 ~st1~0))) .cse11)))) [2022-11-19 07:05:07,349 INFO L895 garLoopResultBuilder]: At program point L240(lines 181 241) the Hoare annotation is: (let ((.cse16 (+ ~nomsg~0 1)) (.cse15 (= ~st2~0 0)) (.cse14 (= ~st3~0 0)) (.cse13 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse3 (<= .cse13 1)) (.cse5 (or .cse14 (= ~st3~0 1))) (.cse8 (or .cse15 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0))))) (.cse10 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse0 (<= .cse16 ~id3~0)) (.cse1 (<= .cse16 ~send3~0)) (.cse2 (<= .cse16 ~send2~0)) (.cse9 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse4 (<= 0 ~st1~0)) (.cse11 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse6 (<= .cse16 ~id2~0)) (.cse7 (<= .cse16 0)) (.cse12 (= ~mode1~0 0))) (or (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse3 .cse4 (= ~mode1~0 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse10 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse10 (= |ULTIMATE.start_main_~check__tmp~0#1| 0) (<= (+ ~st2~0 ~st1~0) 2147483647) .cse4 .cse11 .cse6 .cse7 .cse12 (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)) (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0)) (<= .cse13 2147483647)) (and .cse0 .cse1 .cse2 .cse9 .cse14 (<= .cse13 0) .cse4 .cse11 .cse6 .cse7 .cse12 .cse15)))) [2022-11-19 07:05:07,349 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2022-11-19 07:05:07,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,349 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2022-11-19 07:05:07,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,350 INFO L895 garLoopResultBuilder]: At program point L324(lines 312 325) the Hoare annotation is: (let ((.cse12 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse12 ~id3~0)) (.cse1 (<= .cse12 ~send3~0)) (.cse11 (= ~st2~0 0)) (.cse2 (<= .cse12 ~send2~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse4 (= ~st3~0 0)) (.cse9 (<= .cse12 ~id2~0)) (.cse10 (<= .cse12 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (or (= ~st2~0 1) .cse11) .cse2 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 (or .cse4 (= ~st3~0 1)) .cse9 .cse10)))) [2022-11-19 07:05:07,350 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2022-11-19 07:05:07,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,350 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,350 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,350 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-19 07:05:07,351 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,351 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2022-11-19 07:05:07,351 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-11-19 07:05:07,352 INFO L895 garLoopResultBuilder]: At program point L375(lines 363 376) the Hoare annotation is: (let ((.cse17 (+ ~nomsg~0 1)) (.cse25 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse6 (<= .cse25 0)) (.cse0 (<= .cse17 ~id3~0)) (.cse1 (<= .cse17 ~send3~0)) (.cse12 (= ~st2~0 0)) (.cse2 (<= .cse17 ~send2~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse16 (* (div ~r1~0 256) 256)) (.cse4 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse5 (= ~st3~0 0)) (.cse9 (<= .cse17 ~id2~0)) (.cse10 (<= .cse17 0)) (.cse11 (= ~mode1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse15 (+ ~p2_new~0 1)) (.cse13 (+ ~p3_new~0 1)) (.cse14 (+ ~p1_new~0 1))) (and (<= 0 ~id3~0) (<= 0 .cse13) (<= 0 ~id1~0) (<= 0 ~__return_1470~0) .cse3 (<= .cse14 0) (<= |ULTIMATE.start_main_~main__c1~0#1| 1) .cse6 (= (mod ~mode1~0 256) 0) .cse8 (<= 0 ~st2~0) (<= 0 ~send2~0) (<= ~id1~0 127) (<= 0 .cse15) .cse10 (<= ~st2~0 0) (<= ~__return_1394~0 1) (<= .cse15 0) (<= ~r1~0 .cse16) (<= ~id3~0 127) (<= 0 ~id2~0) (<= 0 .cse17) (<= 0 (+ ~st2~0 ~st1~0)) (let ((.cse18 (= ~p2~0 0)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= ~p3~0 0)) (.cse21 (= ~p1~0 0)) (.cse22 (= ~__return_main~0 0)) (.cse23 (= |#NULL.base| 0)) (.cse24 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (= ~__return_1470~0 0) .cse18 (= |ULTIMATE.start_main_~main__c1~0#1| 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse18 (= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) (<= ~id2~0 127) (<= 0 ~st3~0) (<= 1 ~__return_1394~0) (<= .cse13 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= ~__return_1470~0 1) (<= 0 .cse14) (<= 0 ~send3~0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|))) (and .cse0 .cse1 (or (= ~st2~0 1) .cse12) .cse2 .cse3 (< (+ .cse16 2) ~r1~0) .cse4 (<= .cse25 1) .cse7 .cse8 (or .cse5 (= ~st3~0 1)) .cse9 .cse10 .cse11)))) [2022-11-19 07:05:07,352 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2022-11-19 07:05:07,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-19 07:05:07,352 INFO L895 garLoopResultBuilder]: At program point L161(lines 161 286) the Hoare annotation is: (let ((.cse14 (+ ~nomsg~0 1)) (.cse13 (= ~st2~0 0)) (.cse12 (= ~st3~0 0))) (let ((.cse3 (or .cse12 (= ~st3~0 1))) (.cse7 (or .cse13 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0))))) (.cse0 (<= .cse14 ~id3~0)) (.cse1 (<= .cse14 ~send3~0)) (.cse8 (= ~mode2~0 1)) (.cse2 (<= .cse14 ~send2~0)) (.cse9 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (= ~mode1~0 1)) (.cse4 (<= .cse14 ~id2~0)) (.cse5 (<= .cse14 0))) (or (and .cse0 .cse1 (= ~mode3~0 1) .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) .cse3 .cse4 .cse5 (= ~mode1~0 0) (or (and (<= ~st1~0 0) .cse6) (and (<= ~st1~0 1) (<= 1 ~st1~0))) .cse7) (and .cse0 .cse1 .cse8 .cse2 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse9 1) .cse6 .cse10 .cse11 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse12 (<= .cse9 0) .cse6 .cse10 .cse11 .cse4 .cse5 .cse13)))) [2022-11-19 07:05:07,352 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-11-19 07:05:07,353 INFO L895 garLoopResultBuilder]: At program point L228(lines 183 235) the Hoare annotation is: (let ((.cse19 (+ ~nomsg~0 1)) (.cse14 (= ~st2~0 0)) (.cse13 (= ~st3~0 0)) (.cse18 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse3 (= ~mode3~0 1)) (.cse4 (= ~mode2~0 1)) (.cse8 (= ~mode1~0 1)) (.cse1 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2)))) (.cse6 (<= .cse18 1)) (.cse9 (or .cse13 (= ~st3~0 1))) (.cse12 (or .cse14 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0))))) (.cse0 (<= .cse19 ~id3~0)) (.cse2 (<= .cse19 ~send3~0)) (.cse5 (<= .cse19 ~send2~0)) (.cse15 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse7 (<= 0 ~st1~0)) (.cse16 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse10 (<= .cse19 ~id2~0)) (.cse11 (<= .cse19 0)) (.cse17 (= ~mode1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 (<= ~st1~0 0) .cse13 .cse7 .cse8 .cse10 .cse11 .cse14) (and .cse0 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12) (and .cse0 .cse2 .cse5 .cse15 .cse13 (<= .cse18 0) .cse7 .cse16 .cse10 .cse11 .cse17 .cse14)))) [2022-11-19 07:05:07,353 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2022-11-19 07:05:07,353 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,353 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,353 INFO L895 garLoopResultBuilder]: At program point L146(lines 146 331) the Hoare annotation is: (let ((.cse11 (= ~st2~0 0)) (.cse4 (= ~st3~0 0)) (.cse14 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse14 ~id3~0)) (.cse1 (<= .cse14 ~send3~0)) (.cse2 (<= .cse14 ~send2~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse12 (or .cse4 (= ~st3~0 1))) (.cse9 (<= .cse14 ~id2~0)) (.cse10 (<= .cse14 0)) (.cse13 (or .cse11 (and (= ~st2~0 1) (not (= ~nomsg~0 ~id2~0)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse12 .cse9 .cse10 (= ~mode1~0 0) (or (and (<= ~st1~0 0) .cse6) (and (<= ~st1~0 1) (<= 1 ~st1~0))) .cse13) (and .cse0 .cse1 .cse2 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse13)))) [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2022-11-19 07:05:07,354 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-11-19 07:05:07,355 INFO L895 garLoopResultBuilder]: At program point L279(lines 267 280) the Hoare annotation is: (let ((.cse12 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse12 ~id3~0)) (.cse1 (<= .cse12 ~send3~0)) (.cse3 (= ~mode2~0 1)) (.cse4 (<= .cse12 ~send2~0)) (.cse9 (= ~st3~0 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse10 (<= .cse12 ~id2~0)) (.cse11 (<= .cse12 0)) (.cse2 (= ~st2~0 0))) (or (and .cse0 .cse1 (or (= ~st2~0 1) .cse2) .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 (or .cse9 (= ~st3~0 1)) .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse9 (<= .cse5 0) .cse6 .cse7 .cse8 .cse10 .cse11 .cse2)))) [2022-11-19 07:05:07,355 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-19 07:05:07,355 INFO L895 garLoopResultBuilder]: At program point L329(lines 310 330) the Hoare annotation is: (let ((.cse12 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse12 ~id3~0)) (.cse1 (<= .cse12 ~send3~0)) (.cse11 (= ~st2~0 0)) (.cse2 (<= .cse12 ~send2~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse4 (= ~st3~0 0)) (.cse9 (<= .cse12 ~id2~0)) (.cse10 (<= .cse12 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (or (= ~st2~0 1) .cse11) .cse2 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 (or .cse4 (= ~st3~0 1)) .cse9 .cse10)))) [2022-11-19 07:05:07,355 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-11-19 07:05:07,356 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2022-11-19 07:05:07,357 INFO L895 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse0 (+ ~nomsg~0 1))) (and (<= .cse0 ~id3~0) (<= .cse0 ~send3~0) (= ~mode3~0 1) (or (= ~st2~0 1) (= ~st2~0 0)) (= ~mode2~0 1) (<= .cse0 ~send2~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (<= 0 ~st1~0) (= ~mode1~0 1) (or (= ~st3~0 0) (= ~st3~0 1)) (<= .cse0 ~id2~0) (<= .cse0 0))) [2022-11-19 07:05:07,357 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-19 07:05:07,358 INFO L895 garLoopResultBuilder]: At program point L380(lines 361 381) the Hoare annotation is: (let ((.cse17 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse17 ~id3~0)) (.cse1 (<= .cse17 ~send3~0)) (.cse12 (= ~st2~0 0)) (.cse2 (<= .cse17 ~send2~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse16 (* (div ~r1~0 256) 256)) (.cse4 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse5 (= ~st3~0 0)) (.cse9 (<= .cse17 ~id2~0)) (.cse10 (<= .cse17 0)) (.cse11 (= ~mode1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse15 (+ ~p2_new~0 1)) (.cse13 (+ ~p3_new~0 1)) (.cse14 (+ ~p1_new~0 1))) (and (<= 0 ~id3~0) (<= 0 .cse13) (<= 0 ~id1~0) (<= 0 ~__return_1470~0) .cse3 (<= .cse14 0) (<= |ULTIMATE.start_main_~main__c1~0#1| 1) (<= ~st1~0 0) .cse5 (= (mod ~mode1~0 256) 0) .cse7 .cse8 (<= 0 ~send2~0) (<= ~id1~0 127) (<= 0 .cse15) .cse10 (<= ~__return_1394~0 1) (<= .cse15 0) (<= ~r1~0 .cse16) (<= ~id3~0 127) (<= 0 ~id2~0) .cse12 (<= 0 .cse17) (let ((.cse18 (= ~p2~0 0)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= ~p3~0 0)) (.cse21 (= ~p1~0 0)) (.cse22 (= ~__return_main~0 0)) (.cse23 (= |#NULL.base| 0)) (.cse24 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (= ~__return_1470~0 0) .cse18 (= |ULTIMATE.start_main_~main__c1~0#1| 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse18 (= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) (<= ~id2~0 127) (<= 1 ~__return_1394~0) (<= .cse13 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= ~__return_1470~0 1) (<= 0 .cse14) (<= 0 ~send3~0) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|))) (and .cse0 .cse1 (or (= ~st2~0 1) .cse12) .cse2 .cse3 (< (+ .cse16 2) ~r1~0) .cse4 (<= .cse6 1) .cse7 .cse8 (or .cse5 (= ~st3~0 1)) .cse9 .cse10 .cse11)))) [2022-11-19 07:05:07,358 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-11-19 07:05:07,358 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-19 07:05:07,358 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2022-11-19 07:05:07,358 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-11-19 07:05:07,358 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2022-11-19 07:05:07,362 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:05:07,364 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:05:07,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:05:07 BoogieIcfgContainer [2022-11-19 07:05:07,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:05:07,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:05:07,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:05:07,449 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:05:07,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:34" (3/4) ... [2022-11-19 07:05:07,453 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:05:07,469 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-19 07:05:07,472 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-19 07:05:07,472 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 07:05:07,473 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:05:07,560 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:05:07,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:05:07,562 INFO L158 Benchmark]: Toolchain (without parser) took 94655.09ms. Allocated memory was 102.8MB in the beginning and 796.9MB in the end (delta: 694.2MB). Free memory was 71.2MB in the beginning and 305.3MB in the end (delta: -234.0MB). Peak memory consumption was 458.3MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,562 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 102.8MB. Free memory was 57.2MB in the beginning and 57.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:05:07,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.27ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 74.9MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.94ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,565 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 102.8MB. Free memory was 72.8MB in the beginning and 71.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,567 INFO L158 Benchmark]: RCFGBuilder took 814.78ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 71.1MB in the beginning and 99.7MB in the end (delta: -28.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,567 INFO L158 Benchmark]: TraceAbstraction took 93206.39ms. Allocated memory was 127.9MB in the beginning and 796.9MB in the end (delta: 669.0MB). Free memory was 99.1MB in the beginning and 311.5MB in the end (delta: -212.4MB). Peak memory consumption was 483.6MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,571 INFO L158 Benchmark]: Witness Printer took 112.41ms. Allocated memory is still 796.9MB. Free memory was 310.5MB in the beginning and 305.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:05:07,573 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 102.8MB. Free memory was 57.2MB in the beginning and 57.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.27ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 74.9MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.94ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 102.8MB. Free memory was 72.8MB in the beginning and 71.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.78ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 71.1MB in the beginning and 99.7MB in the end (delta: -28.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 93206.39ms. Allocated memory was 127.9MB in the beginning and 796.9MB in the end (delta: 669.0MB). Free memory was 99.1MB in the beginning and 311.5MB in the end (delta: -212.4MB). Peak memory consumption was 483.6MB. Max. memory is 16.1GB. * Witness Printer took 112.41ms. Allocated memory is still 796.9MB. Free memory was 310.5MB in the beginning and 305.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: 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, 73 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 93.0s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2910 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2910 mSDsluCounter, 3298 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1609 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2746 IncrementalHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 1689 mSDtfsCounter, 2746 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 493 SyntacticMatches, 29 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6252 ImplicationChecksByTransitivity, 42.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1306occurred in iteration=13, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 651 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 112 NumberOfFragments, 3282 HoareAnnotationTreeSize, 17 FomulaSimplifications, 16234 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 21828 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1780 NumberOfCodeBlocks, 1780 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1918 ConstructedInterpolants, 0 QuantifiedInterpolants, 11268 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 590/892 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: 11.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 79, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 351, TOOLS_POST_TIME: 10.1s, 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: 351, TOOLS_QUANTIFIERELIM_TIME: 9.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 425, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 1.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 79, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 9.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 9.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, 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.3s, DAG_COMPRESSION_PROCESSED_NODES: 12854, DAG_COMPRESSION_RETAINED_NODES: 224, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && (st2 == 1 || st2 == 0)) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && (st2 == 1 || st2 == 0)) && mode2 == 1) && nomsg + 1 <= send2) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st1 <= 0) && st3 == 0) && 0 <= st1) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0)) || ((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && st2 == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) || ((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && ((st1 <= 0 && 0 <= st1) || (st1 <= 1 && 1 <= st1))) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) || ((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && ((st1 <= 0 && 0 <= st1) || (st1 <= 1 && 1 <= st1))) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && (st2 == 1 || st2 == 0)) && mode2 == 1) && nomsg + 1 <= send2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && st2 == 0) || ((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && st1 <= 0) && st3 == 0) && mode1 % 256 == 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && st2 == 0) && 0 <= nomsg + 1) && (((((((((__return_1470 == 0 && p2 == 0) && main__c1 == 0) && #NULL == 0) && p3 == 0) && p1 == 0) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((p2 == 0 && check__tmp == 1) && #NULL == 0) && p3 == 0) && p1 == 0) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && id2 <= 127) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp)) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && (st2 == 1 || st2 == 0)) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && ((st1 <= 0 && 0 <= st1) || (st1 <= 1 && 1 <= st1))) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && check__tmp == 0) && st2 + st1 <= 2147483647) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && !(2147483649 + st3 + st2 + st1 <= 0)) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647)) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && st2 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && (st2 == 1 || st2 == 0)) && mode2 == 1) && nomsg + 1 <= send2) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0)) || ((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && ((st1 <= 0 && 0 <= st1) || (st1 <= 1 && 1 <= st1))) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && ((st1 <= 0 && 0 <= st1) || (st1 <= 1 && 1 <= st1))) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && (st2 == 1 || st2 == 0)) && mode2 == 1) && nomsg + 1 <= send2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && st2 == 0) || (((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && 0 <= st2 + st1) && (((((((((__return_1470 == 0 && p2 == 0) && main__c1 == 0) && #NULL == 0) && p3 == 0) && p1 == 0) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((p2 == 0 && check__tmp == 1) && #NULL == 0) && p3 == 0) && p1 == 0) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp)) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && (st2 == 1 || st2 == 0)) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && st2 == 0) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && (st2 == 1 || st2 == 0)) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && (st2 == 0 || (st2 == 1 && !(nomsg == id2))))) || (((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && 256 * (mode1 / 256) == mode1) && st3 == 0) && 256 * (mode3 / 256) == mode3) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && st2 + st1 <= 0) && id3 <= 127) && 0 <= id2) && st2 == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && (((((((((__return_1470 == 0 && p2 == 0) && main__c1 == 0) && #NULL == 0) && p3 == 0) && p1 == 0) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || (((((((p2 == 0 && check__tmp == 1) && #NULL == 0) && p3 == 0) && p1 == 0) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) && id2 <= 127) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp)) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && st3 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && st2 == 0) RESULT: Ultimate proved your program to be correct! [2022-11-19 07:05:07,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b62ebd3-ea27-4b15-8dd0-1c08247cb59d/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