./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba --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 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- 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-b5237d8 [2022-11-22 01:57:47,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:57:47,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:57:47,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:57:47,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:57:47,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:57:47,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:57:47,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:57:47,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:57:47,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:57:47,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:57:47,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:57:47,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:57:47,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:57:47,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:57:47,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:57:47,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:57:47,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:57:47,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:57:47,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:57:47,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:57:47,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:57:47,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:57:47,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:57:48,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:57:48,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:57:48,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:57:48,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:57:48,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:57:48,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:57:48,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:57:48,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:57:48,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:57:48,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:57:48,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:57:48,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:57:48,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:57:48,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:57:48,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:57:48,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:57:48,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:57:48,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:57:48,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:57:48,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:57:48,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:57:48,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:57:48,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:57:48,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:57:48,065 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:57:48,065 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:57:48,065 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:57:48,065 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:57:48,066 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:57:48,067 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:57:48,067 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:57:48,067 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:57:48,067 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:57:48,068 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:57:48,068 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:57:48,068 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:57:48,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:57:48,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:57:48,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:57:48,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:57:48,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:57:48,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:57:48,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:57:48,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:57:48,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:57:48,072 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:57:48,072 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:57:48,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:57:48,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:57:48,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:57:48,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:57:48,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:57:48,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:57:48,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:57:48,074 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:57:48,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:57:48,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:57:48,075 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:57:48,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:57:48,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:57:48,076 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:57:48,076 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_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/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_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba 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 -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2022-11-22 01:57:48,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:57:48,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:57:48,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:57:48,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:57:48,439 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:57:48,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-22 01:57:51,620 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:57:51,857 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:57:51,858 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-22 01:57:51,867 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/data/e620bcd36/4b8d3dc7837a4fe79f1aea0a801e7f1a/FLAG5ad4c6aeb [2022-11-22 01:57:51,883 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/data/e620bcd36/4b8d3dc7837a4fe79f1aea0a801e7f1a [2022-11-22 01:57:51,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:57:51,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:57:51,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:57:51,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:57:51,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:57:51,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:57:51" (1/1) ... [2022-11-22 01:57:51,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b2b6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:51, skipping insertion in model container [2022-11-22 01:57:51,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:57:51" (1/1) ... [2022-11-22 01:57:51,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:57:51,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:57:52,277 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-11-22 01:57:52,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:57:52,324 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:57:52,385 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-11-22 01:57:52,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:57:52,420 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:57:52,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52 WrapperNode [2022-11-22 01:57:52,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:57:52,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:57:52,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:57:52,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:57:52,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,491 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 280 [2022-11-22 01:57:52,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:57:52,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:57:52,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:57:52,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:57:52,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,515 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:57:52,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:57:52,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:57:52,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:57:52,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (1/1) ... [2022-11-22 01:57:52,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:57:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:57:52,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:57:52,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:57:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:57:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:57:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:57:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:57:52,716 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:57:52,718 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:57:53,156 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:57:53,263 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:57:53,263 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:57:53,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:57:53 BoogieIcfgContainer [2022-11-22 01:57:53,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:57:53,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:57:53,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:57:53,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:57:53,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:57:51" (1/3) ... [2022-11-22 01:57:53,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc8a44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:57:53, skipping insertion in model container [2022-11-22 01:57:53,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:57:52" (2/3) ... [2022-11-22 01:57:53,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc8a44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:57:53, skipping insertion in model container [2022-11-22 01:57:53,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:57:53" (3/3) ... [2022-11-22 01:57:53,283 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-22 01:57:53,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:57:53,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-22 01:57:53,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:57:53,377 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;@a2c1e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:57:53,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-22 01:57:53,382 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-22 01:57:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:57:53,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:53,390 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-22 01:57:53,391 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-22 01:57:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1190146159, now seen corresponding path program 1 times [2022-11-22 01:57:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:53,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543453752] [2022-11-22 01:57:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:53,700 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-22 01:57:53,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:53,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543453752] [2022-11-22 01:57:53,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543453752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:53,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:53,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:57:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412280714] [2022-11-22 01:57:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:53,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:57:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:57:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:57:53,754 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-22 01:57:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:53,811 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2022-11-22 01:57:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:57:53,814 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-22 01:57:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:53,826 INFO L225 Difference]: With dead ends: 75 [2022-11-22 01:57:53,827 INFO L226 Difference]: Without dead ends: 69 [2022-11-22 01:57:53,830 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-22 01:57:53,834 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-22 01:57:53,835 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-22 01:57:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-22 01:57:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-22 01:57:53,878 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-22 01:57:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-22 01:57:53,881 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 21 [2022-11-22 01:57:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:53,882 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-22 01:57:53,882 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-22 01:57:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-22 01:57:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 01:57:53,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:53,884 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-22 01:57:53,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:57:53,884 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-22 01:57:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1628803833, now seen corresponding path program 1 times [2022-11-22 01:57:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:53,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519725258] [2022-11-22 01:57:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:54,064 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-22 01:57:54,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:54,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519725258] [2022-11-22 01:57:54,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519725258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:54,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:54,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:57:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640398807] [2022-11-22 01:57:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:54,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:57:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:57:54,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:57:54,072 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-22 01:57:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:54,171 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-11-22 01:57:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:57:54,172 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-22 01:57:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:54,176 INFO L225 Difference]: With dead ends: 165 [2022-11-22 01:57:54,177 INFO L226 Difference]: Without dead ends: 114 [2022-11-22 01:57:54,181 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-22 01:57:54,182 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:57:54,183 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.0s Time] [2022-11-22 01:57:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-22 01:57:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-22 01:57:54,217 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-22 01:57:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-11-22 01:57:54,219 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 28 [2022-11-22 01:57:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:54,219 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-11-22 01:57:54,219 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-22 01:57:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-11-22 01:57:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 01:57:54,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:54,221 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-22 01:57:54,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:57:54,221 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-22 01:57:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1333674629, now seen corresponding path program 1 times [2022-11-22 01:57:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:54,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001724601] [2022-11-22 01:57:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:57:54,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:54,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001724601] [2022-11-22 01:57:54,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001724601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:54,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:54,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:57:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272776746] [2022-11-22 01:57:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:54,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:57:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:57:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:57:54,384 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-22 01:57:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:54,486 INFO L93 Difference]: Finished difference Result 262 states and 363 transitions. [2022-11-22 01:57:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:57:54,489 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-22 01:57:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:54,491 INFO L225 Difference]: With dead ends: 262 [2022-11-22 01:57:54,491 INFO L226 Difference]: Without dead ends: 178 [2022-11-22 01:57:54,492 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-22 01:57:54,493 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-22 01:57:54,493 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-22 01:57:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-22 01:57:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-11-22 01:57:54,536 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-22 01:57:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2022-11-22 01:57:54,543 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 29 [2022-11-22 01:57:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:54,543 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2022-11-22 01:57:54,543 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-22 01:57:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2022-11-22 01:57:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:57:54,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:54,546 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-22 01:57:54,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:57:54,547 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-22 01:57:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2007586470, now seen corresponding path program 1 times [2022-11-22 01:57:54,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:54,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579119140] [2022-11-22 01:57:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:54,633 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-22 01:57:54,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:54,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579119140] [2022-11-22 01:57:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579119140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:54,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:54,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:57:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009190218] [2022-11-22 01:57:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:54,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:57:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:57:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:57:54,637 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-22 01:57:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:54,699 INFO L93 Difference]: Finished difference Result 446 states and 666 transitions. [2022-11-22 01:57:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:57:54,700 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-22 01:57:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:54,702 INFO L225 Difference]: With dead ends: 446 [2022-11-22 01:57:54,703 INFO L226 Difference]: Without dead ends: 298 [2022-11-22 01:57:54,704 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-22 01:57:54,705 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-22 01:57:54,705 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-22 01:57:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-22 01:57:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2022-11-22 01:57:54,742 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-22 01:57:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2022-11-22 01:57:54,745 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 32 [2022-11-22 01:57:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:54,745 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2022-11-22 01:57:54,745 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-22 01:57:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2022-11-22 01:57:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 01:57:54,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:54,747 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-22 01:57:54,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:57:54,747 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-22 01:57:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash 62503230, now seen corresponding path program 1 times [2022-11-22 01:57:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:54,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544404509] [2022-11-22 01:57:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:54,860 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-22 01:57:54,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:54,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544404509] [2022-11-22 01:57:54,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544404509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:54,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:54,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:57:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231931930] [2022-11-22 01:57:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:54,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:57:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:57:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:57:54,866 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-22 01:57:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:55,080 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-11-22 01:57:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:57:55,081 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-22 01:57:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:55,084 INFO L225 Difference]: With dead ends: 529 [2022-11-22 01:57:55,086 INFO L226 Difference]: Without dead ends: 526 [2022-11-22 01:57:55,091 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-22 01:57:55,096 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-22 01:57:55,097 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-22 01:57:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-22 01:57:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 364. [2022-11-22 01:57:55,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-22 01:57:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 559 transitions. [2022-11-22 01:57:55,192 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 559 transitions. Word has length 35 [2022-11-22 01:57:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:55,193 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 559 transitions. [2022-11-22 01:57:55,193 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-22 01:57:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 559 transitions. [2022-11-22 01:57:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:57:55,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:55,194 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-22 01:57:55,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:57:55,195 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-22 01:57:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1937600266, now seen corresponding path program 1 times [2022-11-22 01:57:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:55,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599211634] [2022-11-22 01:57:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:55,311 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-22 01:57:55,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599211634] [2022-11-22 01:57:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599211634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:55,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:55,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:57:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485111588] [2022-11-22 01:57:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:55,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:57:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:57:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:57:55,314 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-22 01:57:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:55,488 INFO L93 Difference]: Finished difference Result 513 states and 787 transitions. [2022-11-22 01:57:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:57:55,489 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-22 01:57:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:55,492 INFO L225 Difference]: With dead ends: 513 [2022-11-22 01:57:55,492 INFO L226 Difference]: Without dead ends: 510 [2022-11-22 01:57:55,493 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-22 01:57:55,496 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-22 01:57:55,498 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-22 01:57:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-22 01:57:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 496. [2022-11-22 01:57:55,562 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-22 01:57:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 761 transitions. [2022-11-22 01:57:55,565 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 761 transitions. Word has length 36 [2022-11-22 01:57:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:55,565 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 761 transitions. [2022-11-22 01:57:55,565 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-22 01:57:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 761 transitions. [2022-11-22 01:57:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 01:57:55,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:55,568 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-22 01:57:55,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:57:55,568 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-22 01:57:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -63933760, now seen corresponding path program 1 times [2022-11-22 01:57:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:55,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700318898] [2022-11-22 01:57:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:55,693 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-22 01:57:55,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:55,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700318898] [2022-11-22 01:57:55,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700318898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:55,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:55,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:57:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521284081] [2022-11-22 01:57:55,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:55,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:57:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:57:55,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:57:55,696 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-22 01:57:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:56,133 INFO L93 Difference]: Finished difference Result 1292 states and 1942 transitions. [2022-11-22 01:57:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:57:56,133 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-22 01:57:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:56,137 INFO L225 Difference]: With dead ends: 1292 [2022-11-22 01:57:56,137 INFO L226 Difference]: Without dead ends: 822 [2022-11-22 01:57:56,139 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-22 01:57:56,139 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-22 01:57:56,140 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-22 01:57:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-22 01:57:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 766. [2022-11-22 01:57:56,226 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-22 01:57:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1154 transitions. [2022-11-22 01:57:56,229 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1154 transitions. Word has length 37 [2022-11-22 01:57:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:56,230 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1154 transitions. [2022-11-22 01:57:56,230 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-22 01:57:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1154 transitions. [2022-11-22 01:57:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-22 01:57:56,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:56,232 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-22 01:57:56,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:57:56,233 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-22 01:57:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1981946420, now seen corresponding path program 1 times [2022-11-22 01:57:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:56,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20607277] [2022-11-22 01:57:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:56,313 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-22 01:57:56,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:56,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20607277] [2022-11-22 01:57:56,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20607277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:56,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:56,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:57:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506621260] [2022-11-22 01:57:56,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:56,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:57:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:56,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:57:56,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:57:56,315 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-22 01:57:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:56,661 INFO L93 Difference]: Finished difference Result 984 states and 1441 transitions. [2022-11-22 01:57:56,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:57:56,662 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-22 01:57:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:56,666 INFO L225 Difference]: With dead ends: 984 [2022-11-22 01:57:56,666 INFO L226 Difference]: Without dead ends: 981 [2022-11-22 01:57:56,667 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-22 01:57:56,667 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-22 01:57:56,668 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-22 01:57:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-11-22 01:57:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 945. [2022-11-22 01:57:56,769 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-22 01:57:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1382 transitions. [2022-11-22 01:57:56,773 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1382 transitions. Word has length 38 [2022-11-22 01:57:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:56,773 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1382 transitions. [2022-11-22 01:57:56,773 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-22 01:57:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1382 transitions. [2022-11-22 01:57:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-22 01:57:56,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:56,778 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-22 01:57:56,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:57:56,779 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-22 01:57:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1551716282, now seen corresponding path program 1 times [2022-11-22 01:57:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:56,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599114930] [2022-11-22 01:57:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:56,868 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-22 01:57:56,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599114930] [2022-11-22 01:57:56,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599114930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:56,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:56,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:57:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442854841] [2022-11-22 01:57:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:56,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:57:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:57:56,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:57:56,872 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-22 01:57:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:57,043 INFO L93 Difference]: Finished difference Result 1814 states and 2650 transitions. [2022-11-22 01:57:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:57:57,044 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-22 01:57:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:57,047 INFO L225 Difference]: With dead ends: 1814 [2022-11-22 01:57:57,048 INFO L226 Difference]: Without dead ends: 895 [2022-11-22 01:57:57,049 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-22 01:57:57,050 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-22 01:57:57,050 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-22 01:57:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-22 01:57:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-22 01:57:57,149 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-22 01:57:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1272 transitions. [2022-11-22 01:57:57,152 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1272 transitions. Word has length 53 [2022-11-22 01:57:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:57,153 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1272 transitions. [2022-11-22 01:57:57,153 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-22 01:57:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1272 transitions. [2022-11-22 01:57:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-22 01:57:57,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:57,154 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-22 01:57:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:57:57,154 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-22 01:57:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2090750529, now seen corresponding path program 1 times [2022-11-22 01:57:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:57,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816946030] [2022-11-22 01:57:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:57,367 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-22 01:57:57,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:57,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816946030] [2022-11-22 01:57:57,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816946030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:57,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:57,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:57:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093159855] [2022-11-22 01:57:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:57,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:57:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:57:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:57:57,370 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-22 01:57:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:57,651 INFO L93 Difference]: Finished difference Result 1750 states and 2524 transitions. [2022-11-22 01:57:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:57:57,652 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-22 01:57:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:57,656 INFO L225 Difference]: With dead ends: 1750 [2022-11-22 01:57:57,656 INFO L226 Difference]: Without dead ends: 895 [2022-11-22 01:57:57,657 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-22 01:57:57,658 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-22 01:57:57,659 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-22 01:57:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-22 01:57:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-22 01:57:57,762 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-22 01:57:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1269 transitions. [2022-11-22 01:57:57,766 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1269 transitions. Word has length 57 [2022-11-22 01:57:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:57,766 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1269 transitions. [2022-11-22 01:57:57,766 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-22 01:57:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1269 transitions. [2022-11-22 01:57:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 01:57:57,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:57,767 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-22 01:57:57,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:57:57,767 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-22 01:57:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash 847640831, now seen corresponding path program 1 times [2022-11-22 01:57:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:57,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239532348] [2022-11-22 01:57:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:57,947 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-22 01:57:57,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:57,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239532348] [2022-11-22 01:57:57,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239532348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:57,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:57,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:57:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042701308] [2022-11-22 01:57:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:57,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:57:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:57:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:57:57,949 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-22 01:57:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:58,123 INFO L93 Difference]: Finished difference Result 1736 states and 2510 transitions. [2022-11-22 01:57:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:57:58,123 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-22 01:57:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:58,127 INFO L225 Difference]: With dead ends: 1736 [2022-11-22 01:57:58,127 INFO L226 Difference]: Without dead ends: 881 [2022-11-22 01:57:58,128 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-22 01:57:58,129 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-22 01:57:58,130 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-22 01:57:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-22 01:57:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-22 01:57:58,251 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-22 01:57:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1257 transitions. [2022-11-22 01:57:58,292 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1257 transitions. Word has length 58 [2022-11-22 01:57:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:58,292 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1257 transitions. [2022-11-22 01:57:58,292 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-22 01:57:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1257 transitions. [2022-11-22 01:57:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 01:57:58,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:58,293 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-22 01:57:58,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:57:58,293 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-22 01:57:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2119941276, now seen corresponding path program 1 times [2022-11-22 01:57:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:58,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5549304] [2022-11-22 01:57:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:58,408 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-22 01:57:58,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:58,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5549304] [2022-11-22 01:57:58,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5549304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:57:58,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:57:58,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:57:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579945135] [2022-11-22 01:57:58,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:57:58,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:57:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:57:58,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:57:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:57:58,410 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-22 01:57:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:57:58,601 INFO L93 Difference]: Finished difference Result 1736 states and 2486 transitions. [2022-11-22 01:57:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:57:58,601 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-22 01:57:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:57:58,605 INFO L225 Difference]: With dead ends: 1736 [2022-11-22 01:57:58,605 INFO L226 Difference]: Without dead ends: 881 [2022-11-22 01:57:58,606 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-22 01:57:58,607 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-22 01:57:58,608 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-22 01:57:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-22 01:57:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-22 01:57:58,758 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-22 01:57:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1239 transitions. [2022-11-22 01:57:58,761 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1239 transitions. Word has length 58 [2022-11-22 01:57:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:57:58,762 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1239 transitions. [2022-11-22 01:57:58,762 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-22 01:57:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1239 transitions. [2022-11-22 01:57:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 01:57:58,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:57:58,763 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-22 01:57:58,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:57:58,763 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-22 01:57:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:57:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -398610401, now seen corresponding path program 1 times [2022-11-22 01:57:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:57:58,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531432416] [2022-11-22 01:57:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:57:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:59,028 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-22 01:57:59,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:57:59,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531432416] [2022-11-22 01:57:59,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531432416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:57:59,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068922377] [2022-11-22 01:57:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:57:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:57:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:57:59,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:57:59,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:57:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:57:59,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:57:59,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:58:00,118 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-22 01:58:00,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:58:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:00,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068922377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:58:00,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1225003723] [2022-11-22 01:58:00,875 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-22 01:58:00,875 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:58:00,879 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:58:00,884 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:58:00,885 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:58:01,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:01,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:58:01,223 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-22 01:58:01,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:01,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:01,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:58:01,262 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-22 01:58:14,765 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:58:35,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1225003723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:35,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:58:35,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [5, 7, 7] total 58 [2022-11-22 01:58:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502982730] [2022-11-22 01:58:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:35,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-22 01:58:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-22 01:58:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=862, Invalid=2560, Unknown=0, NotChecked=0, Total=3422 [2022-11-22 01:58:35,492 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-22 01:58:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:49,354 INFO L93 Difference]: Finished difference Result 2187 states and 3117 transitions. [2022-11-22 01:58:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-22 01:58:49,355 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-22 01:58:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:49,360 INFO L225 Difference]: With dead ends: 2187 [2022-11-22 01:58:49,360 INFO L226 Difference]: Without dead ends: 1328 [2022-11-22 01:58:49,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2927 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=1362, Invalid=4958, Unknown=0, NotChecked=0, Total=6320 [2022-11-22 01:58:49,364 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 200 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:58:49,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 115 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-22 01:58:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-11-22 01:58:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1295. [2022-11-22 01:58:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1283 states have (on average 1.3359314107560405) internal successors, (1714), 1294 states have internal predecessors, (1714), 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-22 01:58:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1714 transitions. [2022-11-22 01:58:49,613 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1714 transitions. Word has length 58 [2022-11-22 01:58:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:49,613 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1714 transitions. [2022-11-22 01:58:49,614 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-22 01:58:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1714 transitions. [2022-11-22 01:58:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-22 01:58:49,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:49,617 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-22 01:58:49,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:58:49,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 01:58:49,850 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-22 01:58:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash -545673620, now seen corresponding path program 1 times [2022-11-22 01:58:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:49,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536029322] [2022-11-22 01:58:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:50,018 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-22 01:58:50,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:50,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536029322] [2022-11-22 01:58:50,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536029322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:50,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:50,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:58:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175913068] [2022-11-22 01:58:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:50,022 INFO L87 Difference]: Start difference. First operand 1295 states and 1714 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-22 01:58:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:50,287 INFO L93 Difference]: Finished difference Result 2440 states and 3229 transitions. [2022-11-22 01:58:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:50,288 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-22 01:58:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:50,292 INFO L225 Difference]: With dead ends: 2440 [2022-11-22 01:58:50,293 INFO L226 Difference]: Without dead ends: 1170 [2022-11-22 01:58:50,296 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-22 01:58:50,296 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-22 01:58:50,297 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-22 01:58:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-11-22 01:58:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1017. [2022-11-22 01:58:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1005 states have (on average 1.3432835820895523) internal successors, (1350), 1016 states have internal predecessors, (1350), 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-22 01:58:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1350 transitions. [2022-11-22 01:58:50,501 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1350 transitions. Word has length 81 [2022-11-22 01:58:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:50,501 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1350 transitions. [2022-11-22 01:58:50,501 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-22 01:58:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1350 transitions. [2022-11-22 01:58:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-22 01:58:50,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:50,502 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-22 01:58:50,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:58:50,503 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-22 01:58:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1816895466, now seen corresponding path program 2 times [2022-11-22 01:58:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081793802] [2022-11-22 01:58:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:50,565 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-22 01:58:50,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081793802] [2022-11-22 01:58:50,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081793802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:50,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:50,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:58:50,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704354748] [2022-11-22 01:58:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:50,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:50,567 INFO L87 Difference]: Start difference. First operand 1017 states and 1350 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-22 01:58:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:50,795 INFO L93 Difference]: Finished difference Result 1018 states and 1350 transitions. [2022-11-22 01:58:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:50,796 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-22 01:58:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:50,799 INFO L225 Difference]: With dead ends: 1018 [2022-11-22 01:58:50,799 INFO L226 Difference]: Without dead ends: 1015 [2022-11-22 01:58:50,800 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-22 01:58:50,800 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-22 01:58:50,801 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-22 01:58:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-11-22 01:58:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2022-11-22 01:58:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1005 states have (on average 1.3004975124378109) internal successors, (1307), 1014 states have internal predecessors, (1307), 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-22 01:58:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1307 transitions. [2022-11-22 01:58:51,015 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1307 transitions. Word has length 81 [2022-11-22 01:58:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:51,015 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1307 transitions. [2022-11-22 01:58:51,015 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-22 01:58:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1307 transitions. [2022-11-22 01:58:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-22 01:58:51,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:51,017 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-22 01:58:51,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:58:51,017 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-22 01:58:51,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1325175212, now seen corresponding path program 3 times [2022-11-22 01:58:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:51,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278107468] [2022-11-22 01:58:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:51,117 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-22 01:58:51,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278107468] [2022-11-22 01:58:51,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278107468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:51,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:51,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:58:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301994693] [2022-11-22 01:58:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:51,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:51,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:51,120 INFO L87 Difference]: Start difference. First operand 1015 states and 1307 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-22 01:58:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:51,247 INFO L93 Difference]: Finished difference Result 1433 states and 1827 transitions. [2022-11-22 01:58:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:51,248 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-22 01:58:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:51,249 INFO L225 Difference]: With dead ends: 1433 [2022-11-22 01:58:51,249 INFO L226 Difference]: Without dead ends: 438 [2022-11-22 01:58:51,250 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-22 01:58:51,251 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-22 01:58:51,251 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-22 01:58:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-22 01:58:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 419. [2022-11-22 01:58:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 409 states have (on average 1.2836185819070904) internal successors, (525), 418 states have internal predecessors, (525), 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-22 01:58:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 525 transitions. [2022-11-22 01:58:51,339 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 525 transitions. Word has length 81 [2022-11-22 01:58:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:51,339 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 525 transitions. [2022-11-22 01:58:51,340 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-22 01:58:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 525 transitions. [2022-11-22 01:58:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-22 01:58:51,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:51,341 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-22 01:58:51,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:58:51,341 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-22 01:58:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash -489184462, now seen corresponding path program 1 times [2022-11-22 01:58:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:51,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178062330] [2022-11-22 01:58:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:51,400 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-22 01:58:51,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178062330] [2022-11-22 01:58:51,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178062330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:51,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:51,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:58:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77286331] [2022-11-22 01:58:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:51,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:51,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:51,403 INFO L87 Difference]: Start difference. First operand 419 states and 525 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-22 01:58:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:51,565 INFO L93 Difference]: Finished difference Result 420 states and 525 transitions. [2022-11-22 01:58:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:51,566 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-22 01:58:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:51,568 INFO L225 Difference]: With dead ends: 420 [2022-11-22 01:58:51,568 INFO L226 Difference]: Without dead ends: 417 [2022-11-22 01:58:51,569 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-22 01:58:51,569 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-22 01:58:51,570 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-22 01:58:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-22 01:58:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2022-11-22 01:58:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 403 states have (on average 1.2357320099255582) internal successors, (498), 410 states have internal predecessors, (498), 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-22 01:58:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 498 transitions. [2022-11-22 01:58:51,670 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 498 transitions. Word has length 82 [2022-11-22 01:58:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:51,670 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 498 transitions. [2022-11-22 01:58:51,670 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-22 01:58:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 498 transitions. [2022-11-22 01:58:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-22 01:58:51,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:51,671 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-22 01:58:51,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 01:58:51,672 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-22 01:58:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2015151000, now seen corresponding path program 1 times [2022-11-22 01:58:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:51,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771409767] [2022-11-22 01:58:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:51,771 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-22 01:58:51,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:51,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771409767] [2022-11-22 01:58:51,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771409767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:51,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:51,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:58:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030742927] [2022-11-22 01:58:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:51,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:51,774 INFO L87 Difference]: Start difference. First operand 411 states and 498 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-22 01:58:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:51,845 INFO L93 Difference]: Finished difference Result 624 states and 747 transitions. [2022-11-22 01:58:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:51,845 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-22 01:58:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:51,846 INFO L225 Difference]: With dead ends: 624 [2022-11-22 01:58:51,846 INFO L226 Difference]: Without dead ends: 253 [2022-11-22 01:58:51,847 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-22 01:58:51,848 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-22 01:58:51,848 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-22 01:58:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-22 01:58:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2022-11-22 01:58:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 239 states have (on average 1.200836820083682) internal successors, (287), 246 states have internal predecessors, (287), 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-22 01:58:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 287 transitions. [2022-11-22 01:58:51,904 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 287 transitions. Word has length 83 [2022-11-22 01:58:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:51,905 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 287 transitions. [2022-11-22 01:58:51,905 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-22 01:58:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 287 transitions. [2022-11-22 01:58:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-22 01:58:51,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:51,906 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-22 01:58:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 01:58:51,906 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-22 01:58:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -428955692, now seen corresponding path program 2 times [2022-11-22 01:58:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184543482] [2022-11-22 01:58:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:51,964 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-22 01:58:51,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184543482] [2022-11-22 01:58:51,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184543482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:58:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242538830] [2022-11-22 01:58:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:51,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:51,967 INFO L87 Difference]: Start difference. First operand 247 states and 287 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-22 01:58:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:52,068 INFO L93 Difference]: Finished difference Result 248 states and 287 transitions. [2022-11-22 01:58:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:52,068 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-22 01:58:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:52,069 INFO L225 Difference]: With dead ends: 248 [2022-11-22 01:58:52,070 INFO L226 Difference]: Without dead ends: 245 [2022-11-22 01:58:52,070 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-22 01:58:52,070 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-22 01:58:52,071 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-22 01:58:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-22 01:58:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2022-11-22 01:58:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 235 states have (on average 1.1659574468085105) internal successors, (274), 240 states have internal predecessors, (274), 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-22 01:58:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 274 transitions. [2022-11-22 01:58:52,127 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 274 transitions. Word has length 83 [2022-11-22 01:58:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:52,128 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 274 transitions. [2022-11-22 01:58:52,128 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-22 01:58:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 274 transitions. [2022-11-22 01:58:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-22 01:58:52,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:52,129 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-22 01:58:52,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:58:52,129 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-22 01:58:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1457080370, now seen corresponding path program 1 times [2022-11-22 01:58:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:52,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489562853] [2022-11-22 01:58:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:52,178 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-22 01:58:52,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:52,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489562853] [2022-11-22 01:58:52,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489562853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:52,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:52,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:58:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607795694] [2022-11-22 01:58:52,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:52,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:52,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:52,180 INFO L87 Difference]: Start difference. First operand 241 states and 274 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-22 01:58:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:52,271 INFO L93 Difference]: Finished difference Result 444 states and 517 transitions. [2022-11-22 01:58:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:52,272 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-22 01:58:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:52,273 INFO L225 Difference]: With dead ends: 444 [2022-11-22 01:58:52,274 INFO L226 Difference]: Without dead ends: 301 [2022-11-22 01:58:52,274 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-22 01:58:52,275 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-22 01:58:52,275 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-22 01:58:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-22 01:58:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-11-22 01:58:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 290 states have (on average 1.1586206896551725) internal successors, (336), 295 states have internal predecessors, (336), 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-22 01:58:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 336 transitions. [2022-11-22 01:58:52,343 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 336 transitions. Word has length 86 [2022-11-22 01:58:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:52,344 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 336 transitions. [2022-11-22 01:58:52,344 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-22 01:58:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 336 transitions. [2022-11-22 01:58:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-22 01:58:52,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:52,345 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-22 01:58:52,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 01:58:52,345 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-22 01:58:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2145486061, now seen corresponding path program 1 times [2022-11-22 01:58:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:52,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711826356] [2022-11-22 01:58:52,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:52,408 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-22 01:58:52,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:52,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711826356] [2022-11-22 01:58:52,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711826356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:52,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:52,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:58:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463053363] [2022-11-22 01:58:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:52,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:52,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:52,410 INFO L87 Difference]: Start difference. First operand 296 states and 336 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-22 01:58:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:52,518 INFO L93 Difference]: Finished difference Result 297 states and 336 transitions. [2022-11-22 01:58:52,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:52,518 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-22 01:58:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:52,520 INFO L225 Difference]: With dead ends: 297 [2022-11-22 01:58:52,520 INFO L226 Difference]: Without dead ends: 294 [2022-11-22 01:58:52,520 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-22 01:58:52,521 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-22 01:58:52,521 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-22 01:58:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-22 01:58:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 252. [2022-11-22 01:58:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.1370967741935485) internal successors, (282), 251 states have internal predecessors, (282), 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-22 01:58:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2022-11-22 01:58:52,589 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 90 [2022-11-22 01:58:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:52,590 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2022-11-22 01:58:52,590 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-22 01:58:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2022-11-22 01:58:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-22 01:58:52,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:52,591 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-22 01:58:52,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 01:58:52,592 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-22 01:58:52,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1284876936, now seen corresponding path program 4 times [2022-11-22 01:58:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:52,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236525106] [2022-11-22 01:58:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 01:58:53,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:53,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236525106] [2022-11-22 01:58:53,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236525106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:58:53,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684692318] [2022-11-22 01:58:53,232 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:58:53,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:53,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:53,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:58:53,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:58:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:53,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 01:58:53,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:58:53,442 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-22 01:58:53,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:58:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684692318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:58:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-11-22 01:58:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264181625] [2022-11-22 01:58:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:53,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:58:53,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:58:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:58:53,444 INFO L87 Difference]: Start difference. First operand 252 states and 282 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-22 01:58:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:53,555 INFO L93 Difference]: Finished difference Result 381 states and 430 transitions. [2022-11-22 01:58:53,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:58:53,556 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-22 01:58:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:53,557 INFO L225 Difference]: With dead ends: 381 [2022-11-22 01:58:53,557 INFO L226 Difference]: Without dead ends: 220 [2022-11-22 01:58:53,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:58:53,558 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 249 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-22 01:58:53,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 249 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:58:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-22 01:58:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-22 01:58:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 216 states have (on average 1.1064814814814814) internal successors, (239), 219 states have internal predecessors, (239), 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-22 01:58:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 239 transitions. [2022-11-22 01:58:53,622 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 239 transitions. Word has length 97 [2022-11-22 01:58:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:53,622 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 239 transitions. [2022-11-22 01:58:53,622 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-22 01:58:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 239 transitions. [2022-11-22 01:58:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-22 01:58:53,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:53,624 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-22 01:58:53,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:58:53,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 01:58:53,830 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-22 01:58:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2121831527, now seen corresponding path program 1 times [2022-11-22 01:58:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:53,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158095270] [2022-11-22 01:58:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:53,912 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-22 01:58:53,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158095270] [2022-11-22 01:58:53,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158095270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:53,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:53,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:58:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389081967] [2022-11-22 01:58:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:53,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:53,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:53,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:53,915 INFO L87 Difference]: Start difference. First operand 220 states and 239 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-22 01:58:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:54,011 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-11-22 01:58:54,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:54,012 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-22 01:58:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:54,013 INFO L225 Difference]: With dead ends: 347 [2022-11-22 01:58:54,013 INFO L226 Difference]: Without dead ends: 220 [2022-11-22 01:58:54,015 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-22 01:58:54,016 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 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-22 01:58:54,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:58:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-22 01:58:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2022-11-22 01:58:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.096774193548387) internal successors, (204), 189 states have internal predecessors, (204), 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-22 01:58:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2022-11-22 01:58:54,075 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 103 [2022-11-22 01:58:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:54,075 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2022-11-22 01:58:54,075 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-22 01:58:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2022-11-22 01:58:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-22 01:58:54,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:54,077 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-22 01:58:54,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 01:58:54,077 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-22 01:58:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash 283875224, now seen corresponding path program 1 times [2022-11-22 01:58:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:54,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272951629] [2022-11-22 01:58:54,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-22 01:58:54,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:54,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272951629] [2022-11-22 01:58:54,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272951629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:58:54,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928691357] [2022-11-22 01:58:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:54,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:54,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:54,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:58:54,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:58:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:54,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 01:58:54,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:10,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:36,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928691357] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:36,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810244314] [2022-11-22 01:59:36,805 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-22 01:59:36,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:59:36,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:59:36,805 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:59:36,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:59:37,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:37,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:37,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:59:37,403 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-22 01:59:37,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:37,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:59:37,415 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-22 01:59:49,338 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:00:15,500 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '48106#(and (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 0 ~id1~0) (= ~p2~0 0) (<= 0 ~mode3~0) (= ~p3_new~0 ~nomsg~0) (<= ~mode2~0 1) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= 0 ~send2~0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~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) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 ~__return_1465~0) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))' at error location [2022-11-22 02:00:15,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:00:15,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:00:15,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 22, 21] total 48 [2022-11-22 02:00:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669495525] [2022-11-22 02:00:15,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:00:15,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-22 02:00:15,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:00:15,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-22 02:00:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1671, Invalid=6519, Unknown=0, NotChecked=0, Total=8190 [2022-11-22 02:00:15,505 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 49 states, 48 states have (on average 6.3125) internal successors, (303), 49 states have internal predecessors, (303), 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-22 02:00:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:00:42,734 INFO L93 Difference]: Finished difference Result 445 states and 479 transitions. [2022-11-22 02:00:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-22 02:00:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.3125) internal successors, (303), 49 states have internal predecessors, (303), 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-22 02:00:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:00:42,736 INFO L225 Difference]: With dead ends: 445 [2022-11-22 02:00:42,737 INFO L226 Difference]: Without dead ends: 348 [2022-11-22 02:00:42,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 204 SyntacticMatches, 40 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8903 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=3460, Invalid=12542, Unknown=0, NotChecked=0, Total=16002 [2022-11-22 02:00:42,741 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2749 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2749 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:00:42,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2749 Valid, 429 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-22 02:00:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-22 02:00:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 221. [2022-11-22 02:00:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 219 states have (on average 1.0776255707762556) internal successors, (236), 220 states have internal predecessors, (236), 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-22 02:00:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 236 transitions. [2022-11-22 02:00:42,853 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 236 transitions. Word has length 109 [2022-11-22 02:00:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:00:42,854 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 236 transitions. [2022-11-22 02:00:42,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.3125) internal successors, (303), 49 states have internal predecessors, (303), 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-22 02:00:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 236 transitions. [2022-11-22 02:00:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-22 02:00:42,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:00:42,856 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-22 02:00:42,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 02:00:43,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 02:00:43,062 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-22 02:00:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:00:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2073812326, now seen corresponding path program 1 times [2022-11-22 02:00:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:00:43,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671178937] [2022-11-22 02:00:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:00:43,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:00:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:00:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:00:44,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:00:44,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671178937] [2022-11-22 02:00:44,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671178937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:00:44,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508727982] [2022-11-22 02:00:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:00:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:00:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:00:44,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:00:44,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:00:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:00:44,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:00:44,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:00:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:00:53,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:01:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:01:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508727982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:01:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1881417018] [2022-11-22 02:01:24,051 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-22 02:01:24,051 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:01:24,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:01:24,052 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:01:24,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:01:24,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:01:24,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:01:24,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:01:24,430 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-22 02:01:24,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:01:24,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:01:24,447 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-22 02:01:34,215 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:01:58,645 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '49850#(and (<= ~st2~0 2147483647) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~id1~0) (<= (+ ~p1_new~0 1) 0) (<= 0 ~mode3~0) (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) (<= ~mode2~0 1) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= ~p1~0 0) (<= ~__return_main~0 0) (<= ~mode3~0 1) (<= 0 ~p2~0) (<= 0 ~send2~0) (<= ~id1~0 127) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= 0 (+ ~p2_new~0 1)) (<= |ULTIMATE.start_main_~main__i2~0#1| 0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 0 ~__return_main~0) (<= ~id3~0 127) (<= 0 ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= ~st1~0 2147483647) (<= 0 |#NULL.offset|) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~__return_1465~0) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (<= 0 ~p1~0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0))' at error location [2022-11-22 02:01:58,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:01:58,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:01:58,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 19] total 46 [2022-11-22 02:01:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955976100] [2022-11-22 02:01:58,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:01:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-22 02:01:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:01:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-22 02:01:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=6349, Unknown=0, NotChecked=0, Total=7832 [2022-11-22 02:01:58,649 INFO L87 Difference]: Start difference. First operand 221 states and 236 transitions. Second operand has 47 states, 46 states have (on average 6.891304347826087) internal successors, (317), 47 states have internal predecessors, (317), 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-22 02:02:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:02:08,835 INFO L93 Difference]: Finished difference Result 384 states and 407 transitions. [2022-11-22 02:02:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 02:02:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 6.891304347826087) internal successors, (317), 47 states have internal predecessors, (317), 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 111 [2022-11-22 02:02:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:02:08,835 INFO L225 Difference]: With dead ends: 384 [2022-11-22 02:02:08,836 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:02:08,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 228 SyntacticMatches, 28 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=2940, Invalid=11340, Unknown=0, NotChecked=0, Total=14280 [2022-11-22 02:02:08,841 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1707 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:02:08,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 437 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 02:02:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:02:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:02:08,842 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-22 02:02:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:02:08,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2022-11-22 02:02:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:02:08,843 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:02:08,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 6.891304347826087) internal successors, (317), 47 states have internal predecessors, (317), 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-22 02:02:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:02:08,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:02:08,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-22 02:02:08,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-22 02:02:08,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-22 02:02:08,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-22 02:02:08,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-22 02:02:08,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-22 02:02:08,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-22 02:02:08,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-22 02:02:08,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-22 02:02:09,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 02:02:09,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:02:51,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,586 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-11-22 02:02:51,586 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 407) no Hoare annotation was computed. [2022-11-22 02:02:51,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:02:51,587 INFO L895 garLoopResultBuilder]: At program point L284(lines 265 285) the Hoare annotation is: (let ((.cse12 (= ~st1~0 0)) (.cse15 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse15 ~id3~0)) (.cse1 (<= .cse15 ~send3~0)) (.cse2 (= ~mode2~0 1)) (.cse3 (<= .cse15 ~send2~0)) (.cse4 (<= 0 ~id1~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (= ~mode1~0 1)) (.cse8 (<= .cse15 ~id2~0)) (.cse9 (= .cse15 0)) (.cse11 (let ((.cse13 (+ ~st2~0 ~st1~0)) (.cse14 (= ~st1~0 1))) (or (and (= .cse13 0) .cse12) (and .cse14 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse13 1) (or .cse14 .cse12)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 (or (= ~st3~0 0) (= ~st3~0 1)) .cse8 .cse9 (let ((.cse10 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse10) (<= ~st3~0 0)) (<= 1 .cse10))) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse12 .cse9 (<= 0 ~st3~0) .cse11)))) [2022-11-22 02:02:51,587 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 447) no Hoare annotation was computed. [2022-11-22 02:02:51,587 INFO L902 garLoopResultBuilder]: At program point L466(lines 58 469) the Hoare annotation is: true [2022-11-22 02:02:51,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,588 INFO L895 garLoopResultBuilder]: At program point L318(lines 146 331) the Hoare annotation is: (let ((.cse23 (+ ~st3~0 ~st2~0))) (let ((.cse19 (= ~st1~0 0)) (.cse22 (+ ~nomsg~0 1)) (.cse12 (<= 0 .cse23)) (.cse13 (<= ~st3~0 0))) (let ((.cse2 (= ~mode3~0 1)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse9 (= ~mode1~0 0)) (.cse6 (= ~st3~0 1)) (.cse10 (or (and .cse12 .cse13) (<= 1 .cse23))) (.cse0 (<= .cse22 ~id3~0)) (.cse1 (<= .cse22 ~send3~0)) (.cse15 (= ~mode2~0 1)) (.cse3 (<= .cse22 ~send2~0)) (.cse4 (<= 0 ~id1~0)) (.cse16 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse17 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse18 (= ~mode1~0 1)) (.cse7 (<= .cse22 ~id2~0)) (.cse8 (= .cse22 0)) (.cse14 (<= 0 ~st3~0)) (.cse11 (let ((.cse20 (+ ~st2~0 ~st1~0)) (.cse21 (= ~st1~0 1))) (or (and (= .cse20 0) .cse19) (and .cse21 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse20 1) (or .cse21 .cse19)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse14 .cse11) (and .cse0 .cse1 .cse15 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse16 1) .cse17 .cse18 (or (= ~st3~0 0) .cse6) .cse7 .cse8 .cse10 .cse11) (and .cse0 .cse1 .cse15 .cse3 .cse4 (<= .cse16 0) .cse17 .cse18 .cse7 .cse19 .cse8 .cse14 .cse11))))) [2022-11-22 02:02:51,588 INFO L895 garLoopResultBuilder]: At program point L368(lines 126 381) the Hoare annotation is: (let ((.cse15 (= ~st1~0 1)) (.cse13 (= ~st1~0 0))) (let ((.cse17 (+ ~nomsg~0 1)) (.cse16 (or .cse15 .cse13))) (let ((.cse3 (or (and (= ~st3~0 1) .cse16) (= ~st3~0 0))) (.cse11 (let ((.cse18 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse18) (<= ~st3~0 0)) (<= 1 .cse18)))) (.cse0 (<= .cse17 ~id3~0)) (.cse1 (<= .cse17 ~send3~0)) (.cse2 (<= .cse17 ~send2~0)) (.cse4 (<= 0 ~id1~0)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse9 (<= .cse17 ~id2~0)) (.cse10 (= .cse17 0)) (.cse12 (let ((.cse14 (+ ~st2~0 ~st1~0))) (or (and (= .cse14 0) .cse13) (and .cse15 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse14 1) .cse16))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse6 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse3 .cse4 .cse9 .cse10 (= ~mode1~0 0) (<= .cse6 2) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse13 .cse10 (<= 0 ~st3~0) .cse12))))) [2022-11-22 02:02:51,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,588 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 402) no Hoare annotation was computed. [2022-11-22 02:02:51,588 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 442) no Hoare annotation was computed. [2022-11-22 02:02:51,589 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 397) no Hoare annotation was computed. [2022-11-22 02:02:51,589 INFO L895 garLoopResultBuilder]: At program point L354(lines 128 355) the Hoare annotation is: (let ((.cse0 (+ ~nomsg~0 1))) (and (<= .cse0 ~id3~0) (<= .cse0 ~send3~0) (= ~mode3~0 1) (= ~mode2~0 1) (<= .cse0 ~send2~0) (<= 0 ~id1~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (= ~mode1~0 1) (or (= ~st3~0 0) (= ~st3~0 1)) (<= .cse0 ~id2~0) (or (= ~st1~0 1) (= ~st1~0 0)) (= .cse0 0) (let ((.cse1 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse1) (<= ~st3~0 0)) (<= 1 .cse1))))) [2022-11-22 02:02:51,589 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 437) no Hoare annotation was computed. [2022-11-22 02:02:51,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,591 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 383) the Hoare annotation is: (let ((.cse31 (= ~st3~0 0)) (.cse12 (= ~st1~0 0)) (.cse10 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse34 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse34 ~id3~0)) (.cse1 (<= .cse34 ~send3~0)) (.cse2 (<= .cse34 ~send2~0)) (.cse3 (<= 0 ~id1~0)) (.cse9 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse32 (* (div ~r1~0 256) 256)) (.cse4 (<= .cse10 1)) (.cse11 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse5 (<= .cse34 ~id2~0)) (.cse6 (let ((.cse35 (or (= ~st1~0 1) .cse12))) (or (and (= ~st3~0 1) .cse35) (and .cse31 .cse35)))) (.cse7 (= .cse34 0)) (.cse13 (= ~mode1~0 0)) (.cse8 (let ((.cse33 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse33) (<= ~st3~0 0)) (<= 1 .cse33))))) (or (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse3 .cse4 (= ~mode1~0 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 (<= .cse10 0) (= (+ ~st2~0 ~st1~0) 0) .cse11 .cse5 .cse12 .cse7 .cse13 (<= 0 ~st3~0)) (and (let ((.cse14 (mod ~p3_old~0 256))) (or (and (not (< ~id1~0 .cse14)) (<= 0 ~p3_old~0) (not (= .cse14 ~id1~0)) (< ~p3_old~0 256)) (and (<= 0 (+ ~p3_old~0 256)) (not (<= .cse14 127)) (< ~p3_old~0 0)))) .cse3 .cse9 (= (* 256 (div ~mode1~0 256)) ~mode1~0) (= ~send3~0 ~id3~0) (let ((.cse16 (= ~p2~0 0)) (.cse25 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse18 (<= ~id1~0 127)) (.cse19 (= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse21 (<= ~id3~0 127)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (<= ~id2~0 127)) (.cse24 (= ~p3~0 0)) (.cse26 (= ~p1~0 0)) (.cse27 (= ~__return_main~0 0)) (.cse28 (= |#NULL.base| 0)) (.cse29 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse20 (+ ~p2_new~0 1)) (.cse15 (+ ~p3_new~0 1)) (.cse17 (+ ~p1_new~0 1))) (and (<= 0 .cse15) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) .cse16 (<= .cse17 0) (<= 0 ~mode3~0) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (<= ~mode2~0 1) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= ~mode3~0 1) (<= 0 ~send2~0) .cse18 .cse19 (<= 0 .cse20) (<= ~mode1~0 1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse20 0) .cse21 .cse22 (<= 0 ~mode2~0) .cse23 (<= .cse15 0) .cse24 (<= 0 .cse17) (= (ite .cse25 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) .cse26 (<= 0 |#StackHeapBarrier|) .cse27 .cse28 .cse29)) (let ((.cse30 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (<= 0 ~id3~0) (= (select |#length| 3) 12) (= ~nomsg~0 ~p1_new~0) .cse16 (= ~__return_1465~0 0) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~p3_new~0 ~nomsg~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= |ULTIMATE.start_main_~init__tmp~0#1| ~__return_1389~0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse25 .cse18 (= ~nomsg~0 ~p2_new~0) (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) .cse19 (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) .cse21 (= (select |#valid| 2) 1) .cse22 (= ~p3_old~0 ~nomsg~0) (= (select .cse30 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) .cse23 .cse24 (= (select .cse30 1) 0) .cse26 (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) .cse27 (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0) .cse28 .cse29)))) .cse31 .cse11 (<= 0 ~st2~0) .cse5 .cse12 .cse7 (<= ~st2~0 0) (= ~send1~0 ~id1~0) (<= ~r1~0 .cse32)) (and .cse0 .cse1 .cse2 .cse3 .cse9 (< (+ .cse32 2) ~r1~0) .cse4 .cse11 .cse5 .cse6 .cse7 .cse13 .cse8)))) [2022-11-22 02:02:51,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:02:51,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,591 INFO L895 garLoopResultBuilder]: At program point L273(lines 161 286) the Hoare annotation is: (let ((.cse9 (= ~st1~0 0)) (.cse17 (+ ~nomsg~0 1))) (let ((.cse2 (= ~mode3~0 1)) (.cse3 (= ~mode2~0 1)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (= ~mode1~0 1)) (.cse0 (<= .cse17 ~id3~0)) (.cse1 (<= .cse17 ~send3~0)) (.cse4 (<= .cse17 ~send2~0)) (.cse5 (<= 0 ~id1~0)) (.cse12 (or (= ~st3~0 0) (= ~st3~0 1))) (.cse8 (<= .cse17 ~id2~0)) (.cse10 (= .cse17 0)) (.cse13 (let ((.cse16 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse16) (<= ~st3~0 0)) (<= 1 .cse16)))) (.cse11 (let ((.cse14 (+ ~st2~0 ~st1~0)) (.cse15 (= ~st1~0 1))) (or (and (= .cse14 0) .cse9) (and .cse15 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse14 1) (or .cse15 .cse9)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse10 (<= 0 ~st3~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse6 1) .cse7 .cse12 .cse8 .cse10 .cse13 .cse11) (and .cse0 .cse1 .cse4 .cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse12 .cse8 .cse10 (= ~mode1~0 0) .cse13 .cse11)))) [2022-11-22 02:02:51,592 INFO L895 garLoopResultBuilder]: At program point L240(lines 181 241) the Hoare annotation is: (let ((.cse18 (+ ~nomsg~0 1)) (.cse13 (= ~st1~0 0)) (.cse10 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse3 (<= 0 ~id1~0)) (.cse4 (<= .cse10 1)) (.cse6 (let ((.cse20 (or (= ~st1~0 1) .cse13))) (or (and (= ~st3~0 1) .cse20) (and (= ~st3~0 0) .cse20)))) (.cse7 (= .cse18 0)) (.cse8 (let ((.cse19 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse19) (<= ~st3~0 0)) (<= 1 .cse19)))) (.cse0 (<= .cse18 ~id3~0)) (.cse1 (<= .cse18 ~send3~0)) (.cse2 (<= .cse18 ~send2~0)) (.cse9 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse15 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse11 (+ ~st2~0 ~st1~0)) (.cse16 (<= 0 ~st1~0)) (.cse12 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse5 (<= .cse18 ~id2~0)) (.cse17 (<= .cse18 0)) (.cse14 (= ~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 .cse3 .cse9 (<= .cse10 0) (= .cse11 0) .cse12 .cse5 .cse13 .cse7 .cse14 (<= 0 ~st3~0)) (and .cse0 .cse1 .cse2 .cse3 .cse9 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse15 .cse4 .cse16 .cse12 .cse5 .cse6 .cse17 .cse7 .cse14 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse15 (= |ULTIMATE.start_main_~check__tmp~0#1| 0) (<= .cse11 2147483647) .cse16 .cse12 .cse5 .cse17 .cse14 (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)) (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0)) (<= .cse10 2147483647))))) [2022-11-22 02:02:51,592 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 392) no Hoare annotation was computed. [2022-11-22 02:02:51,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,592 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 432) no Hoare annotation was computed. [2022-11-22 02:02:51,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,593 INFO L895 garLoopResultBuilder]: At program point L324(lines 312 325) the Hoare annotation is: (let ((.cse12 (= ~st1~0 0)) (.cse15 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse15 ~id3~0)) (.cse1 (<= .cse15 ~send3~0)) (.cse2 (<= .cse15 ~send2~0)) (.cse3 (<= 0 ~id1~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (= ~mode1~0 1)) (.cse8 (<= .cse15 ~id2~0)) (.cse9 (= .cse15 0)) (.cse11 (let ((.cse13 (+ ~st2~0 ~st1~0)) (.cse14 (= ~st1~0 1))) (or (and (= .cse13 0) .cse12) (and .cse14 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse13 1) (or .cse14 .cse12)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 (or (= ~st3~0 0) (= ~st3~0 1)) .cse8 .cse9 (let ((.cse10 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse10) (<= ~st3~0 0)) (<= 1 .cse10))) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse12 .cse9 (<= 0 ~st3~0) .cse11)))) [2022-11-22 02:02:51,593 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 381) no Hoare annotation was computed. [2022-11-22 02:02:51,594 INFO L895 garLoopResultBuilder]: At program point L374(lines 362 375) the Hoare annotation is: (let ((.cse9 (= ~st1~0 0)) (.cse24 (+ ~nomsg~0 1))) (let ((.cse13 (<= .cse24 ~id3~0)) (.cse14 (<= .cse24 ~send3~0)) (.cse15 (<= .cse24 ~send2~0)) (.cse1 (<= 0 ~id1~0)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse12 (* (div ~r1~0 256) 256)) (.cse16 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse17 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse8 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (= ~st3~0 0)) (.cse18 (<= .cse24 ~id2~0)) (.cse11 (= .cse24 0)) (.cse19 (= ~mode1~0 0)) (.cse20 (let ((.cse22 (+ ~st2~0 ~st1~0)) (.cse23 (= ~st1~0 1))) (or (and (= .cse22 0) .cse9) (and .cse23 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse22 1) (or .cse23 .cse9)))))) (or (let ((.cse10 (+ ~p2_new~0 1)) (.cse6 (+ ~p3_new~0 1)) (.cse3 (+ ~p1_new~0 1))) (and (let ((.cse0 (mod ~p3_old~0 256))) (or (and (not (< ~id1~0 .cse0)) (<= 0 ~p3_old~0) (not (= .cse0 ~id1~0)) (< ~p3_old~0 256)) (and (<= 0 (+ ~p3_old~0 256)) (not (<= .cse0 127)) (< ~p3_old~0 0)))) .cse1 .cse2 (<= .cse3 0) (let ((.cse4 (= |ULTIMATE.start_main_~main__c1~0#1| 0))) (or (let ((.cse5 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= (select |#length| 3) 12) (= ~__return_1465~0 0) (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~p3_new~0 ~nomsg~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse4 (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~p3_old~0 ~nomsg~0) (= (select .cse5 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) (= (select .cse5 1) 0) (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0))) (and (<= 0 .cse6) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) (<= 0 ~mode3~0) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (<= ~mode2~0 1) (<= ~mode3~0 1) (<= ~mode1~0 1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= 0 ~mode2~0) (= (ite .cse4 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0)))) (= ~send3~0 ~id3~0) .cse7 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (= (mod ~mode1~0 256) 0) (<= |#NULL.offset| 0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) .cse8 (<= 0 ~st2~0) (<= ~p1~0 0) (<= ~__return_main~0 0) (<= 0 ~p2~0) (<= 0 ~send2~0) (<= ~id1~0 127) .cse9 (<= 0 .cse10) (<= |ULTIMATE.start_main_~main__i2~0#1| 0) .cse11 (<= ~st2~0 0) (<= .cse10 0) (= ~send1~0 ~id1~0) (<= ~r1~0 .cse12) (<= 0 ~__return_main~0) (<= ~id3~0 127) (<= 0 ~id2~0) (<= ~p2~0 0) (<= ~id2~0 127) (<= .cse6 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= 0 |#NULL.offset|) (= ~p3~0 0) (<= 0 .cse3) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (<= 0 ~p1~0) (<= 0 |#StackHeapBarrier|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0))) (and .cse13 .cse14 .cse15 .cse1 .cse2 .cse16 (<= .cse17 0) .cse8 .cse18 .cse9 .cse11 .cse19 (<= 0 ~st3~0) .cse20) (and .cse13 .cse14 .cse15 .cse1 .cse2 (< (+ .cse12 2) ~r1~0) .cse16 (<= .cse17 1) .cse8 (or .cse7 (= ~st3~0 1)) .cse18 .cse11 .cse19 (let ((.cse21 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse21) (<= ~st3~0 0)) (<= 1 .cse21))) .cse20)))) [2022-11-22 02:02:51,595 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,595 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,595 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,595 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,595 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-22 02:02:51,595 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,596 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 427) no Hoare annotation was computed. [2022-11-22 02:02:51,596 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-11-22 02:02:51,596 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 467) no Hoare annotation was computed. [2022-11-22 02:02:51,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-22 02:02:51,596 INFO L895 garLoopResultBuilder]: At program point L161(lines 161 286) the Hoare annotation is: (let ((.cse23 (+ ~st3~0 ~st2~0))) (let ((.cse19 (= ~st1~0 0)) (.cse22 (+ ~nomsg~0 1)) (.cse12 (<= 0 .cse23)) (.cse13 (<= ~st3~0 0))) (let ((.cse2 (= ~mode3~0 1)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse9 (= ~mode1~0 0)) (.cse6 (= ~st3~0 1)) (.cse10 (or (and .cse12 .cse13) (<= 1 .cse23))) (.cse0 (<= .cse22 ~id3~0)) (.cse1 (<= .cse22 ~send3~0)) (.cse15 (= ~mode2~0 1)) (.cse3 (<= .cse22 ~send2~0)) (.cse4 (<= 0 ~id1~0)) (.cse16 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse17 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse18 (= ~mode1~0 1)) (.cse7 (<= .cse22 ~id2~0)) (.cse8 (= .cse22 0)) (.cse14 (<= 0 ~st3~0)) (.cse11 (let ((.cse20 (+ ~st2~0 ~st1~0)) (.cse21 (= ~st1~0 1))) (or (and (= .cse20 0) .cse19) (and .cse21 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse20 1) (or .cse21 .cse19)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse14 .cse11) (and .cse0 .cse1 .cse15 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse16 1) .cse17 .cse18 (or (= ~st3~0 0) .cse6) .cse7 .cse8 .cse10 .cse11) (and .cse0 .cse1 .cse15 .cse3 .cse4 (<= .cse16 0) .cse17 .cse18 .cse7 .cse19 .cse8 .cse14 .cse11))))) [2022-11-22 02:02:51,597 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-11-22 02:02:51,597 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 380) no Hoare annotation was computed. [2022-11-22 02:02:51,597 INFO L895 garLoopResultBuilder]: At program point L228(lines 183 235) the Hoare annotation is: (let ((.cse19 (+ ~nomsg~0 1)) (.cse18 (<= ~st3~0 0)) (.cse8 (= ~st1~0 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse10 (= ~mode1~0 0)) (.cse11 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2)))) (.cse12 (<= .cse5 1)) (.cse13 (let ((.cse21 (or (= ~st1~0 1) .cse8))) (or (and (= ~st3~0 1) .cse21) (and (= ~st3~0 0) .cse21)))) (.cse14 (let ((.cse20 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse20) .cse18) (<= 1 .cse20)))) (.cse0 (<= .cse19 ~id3~0)) (.cse1 (<= .cse19 ~send3~0)) (.cse15 (= ~mode3~0 1)) (.cse16 (= ~mode2~0 1)) (.cse2 (<= .cse19 ~send2~0)) (.cse3 (<= 0 ~id1~0)) (.cse17 (= ~mode1~0 1)) (.cse7 (<= .cse19 ~id2~0)) (.cse9 (= .cse19 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) (= (+ ~st2~0 ~st1~0) 0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ~st3~0)) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse7 .cse13 .cse9 .cse10 .cse14) (and .cse0 .cse11 .cse1 .cse15 .cse16 .cse2 .cse3 .cse12 .cse17 .cse7 .cse13 .cse9 .cse14) (and .cse0 .cse1 .cse15 .cse16 .cse18 .cse2 .cse3 (<= 0 .cse5) .cse17 .cse7 .cse8 .cse9 (<= ~st2~0 0))))) [2022-11-22 02:02:51,597 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 422) no Hoare annotation was computed. [2022-11-22 02:02:51,597 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,597 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,598 INFO L895 garLoopResultBuilder]: At program point L146(lines 146 331) the Hoare annotation is: (let ((.cse15 (= ~st1~0 1)) (.cse13 (= ~st1~0 0))) (let ((.cse17 (+ ~nomsg~0 1)) (.cse16 (or .cse15 .cse13))) (let ((.cse3 (or (and (= ~st3~0 1) .cse16) (= ~st3~0 0))) (.cse11 (let ((.cse18 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse18) (<= ~st3~0 0)) (<= 1 .cse18)))) (.cse0 (<= .cse17 ~id3~0)) (.cse1 (<= .cse17 ~send3~0)) (.cse2 (<= .cse17 ~send2~0)) (.cse4 (<= 0 ~id1~0)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (= ~mode1~0 1)) (.cse9 (<= .cse17 ~id2~0)) (.cse10 (= .cse17 0)) (.cse12 (let ((.cse14 (+ ~st2~0 ~st1~0))) (or (and (= .cse14 0) .cse13) (and .cse15 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse14 1) .cse16))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse6 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse3 .cse4 .cse9 .cse10 (= ~mode1~0 0) (<= .cse6 2) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse13 .cse10 (<= 0 ~st3~0) .cse12))))) [2022-11-22 02:02:51,598 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,598 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 387) no Hoare annotation was computed. [2022-11-22 02:02:51,598 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-22 02:02:51,598 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 462) no Hoare annotation was computed. [2022-11-22 02:02:51,599 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,599 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-11-22 02:02:51,599 INFO L895 garLoopResultBuilder]: At program point L279(lines 267 280) the Hoare annotation is: (let ((.cse12 (= ~st1~0 0)) (.cse15 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse15 ~id3~0)) (.cse1 (<= .cse15 ~send3~0)) (.cse2 (= ~mode2~0 1)) (.cse3 (<= .cse15 ~send2~0)) (.cse4 (<= 0 ~id1~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (= ~mode1~0 1)) (.cse8 (<= .cse15 ~id2~0)) (.cse9 (= .cse15 0)) (.cse11 (let ((.cse13 (+ ~st2~0 ~st1~0)) (.cse14 (= ~st1~0 1))) (or (and (= .cse13 0) .cse12) (and .cse14 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse13 1) (or .cse14 .cse12)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 (or (= ~st3~0 0) (= ~st3~0 1)) .cse8 .cse9 (let ((.cse10 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse10) (<= ~st3~0 0)) (<= 1 .cse10))) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse12 .cse9 (<= 0 ~st3~0) .cse11)))) [2022-11-22 02:02:51,599 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-22 02:02:51,599 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 375) no Hoare annotation was computed. [2022-11-22 02:02:51,600 INFO L895 garLoopResultBuilder]: At program point L329(lines 310 330) the Hoare annotation is: (let ((.cse12 (= ~st1~0 0)) (.cse15 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse15 ~id3~0)) (.cse1 (<= .cse15 ~send3~0)) (.cse2 (<= .cse15 ~send2~0)) (.cse3 (<= 0 ~id1~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (= ~mode1~0 1)) (.cse8 (<= .cse15 ~id2~0)) (.cse9 (= .cse15 0)) (.cse11 (let ((.cse13 (+ ~st2~0 ~st1~0)) (.cse14 (= ~st1~0 1))) (or (and (= .cse13 0) .cse12) (and .cse14 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse13 1) (or .cse14 .cse12)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 (or (= ~st3~0 0) (= ~st3~0 1)) .cse8 .cse9 (let ((.cse10 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse10) (<= ~st3~0 0)) (<= 1 .cse10))) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse12 .cse9 (<= 0 ~st3~0) .cse11)))) [2022-11-22 02:02:51,600 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 417) no Hoare annotation was computed. [2022-11-22 02:02:51,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,600 INFO L895 garLoopResultBuilder]: At program point L379(lines 360 380) the Hoare annotation is: (let ((.cse9 (= ~st1~0 0)) (.cse16 (+ ~nomsg~0 1))) (let ((.cse0 (<= .cse16 ~id3~0)) (.cse1 (<= .cse16 ~send3~0)) (.cse2 (<= .cse16 ~send2~0)) (.cse3 (<= 0 ~id1~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (<= .cse16 ~id2~0)) (.cse10 (= .cse16 0)) (.cse11 (= ~mode1~0 0)) (.cse12 (let ((.cse14 (+ ~st2~0 ~st1~0)) (.cse15 (= ~st1~0 1))) (or (and (= .cse14 0) .cse9) (and .cse15 (or (= (+ ~st2~0 1) 0) (= ~st2~0 1))) (and (= .cse14 1) (or .cse15 .cse9)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 ~st3~0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse5 (<= .cse6 1) .cse7 (or (= ~st3~0 0) (= ~st3~0 1)) .cse8 .cse10 .cse11 (let ((.cse13 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse13) (<= ~st3~0 0)) (<= 1 .cse13))) .cse12)))) [2022-11-22 02:02:51,600 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,601 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,601 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,601 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 457) no Hoare annotation was computed. [2022-11-22 02:02:51,601 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,601 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-11-22 02:02:51,601 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) (= ~mode2~0 1) (<= .cse0 ~send2~0) (<= 0 ~id1~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (= ~mode1~0 1) (or (= ~st3~0 0) (= ~st3~0 1)) (<= .cse0 ~id2~0) (or (= ~st1~0 1) (= ~st1~0 0)) (= .cse0 0) (let ((.cse1 (+ ~st3~0 ~st2~0))) (or (and (<= 0 .cse1) (<= ~st3~0 0)) (<= 1 .cse1))))) [2022-11-22 02:02:51,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-22 02:02:51,602 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-11-22 02:02:51,602 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-22 02:02:51,602 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 412) no Hoare annotation was computed. [2022-11-22 02:02:51,602 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-11-22 02:02:51,602 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 452) no Hoare annotation was computed. [2022-11-22 02:02:51,605 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, 1] [2022-11-22 02:02:51,608 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:02:51,679 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,680 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,680 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,699 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,699 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,699 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,699 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,700 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,700 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,700 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,706 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,708 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,708 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,709 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,710 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,710 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,712 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,712 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,713 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,713 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,714 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,714 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,714 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,715 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,715 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:02:51 BoogieIcfgContainer [2022-11-22 02:02:51,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:02:51,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:02:51,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:02:51,720 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:02:51,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:57:53" (3/4) ... [2022-11-22 02:02:51,723 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:02:51,741 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-22 02:02:51,741 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-22 02:02:51,742 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 02:02:51,743 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:02:51,772 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 1) && mode1 == 1) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && st2 + st1 == 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3)) || ((((((((((((((((((!(id1 < p3_\old % 256) && 0 <= p3_\old) && !(p3_\old % 256 == id1)) && p3_\old < 256) || ((0 <= p3_\old + 256 && !(p3_\old % 256 <= 127)) && p3_\old < 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && send3 == id3) && (((((((((((((((((((((((((((((((((0 <= p3_new + 1 && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && check__tmp == 1) && mode2 <= 1) && __return_1389 <= 1) && 1 <= __return_1389) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= mode2) && id2 <= 127) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && #NULL == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0))) && st3 == 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && st2 <= 0) && send1 == id1) && r1 <= r1 / 256 * 256)) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) [2022-11-22 02:02:51,772 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((!(id1 < p3_\old % 256) && 0 <= p3_\old) && !(p3_\old % 256 == id1)) && p3_\old < 256) || ((0 <= p3_\old + 256 && !(p3_\old % 256 <= 127)) && p3_\old < 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && ((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || ((((((((((0 <= p3_new + 1 && check__tmp == __return_1465) && 0 <= mode3) && check__tmp == 1) && mode2 <= 1) && mode3 <= 1) && mode1 <= 1) && assert__arg == __tmp_1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465))) && send3 == id3) && st3 == 0) && 0 <= main__i2) && mode1 % 256 == 0) && #NULL <= 0) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 == 0) && 0 <= p2_new + 1) && main__i2 <= 0) && nomsg + 1 == 0) && st2 <= 0) && p2_new + 1 <= 0) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && p2 <= 0) && id2 <= 127) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) [2022-11-22 02:02:51,820 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:02:51,820 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:02:51,821 INFO L158 Benchmark]: Toolchain (without parser) took 299934.09ms. Allocated memory was 157.3MB in the beginning and 589.3MB in the end (delta: 432.0MB). Free memory was 118.5MB in the beginning and 380.5MB in the end (delta: -262.0MB). Peak memory consumption was 169.5MB. Max. memory is 16.1GB. [2022-11-22 02:02:51,821 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 119.5MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:02:51,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.28ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 120.3MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-22 02:02:51,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.48ms. Allocated memory is still 157.3MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:02:51,822 INFO L158 Benchmark]: Boogie Preprocessor took 25.24ms. Allocated memory is still 157.3MB. Free memory was 118.2MB in the beginning and 116.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:02:51,822 INFO L158 Benchmark]: RCFGBuilder took 750.84ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 84.6MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-22 02:02:51,823 INFO L158 Benchmark]: TraceAbstraction took 298444.69ms. Allocated memory was 157.3MB in the beginning and 589.3MB in the end (delta: 432.0MB). Free memory was 84.0MB in the beginning and 385.7MB in the end (delta: -301.8MB). Peak memory consumption was 330.8MB. Max. memory is 16.1GB. [2022-11-22 02:02:51,823 INFO L158 Benchmark]: Witness Printer took 100.85ms. Allocated memory is still 589.3MB. Free memory was 385.7MB in the beginning and 380.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-22 02:02:51,824 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.28ms. Allocated memory is still 119.5MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.28ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 120.3MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.48ms. Allocated memory is still 157.3MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.24ms. Allocated memory is still 157.3MB. Free memory was 118.2MB in the beginning and 116.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 750.84ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 84.6MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 298444.69ms. Allocated memory was 157.3MB in the beginning and 589.3MB in the end (delta: 432.0MB). Free memory was 84.0MB in the beginning and 385.7MB in the end (delta: -301.8MB). Peak memory consumption was 330.8MB. Max. memory is 16.1GB. * Witness Printer took 100.85ms. Allocated memory is still 589.3MB. Free memory was 385.7MB in the beginning and 380.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 298.3s, OverallIterations: 25, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 42.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6692 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6692 mSDsluCounter, 3984 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2255 mSDsCounter, 416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4549 IncrementalHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 416 mSolverCounterUnsat, 1729 mSDtfsCounter, 4549 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1124 GetRequests, 669 SyntacticMatches, 78 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19513 ImplicationChecksByTransitivity, 127.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1295occurred in iteration=13, InterpolantAutomatonStates: 208, 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, 25 MinimizatonAttempts, 757 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 179 NumberOfFragments, 4807 HoareAnnotationTreeSize, 17 FomulaSimplifications, 152534 FormulaSimplificationTreeSizeReduction, 11.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 287712 FormulaSimplificationTreeSizeReductionInter, 30.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 87.6s InterpolantComputationTime, 2002 NumberOfCodeBlocks, 2002 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 79046 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 608/1171 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: 13.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 80, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 352, TOOLS_POST_TIME: 11.9s, 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: 352, TOOLS_QUANTIFIERELIM_TIME: 11.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 426, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 37, DOMAIN_JOIN_TIME: 1.3s, 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: 80, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 10.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 10.1s, 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: 13020, DAG_COMPRESSION_RETAINED_NODES: 225, 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) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && st2 + st1 == 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3) || ((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2))) || ((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 1) && mode1 == 1) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && st3 <= 0) && nomsg + 1 <= send2) && 0 <= id1) && 0 <= st3 + st2 + st1) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && st2 <= 0) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || st3 == 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || st3 == 0)) && 0 <= id1) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && st3 + st2 + st1 <= 2) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || st3 == 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || st3 == 0)) && 0 <= id1) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && st3 + st2 + st1 <= 2) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && (st1 == 1 || st1 == 0)) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 == 1) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && 0 <= st3 + st2) && nomsg + 1 <= send3) && mode3 == 1) && st3 <= 0) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 1) && mode1 == 1) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && st2 + st1 == 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3)) || (((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 <= 0) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2))) || ((((((((((((((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) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && (st1 == 1 || st1 == 0)) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 0) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || (((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 == 1) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && 0 <= st3 + st2) && nomsg + 1 <= send3) && mode3 == 1) && st3 <= 0) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && mode1 == 1) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) - InvariantResult [Line: 114]: Loop Invariant [2022-11-22 02:02:51,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,853 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,854 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,855 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,856 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,857 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,858 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,858 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,858 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,859 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,860 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && st3 + st2 + st1 <= 1) && mode1 == 1) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && st2 + st1 == 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3)) || ((((((((((((((((((!(id1 < p3_\old % 256) && 0 <= p3_\old) && !(p3_\old % 256 == id1)) && p3_\old < 256) || ((0 <= p3_\old + 256 && !(p3_\old % 256 <= 127)) && p3_\old < 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && send3 == id3) && (((((((((((((((((((((((((((((((((0 <= p3_new + 1 && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && check__tmp == 1) && mode2 <= 1) && __return_1389 <= 1) && 1 <= __return_1389) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= mode2) && id2 <= 127) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && #NULL == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0))) && st3 == 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && st2 <= 0) && send1 == id1) && r1 <= r1 / 256 * 256)) || ((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && ((st3 == 1 && (st1 == 1 || st1 == 0)) || (st3 == 0 && (st1 == 1 || st1 == 0)))) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) - InvariantResult [Line: 362]: Loop Invariant [2022-11-22 02:02:51,862 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,862 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,863 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,864 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,865 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,865 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,865 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,866 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,867 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-22 02:02:51,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-22 02:02:51,868 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,869 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-22 02:02:51,869 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-22 02:02:51,869 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,870 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-22 02:02:51,870 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-22 02:02:51,870 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-22 02:02:51,871 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-22 02:02:51,871 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((!(id1 < p3_\old % 256) && 0 <= p3_\old) && !(p3_\old % 256 == id1)) && p3_\old < 256) || ((0 <= p3_\old + 256 && !(p3_\old % 256 <= 127)) && p3_\old < 0)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && ((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) || ((((((((((0 <= p3_new + 1 && check__tmp == __return_1465) && 0 <= mode3) && check__tmp == 1) && mode2 <= 1) && mode3 <= 1) && mode1 <= 1) && assert__arg == __tmp_1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465))) && send3 == id3) && st3 == 0) && 0 <= main__i2) && mode1 % 256 == 0) && #NULL <= 0) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 == 0) && 0 <= p2_new + 1) && main__i2 <= 0) && nomsg + 1 == 0) && st2 <= 0) && p2_new + 1 <= 0) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && p2 <= 0) && id2 <= 127) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) || (((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && st1 == 0) && nomsg + 1 == 0) && mode1 == 0) && 0 <= st3) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0))))) || ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 1) && 256 * (mode3 / 256) == mode3) && (st3 == 0 || st3 == 1)) && nomsg + 1 <= id2) && nomsg + 1 == 0) && mode1 == 0) && ((0 <= st3 + st2 && st3 <= 0) || 1 <= st3 + st2)) && (((st2 + st1 == 0 && st1 == 0) || (st1 == 1 && (st2 + 1 == 0 || st2 == 1))) || (st2 + st1 == 1 && (st1 == 1 || st1 == 0)))) RESULT: Ultimate proved your program to be correct! [2022-11-22 02:02:51,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281ad36c-1857-479b-bec6-908316580317/bin/utaipan-g80aRyZoba/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