./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 2329fc70 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_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.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_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8 --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 Automizer --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-2329fc7 [2022-12-13 17:41:34,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:41:34,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:41:34,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:41:34,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:41:34,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:41:34,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:41:34,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:41:34,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:41:34,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:41:34,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:41:34,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:41:34,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:41:34,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:41:34,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:41:34,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:41:34,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:41:34,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:41:34,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:41:34,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:41:34,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:41:34,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:41:34,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:41:34,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:41:34,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:41:34,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:41:34,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:41:34,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:41:34,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:41:34,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:41:34,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:41:34,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:41:34,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:41:34,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:41:34,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:41:34,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:41:34,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:41:34,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:41:34,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:41:34,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:41:34,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:41:34,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 17:41:34,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:41:34,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:41:34,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:41:34,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:41:34,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:41:34,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:41:34,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:41:34,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:41:34,516 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:41:34,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:41:34,517 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:41:34,521 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:41:34,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:41:34,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:41:34,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:41:34,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:41:34,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:41:34,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:41:34,522 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 17:41:34,523 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:41:34,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:41:34,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:41:34,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:41:34,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:41:34,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:41:34,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:41:34,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:41:34,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:41:34,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:41:34,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:41:34,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:41:34,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:41:34,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:41:34,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:41:34,526 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:41:34,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:41:34,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:41:34,526 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/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_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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-12-13 17:41:34,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:41:34,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:41:34,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:41:34,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:41:34,759 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:41:34,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-13 17:41:37,396 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:41:37,558 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:41:37,558 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-13 17:41:37,564 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/data/3d0d1e5eb/aaa4d821b6334df4af3fdd136607a848/FLAGa0613068d [2022-12-13 17:41:37,577 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/data/3d0d1e5eb/aaa4d821b6334df4af3fdd136607a848 [2022-12-13 17:41:37,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:41:37,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:41:37,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:41:37,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:41:37,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:41:37,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4ac455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37, skipping insertion in model container [2022-12-13 17:41:37,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:41:37,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:41:37,765 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_d9eeb83a-2566-4be4-8500-bffe111ab093/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-12-13 17:41:37,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:41:37,791 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:41:37,821 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_d9eeb83a-2566-4be4-8500-bffe111ab093/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-12-13 17:41:37,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:41:37,846 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:41:37,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37 WrapperNode [2022-12-13 17:41:37,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:41:37,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:41:37,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:41:37,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:41:37,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,881 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 280 [2022-12-13 17:41:37,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:41:37,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:41:37,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:41:37,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:41:37,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,902 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:41:37,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:41:37,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:41:37,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:41:37,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (1/1) ... [2022-12-13 17:41:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:41:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:37,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:37,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:41:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:41:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:41:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:41:37,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:41:38,064 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:41:38,066 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:41:38,326 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:41:38,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:41:38,331 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:41:38,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:38 BoogieIcfgContainer [2022-12-13 17:41:38,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:41:38,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:41:38,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:41:38,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:41:38,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:41:37" (1/3) ... [2022-12-13 17:41:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16e47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:41:38, skipping insertion in model container [2022-12-13 17:41:38,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:37" (2/3) ... [2022-12-13 17:41:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16e47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:41:38, skipping insertion in model container [2022-12-13 17:41:38,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:38" (3/3) ... [2022-12-13 17:41:38,339 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-13 17:41:38,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:41:38,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-12-13 17:41:38,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:41:38,414 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=PETRI_NET, 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;@41ff14b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:41:38,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-12-13 17:41:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 89 states have internal predecessors, (130), 0 states have call successors, (0), 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-12-13 17:41:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 17:41:38,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:38,422 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] [2022-12-13 17:41:38,423 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-12-13 17:41:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:38,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1523339456, now seen corresponding path program 1 times [2022-12-13 17:41:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:38,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498838847] [2022-12-13 17:41:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:38,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498838847] [2022-12-13 17:41:38,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498838847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:38,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:38,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:41:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311175498] [2022-12-13 17:41:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:38,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 17:41:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:38,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 17:41:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:41:38,655 INFO L87 Difference]: Start difference. First operand has 90 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 89 states have internal predecessors, (130), 0 states have call successors, (0), 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 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 17:41:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:38,677 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2022-12-13 17:41:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 17:41:38,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-12-13 17:41:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:38,688 INFO L225 Difference]: With dead ends: 93 [2022-12-13 17:41:38,688 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 17:41:38,691 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-12-13 17:41:38,695 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:38,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 17:41:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-13 17:41:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 82 states have internal predecessors, (105), 0 states have call successors, (0), 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-12-13 17:41:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-12-13 17:41:38,733 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 23 [2022-12-13 17:41:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:38,733 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-12-13 17:41:38,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 17:41:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-12-13 17:41:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 17:41:38,735 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:38,736 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] [2022-12-13 17:41:38,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:41:38,736 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-12-13 17:41:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1151032549, now seen corresponding path program 1 times [2022-12-13 17:41:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:38,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881207757] [2022-12-13 17:41:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:38,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881207757] [2022-12-13 17:41:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881207757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:38,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959694641] [2022-12-13 17:41:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:38,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:41:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:41:38,878 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:38,910 INFO L93 Difference]: Finished difference Result 203 states and 264 transitions. [2022-12-13 17:41:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 17:41:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:38,912 INFO L225 Difference]: With dead ends: 203 [2022-12-13 17:41:38,912 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 17:41:38,912 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-12-13 17:41:38,913 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:38,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 17:41:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2022-12-13 17:41:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 122 states have internal predecessors, (170), 0 states have call successors, (0), 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-12-13 17:41:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2022-12-13 17:41:38,924 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 34 [2022-12-13 17:41:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:38,925 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2022-12-13 17:41:38,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2022-12-13 17:41:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 17:41:38,926 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:38,927 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-12-13 17:41:38,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:41:38,927 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-12-13 17:41:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash -576537676, now seen corresponding path program 1 times [2022-12-13 17:41:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:38,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241818191] [2022-12-13 17:41:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:39,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241818191] [2022-12-13 17:41:39,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241818191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:39,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:39,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:39,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950265869] [2022-12-13 17:41:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:39,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:41:39,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:39,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:39,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:41:39,006 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-12-13 17:41:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:39,039 INFO L93 Difference]: Finished difference Result 315 states and 446 transitions. [2022-12-13 17:41:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-12-13 17:41:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:39,041 INFO L225 Difference]: With dead ends: 315 [2022-12-13 17:41:39,041 INFO L226 Difference]: Without dead ends: 211 [2022-12-13 17:41:39,042 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-12-13 17:41:39,043 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:39,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-12-13 17:41:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2022-12-13 17:41:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.5628415300546448) internal successors, (286), 194 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2022-12-13 17:41:39,073 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 35 [2022-12-13 17:41:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:39,074 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2022-12-13 17:41:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-12-13 17:41:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2022-12-13 17:41:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 17:41:39,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:39,075 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-12-13 17:41:39,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:41:39,076 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-12-13 17:41:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1557567312, now seen corresponding path program 1 times [2022-12-13 17:41:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:39,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277086463] [2022-12-13 17:41:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277086463] [2022-12-13 17:41:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277086463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223313307] [2022-12-13 17:41:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:39,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:39,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:39,172 INFO L87 Difference]: Start difference. First operand 195 states and 286 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-12-13 17:41:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:39,275 INFO L93 Difference]: Finished difference Result 368 states and 553 transitions. [2022-12-13 17:41:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:39,275 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-12-13 17:41:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:39,278 INFO L225 Difference]: With dead ends: 368 [2022-12-13 17:41:39,278 INFO L226 Difference]: Without dead ends: 365 [2022-12-13 17:41:39,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:39,279 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:39,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 142 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-13 17:41:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2022-12-13 17:41:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 344 states have (on average 1.566860465116279) internal successors, (539), 355 states have internal predecessors, (539), 0 states have call successors, (0), 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-12-13 17:41:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2022-12-13 17:41:39,320 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 36 [2022-12-13 17:41:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:39,321 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2022-12-13 17:41:39,321 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-12-13 17:41:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2022-12-13 17:41:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 17:41:39,322 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:39,322 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-12-13 17:41:39,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:41:39,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1039946552, now seen corresponding path program 1 times [2022-12-13 17:41:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:39,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341675053] [2022-12-13 17:41:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:39,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341675053] [2022-12-13 17:41:39,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341675053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:39,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:39,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140708799] [2022-12-13 17:41:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:39,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:39,395 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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-12-13 17:41:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:39,544 INFO L93 Difference]: Finished difference Result 702 states and 1055 transitions. [2022-12-13 17:41:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:39,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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-12-13 17:41:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:39,548 INFO L225 Difference]: With dead ends: 702 [2022-12-13 17:41:39,548 INFO L226 Difference]: Without dead ends: 699 [2022-12-13 17:41:39,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:39,550 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 233 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:39,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 254 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-12-13 17:41:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 518. [2022-12-13 17:41:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 506 states have (on average 1.551383399209486) internal successors, (785), 517 states have internal predecessors, (785), 0 states have call successors, (0), 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-12-13 17:41:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 785 transitions. [2022-12-13 17:41:39,607 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 785 transitions. Word has length 37 [2022-12-13 17:41:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:39,608 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 785 transitions. [2022-12-13 17:41:39,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 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-12-13 17:41:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 785 transitions. [2022-12-13 17:41:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 17:41:39,609 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:39,609 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-12-13 17:41:39,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:41:39,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2121395118, now seen corresponding path program 1 times [2022-12-13 17:41:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:39,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916958150] [2022-12-13 17:41:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916958150] [2022-12-13 17:41:39,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916958150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:39,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:39,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863392867] [2022-12-13 17:41:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:39,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:39,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:39,684 INFO L87 Difference]: Start difference. First operand 518 states and 785 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-12-13 17:41:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:39,885 INFO L93 Difference]: Finished difference Result 864 states and 1315 transitions. [2022-12-13 17:41:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:41:39,885 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-12-13 17:41:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:39,887 INFO L225 Difference]: With dead ends: 864 [2022-12-13 17:41:39,887 INFO L226 Difference]: Without dead ends: 861 [2022-12-13 17:41:39,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:41:39,888 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 490 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:39,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 276 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-12-13 17:41:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 842. [2022-12-13 17:41:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 830 states have (on average 1.5409638554216867) internal successors, (1279), 841 states have internal predecessors, (1279), 0 states have call successors, (0), 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-12-13 17:41:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1279 transitions. [2022-12-13 17:41:39,951 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1279 transitions. Word has length 38 [2022-12-13 17:41:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:39,951 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1279 transitions. [2022-12-13 17:41:39,951 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-12-13 17:41:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1279 transitions. [2022-12-13 17:41:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 17:41:39,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:39,952 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, 1] [2022-12-13 17:41:39,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:41:39,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1338739078, now seen corresponding path program 1 times [2022-12-13 17:41:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:39,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61540270] [2022-12-13 17:41:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61540270] [2022-12-13 17:41:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61540270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:40,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:40,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963952013] [2022-12-13 17:41:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:40,008 INFO L87 Difference]: Start difference. First operand 842 states and 1279 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-13 17:41:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:40,317 INFO L93 Difference]: Finished difference Result 2668 states and 4039 transitions. [2022-12-13 17:41:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:41:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-12-13 17:41:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:40,329 INFO L225 Difference]: With dead ends: 2668 [2022-12-13 17:41:40,329 INFO L226 Difference]: Without dead ends: 1837 [2022-12-13 17:41:40,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:41:40,333 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 485 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:40,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 577 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-12-13 17:41:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1325. [2022-12-13 17:41:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1313 states have (on average 1.5041888804265042) internal successors, (1975), 1324 states have internal predecessors, (1975), 0 states have call successors, (0), 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-12-13 17:41:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1975 transitions. [2022-12-13 17:41:40,446 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1975 transitions. Word has length 39 [2022-12-13 17:41:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:40,446 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1975 transitions. [2022-12-13 17:41:40,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-13 17:41:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1975 transitions. [2022-12-13 17:41:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 17:41:40,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:40,447 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, 1, 1] [2022-12-13 17:41:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:41:40,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1056432401, now seen corresponding path program 1 times [2022-12-13 17:41:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:40,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095565969] [2022-12-13 17:41:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095565969] [2022-12-13 17:41:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095565969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:40,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:40,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239074656] [2022-12-13 17:41:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:41:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:40,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:40,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:41:40,489 INFO L87 Difference]: Start difference. First operand 1325 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-13 17:41:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:40,660 INFO L93 Difference]: Finished difference Result 3585 states and 5343 transitions. [2022-12-13 17:41:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-12-13 17:41:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:40,669 INFO L225 Difference]: With dead ends: 3585 [2022-12-13 17:41:40,669 INFO L226 Difference]: Without dead ends: 2279 [2022-12-13 17:41:40,671 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-12-13 17:41:40,671 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:40,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-12-13 17:41:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2253. [2022-12-13 17:41:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2241 states have (on average 1.4881749219098617) internal successors, (3335), 2252 states have internal predecessors, (3335), 0 states have call successors, (0), 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-12-13 17:41:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3335 transitions. [2022-12-13 17:41:40,789 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3335 transitions. Word has length 40 [2022-12-13 17:41:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:40,789 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3335 transitions. [2022-12-13 17:41:40,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-13 17:41:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3335 transitions. [2022-12-13 17:41:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 17:41:40,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:40,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:40,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:41:40,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1189232762, now seen corresponding path program 1 times [2022-12-13 17:41:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:40,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127779425] [2022-12-13 17:41:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:40,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:40,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127779425] [2022-12-13 17:41:40,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127779425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:40,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:40,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795425516] [2022-12-13 17:41:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:40,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:41:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:40,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:41:40,861 INFO L87 Difference]: Start difference. First operand 2253 states and 3335 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-13 17:41:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:41,049 INFO L93 Difference]: Finished difference Result 5203 states and 7673 transitions. [2022-12-13 17:41:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-12-13 17:41:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:41,056 INFO L225 Difference]: With dead ends: 5203 [2022-12-13 17:41:41,056 INFO L226 Difference]: Without dead ends: 2969 [2022-12-13 17:41:41,057 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-12-13 17:41:41,058 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:41,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2022-12-13 17:41:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2923. [2022-12-13 17:41:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.467880453452422) internal successors, (4273), 2922 states have internal predecessors, (4273), 0 states have call successors, (0), 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-12-13 17:41:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4273 transitions. [2022-12-13 17:41:41,209 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4273 transitions. Word has length 62 [2022-12-13 17:41:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:41,210 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4273 transitions. [2022-12-13 17:41:41,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-13 17:41:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4273 transitions. [2022-12-13 17:41:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 17:41:41,211 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:41,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:41,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:41:41,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1441148811, now seen corresponding path program 1 times [2022-12-13 17:41:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511358470] [2022-12-13 17:41:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:41,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:41,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511358470] [2022-12-13 17:41:41,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511358470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:41,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:41,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:41:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319481942] [2022-12-13 17:41:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:41,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:41,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:41,380 INFO L87 Difference]: Start difference. First operand 2923 states and 4273 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-13 17:41:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:41,641 INFO L93 Difference]: Finished difference Result 5831 states and 8525 transitions. [2022-12-13 17:41:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:41,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-12-13 17:41:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:41,648 INFO L225 Difference]: With dead ends: 5831 [2022-12-13 17:41:41,648 INFO L226 Difference]: Without dead ends: 2929 [2022-12-13 17:41:41,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:41:41,651 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 145 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:41,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 217 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2022-12-13 17:41:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2923. [2022-12-13 17:41:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.456887667468224) internal successors, (4241), 2922 states have internal predecessors, (4241), 0 states have call successors, (0), 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-12-13 17:41:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4241 transitions. [2022-12-13 17:41:41,838 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4241 transitions. Word has length 66 [2022-12-13 17:41:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:41,839 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4241 transitions. [2022-12-13 17:41:41,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-13 17:41:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4241 transitions. [2022-12-13 17:41:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 17:41:41,839 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:41,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:41:41,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -692803609, now seen corresponding path program 1 times [2022-12-13 17:41:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:41,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153345338] [2022-12-13 17:41:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153345338] [2022-12-13 17:41:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153345338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:41,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651404164] [2022-12-13 17:41:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:41,904 INFO L87 Difference]: Start difference. First operand 2923 states and 4241 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-13 17:41:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:42,123 INFO L93 Difference]: Finished difference Result 3774 states and 5487 transitions. [2022-12-13 17:41:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 67 [2022-12-13 17:41:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:42,132 INFO L225 Difference]: With dead ends: 3774 [2022-12-13 17:41:42,132 INFO L226 Difference]: Without dead ends: 3769 [2022-12-13 17:41:42,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:42,134 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 116 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:42,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 280 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2022-12-13 17:41:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2933. [2022-12-13 17:41:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2921 states have (on average 1.4649092776446422) internal successors, (4279), 2932 states have internal predecessors, (4279), 0 states have call successors, (0), 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-12-13 17:41:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4279 transitions. [2022-12-13 17:41:42,330 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4279 transitions. Word has length 67 [2022-12-13 17:41:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:42,331 INFO L495 AbstractCegarLoop]: Abstraction has 2933 states and 4279 transitions. [2022-12-13 17:41:42,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-13 17:41:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4279 transitions. [2022-12-13 17:41:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:41:42,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:42,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:42,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:41:42,332 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-12-13 17:41:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1013767766, now seen corresponding path program 1 times [2022-12-13 17:41:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:42,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455407317] [2022-12-13 17:41:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:42,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455407317] [2022-12-13 17:41:42,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455407317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:42,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:42,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163240429] [2022-12-13 17:41:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:42,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:42,395 INFO L87 Difference]: Start difference. First operand 2933 states and 4279 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-12-13 17:41:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:42,598 INFO L93 Difference]: Finished difference Result 2942 states and 4283 transitions. [2022-12-13 17:41:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 68 [2022-12-13 17:41:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:42,604 INFO L225 Difference]: With dead ends: 2942 [2022-12-13 17:41:42,604 INFO L226 Difference]: Without dead ends: 2939 [2022-12-13 17:41:42,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:42,605 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:42,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2022-12-13 17:41:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2927. [2022-12-13 17:41:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2918 states have (on average 1.447909527073338) internal successors, (4225), 2926 states have internal predecessors, (4225), 0 states have call successors, (0), 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-12-13 17:41:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4225 transitions. [2022-12-13 17:41:42,749 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4225 transitions. Word has length 68 [2022-12-13 17:41:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:42,749 INFO L495 AbstractCegarLoop]: Abstraction has 2927 states and 4225 transitions. [2022-12-13 17:41:42,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-12-13 17:41:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4225 transitions. [2022-12-13 17:41:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:41:42,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:42,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:42,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:41:42,750 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2075261, now seen corresponding path program 1 times [2022-12-13 17:41:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:42,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331552718] [2022-12-13 17:41:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:42,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331552718] [2022-12-13 17:41:42,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331552718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:42,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:42,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57046585] [2022-12-13 17:41:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:42,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:42,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:42,821 INFO L87 Difference]: Start difference. First operand 2927 states and 4225 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-13 17:41:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:43,246 INFO L93 Difference]: Finished difference Result 8206 states and 11917 transitions. [2022-12-13 17:41:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 68 [2022-12-13 17:41:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:43,262 INFO L225 Difference]: With dead ends: 8206 [2022-12-13 17:41:43,262 INFO L226 Difference]: Without dead ends: 5300 [2022-12-13 17:41:43,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:43,265 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 274 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:43,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 279 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2022-12-13 17:41:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4581. [2022-12-13 17:41:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4572 states have (on average 1.4494750656167978) internal successors, (6627), 4580 states have internal predecessors, (6627), 0 states have call successors, (0), 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-12-13 17:41:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6627 transitions. [2022-12-13 17:41:43,623 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6627 transitions. Word has length 68 [2022-12-13 17:41:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:43,623 INFO L495 AbstractCegarLoop]: Abstraction has 4581 states and 6627 transitions. [2022-12-13 17:41:43,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-13 17:41:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6627 transitions. [2022-12-13 17:41:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 17:41:43,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:43,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:43,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:41:43,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1362029810, now seen corresponding path program 1 times [2022-12-13 17:41:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802445743] [2022-12-13 17:41:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:43,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802445743] [2022-12-13 17:41:43,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802445743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:43,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:43,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8121739] [2022-12-13 17:41:43,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:43,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:43,686 INFO L87 Difference]: Start difference. First operand 4581 states and 6627 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-12-13 17:41:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:44,107 INFO L93 Difference]: Finished difference Result 6262 states and 9107 transitions. [2022-12-13 17:41:44,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:44,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 69 [2022-12-13 17:41:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:44,118 INFO L225 Difference]: With dead ends: 6262 [2022-12-13 17:41:44,118 INFO L226 Difference]: Without dead ends: 6257 [2022-12-13 17:41:44,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:44,120 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 106 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:44,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 274 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2022-12-13 17:41:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 6239. [2022-12-13 17:41:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6239 states, 6230 states have (on average 1.4415730337078652) internal successors, (8981), 6238 states have internal predecessors, (8981), 0 states have call successors, (0), 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-12-13 17:41:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8981 transitions. [2022-12-13 17:41:44,401 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8981 transitions. Word has length 69 [2022-12-13 17:41:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:44,401 INFO L495 AbstractCegarLoop]: Abstraction has 6239 states and 8981 transitions. [2022-12-13 17:41:44,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-12-13 17:41:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8981 transitions. [2022-12-13 17:41:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 17:41:44,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:44,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:44,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:41:44,402 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1357684497, now seen corresponding path program 1 times [2022-12-13 17:41:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:44,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212815849] [2022-12-13 17:41:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 17:41:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:44,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212815849] [2022-12-13 17:41:44,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212815849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:44,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:44,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733380729] [2022-12-13 17:41:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:44,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:44,468 INFO L87 Difference]: Start difference. First operand 6239 states and 8981 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-13 17:41:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:44,853 INFO L93 Difference]: Finished difference Result 12880 states and 18481 transitions. [2022-12-13 17:41:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 69 [2022-12-13 17:41:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:44,864 INFO L225 Difference]: With dead ends: 12880 [2022-12-13 17:41:44,864 INFO L226 Difference]: Without dead ends: 6658 [2022-12-13 17:41:44,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:44,871 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 256 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:44,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 354 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2022-12-13 17:41:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6239. [2022-12-13 17:41:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6239 states, 6230 states have (on average 1.434510433386838) internal successors, (8937), 6238 states have internal predecessors, (8937), 0 states have call successors, (0), 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-12-13 17:41:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8937 transitions. [2022-12-13 17:41:45,225 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8937 transitions. Word has length 69 [2022-12-13 17:41:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:45,225 INFO L495 AbstractCegarLoop]: Abstraction has 6239 states and 8937 transitions. [2022-12-13 17:41:45,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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-12-13 17:41:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8937 transitions. [2022-12-13 17:41:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 17:41:45,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:45,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:45,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:41:45,227 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -64332951, now seen corresponding path program 1 times [2022-12-13 17:41:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:45,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270115015] [2022-12-13 17:41:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270115015] [2022-12-13 17:41:45,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270115015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:45,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:45,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:45,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546244370] [2022-12-13 17:41:45,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:45,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:45,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:45,300 INFO L87 Difference]: Start difference. First operand 6239 states and 8937 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-13 17:41:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:45,906 INFO L93 Difference]: Finished difference Result 10810 states and 15539 transitions. [2022-12-13 17:41:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:45,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 69 [2022-12-13 17:41:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:45,917 INFO L225 Difference]: With dead ends: 10810 [2022-12-13 17:41:45,917 INFO L226 Difference]: Without dead ends: 7066 [2022-12-13 17:41:45,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:45,922 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 251 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:45,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 383 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2022-12-13 17:41:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 7059. [2022-12-13 17:41:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7059 states, 7050 states have (on average 1.4180141843971632) internal successors, (9997), 7058 states have internal predecessors, (9997), 0 states have call successors, (0), 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-12-13 17:41:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 9997 transitions. [2022-12-13 17:41:46,293 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 9997 transitions. Word has length 69 [2022-12-13 17:41:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:46,293 INFO L495 AbstractCegarLoop]: Abstraction has 7059 states and 9997 transitions. [2022-12-13 17:41:46,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-12-13 17:41:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 9997 transitions. [2022-12-13 17:41:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 17:41:46,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:46,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:41:46,294 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash -726748712, now seen corresponding path program 1 times [2022-12-13 17:41:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:46,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150470048] [2022-12-13 17:41:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:46,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150470048] [2022-12-13 17:41:46,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150470048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:46,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:46,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078742132] [2022-12-13 17:41:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:46,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:46,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:46,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:46,353 INFO L87 Difference]: Start difference. First operand 7059 states and 9997 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-12-13 17:41:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:47,029 INFO L93 Difference]: Finished difference Result 13320 states and 19251 transitions. [2022-12-13 17:41:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:47,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 70 [2022-12-13 17:41:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:47,041 INFO L225 Difference]: With dead ends: 13320 [2022-12-13 17:41:47,041 INFO L226 Difference]: Without dead ends: 8330 [2022-12-13 17:41:47,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:47,046 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 276 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:47,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 279 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2022-12-13 17:41:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 6913. [2022-12-13 17:41:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6904 states have (on average 1.4216396292004636) internal successors, (9815), 6912 states have internal predecessors, (9815), 0 states have call successors, (0), 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-12-13 17:41:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 9815 transitions. [2022-12-13 17:41:47,436 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 9815 transitions. Word has length 70 [2022-12-13 17:41:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:47,436 INFO L495 AbstractCegarLoop]: Abstraction has 6913 states and 9815 transitions. [2022-12-13 17:41:47,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-12-13 17:41:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 9815 transitions. [2022-12-13 17:41:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 17:41:47,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:47,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:47,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:41:47,438 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1054373452, now seen corresponding path program 1 times [2022-12-13 17:41:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:47,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812729498] [2022-12-13 17:41:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:47,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812729498] [2022-12-13 17:41:47,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812729498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:47,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:47,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978557703] [2022-12-13 17:41:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:47,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:47,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:47,520 INFO L87 Difference]: Start difference. First operand 6913 states and 9815 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 17:41:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:48,028 INFO L93 Difference]: Finished difference Result 11636 states and 16733 transitions. [2022-12-13 17:41:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 71 [2022-12-13 17:41:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:48,037 INFO L225 Difference]: With dead ends: 11636 [2022-12-13 17:41:48,037 INFO L226 Difference]: Without dead ends: 7196 [2022-12-13 17:41:48,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:41:48,041 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 243 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:48,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 381 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2022-12-13 17:41:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7189. [2022-12-13 17:41:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7189 states, 7180 states have (on average 1.4171309192200556) internal successors, (10175), 7188 states have internal predecessors, (10175), 0 states have call successors, (0), 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-12-13 17:41:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7189 states to 7189 states and 10175 transitions. [2022-12-13 17:41:48,486 INFO L78 Accepts]: Start accepts. Automaton has 7189 states and 10175 transitions. Word has length 71 [2022-12-13 17:41:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 7189 states and 10175 transitions. [2022-12-13 17:41:48,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 17:41:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7189 states and 10175 transitions. [2022-12-13 17:41:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 17:41:48,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:48,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:48,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:41:48,487 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 816276294, now seen corresponding path program 1 times [2022-12-13 17:41:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:48,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694113753] [2022-12-13 17:41:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694113753] [2022-12-13 17:41:48,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694113753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:48,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:48,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865583089] [2022-12-13 17:41:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:48,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:48,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:48,547 INFO L87 Difference]: Start difference. First operand 7189 states and 10175 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 17:41:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:49,083 INFO L93 Difference]: Finished difference Result 9422 states and 13471 transitions. [2022-12-13 17:41:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 71 [2022-12-13 17:41:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:49,092 INFO L225 Difference]: With dead ends: 9422 [2022-12-13 17:41:49,092 INFO L226 Difference]: Without dead ends: 9417 [2022-12-13 17:41:49,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:49,094 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 147 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:49,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 409 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2022-12-13 17:41:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8847. [2022-12-13 17:41:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8847 states, 8838 states have (on average 1.4049558723693143) internal successors, (12417), 8846 states have internal predecessors, (12417), 0 states have call successors, (0), 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-12-13 17:41:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 12417 transitions. [2022-12-13 17:41:49,550 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 12417 transitions. Word has length 71 [2022-12-13 17:41:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:49,550 INFO L495 AbstractCegarLoop]: Abstraction has 8847 states and 12417 transitions. [2022-12-13 17:41:49,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 17:41:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 12417 transitions. [2022-12-13 17:41:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 17:41:49,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:49,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:49,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 17:41:49,551 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-12-13 17:41:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -589694717, now seen corresponding path program 1 times [2022-12-13 17:41:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211313069] [2022-12-13 17:41:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:49,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:49,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211313069] [2022-12-13 17:41:49,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211313069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:49,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:49,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725469844] [2022-12-13 17:41:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:49,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:49,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:49,628 INFO L87 Difference]: Start difference. First operand 8847 states and 12417 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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-12-13 17:41:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:50,240 INFO L93 Difference]: Finished difference Result 9269 states and 12997 transitions. [2022-12-13 17:41:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:50,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 71 [2022-12-13 17:41:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:50,248 INFO L225 Difference]: With dead ends: 9269 [2022-12-13 17:41:50,248 INFO L226 Difference]: Without dead ends: 9262 [2022-12-13 17:41:50,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:50,250 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 180 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:50,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 423 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2022-12-13 17:41:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 9255. [2022-12-13 17:41:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9255 states, 9246 states have (on average 1.3979017953709711) internal successors, (12925), 9254 states have internal predecessors, (12925), 0 states have call successors, (0), 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-12-13 17:41:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 12925 transitions. [2022-12-13 17:41:50,817 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 12925 transitions. Word has length 71 [2022-12-13 17:41:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:50,817 INFO L495 AbstractCegarLoop]: Abstraction has 9255 states and 12925 transitions. [2022-12-13 17:41:50,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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-12-13 17:41:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 12925 transitions. [2022-12-13 17:41:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 17:41:50,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:50,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:50,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:41:50,819 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash -465238524, now seen corresponding path program 1 times [2022-12-13 17:41:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:50,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001203488] [2022-12-13 17:41:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:50,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001203488] [2022-12-13 17:41:50,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001203488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:50,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:50,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817143217] [2022-12-13 17:41:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:50,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:50,880 INFO L87 Difference]: Start difference. First operand 9255 states and 12925 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-13 17:41:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:51,421 INFO L93 Difference]: Finished difference Result 11522 states and 16131 transitions. [2022-12-13 17:41:51,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 72 [2022-12-13 17:41:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:51,427 INFO L225 Difference]: With dead ends: 11522 [2022-12-13 17:41:51,427 INFO L226 Difference]: Without dead ends: 7645 [2022-12-13 17:41:51,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:51,430 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 178 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:51,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 391 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2022-12-13 17:41:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 5609. [2022-12-13 17:41:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 5600 states have (on average 1.383392857142857) internal successors, (7747), 5608 states have internal predecessors, (7747), 0 states have call successors, (0), 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-12-13 17:41:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 7747 transitions. [2022-12-13 17:41:51,851 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 7747 transitions. Word has length 72 [2022-12-13 17:41:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:51,851 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 7747 transitions. [2022-12-13 17:41:51,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-13 17:41:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 7747 transitions. [2022-12-13 17:41:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:41:51,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:51,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:51,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:41:51,853 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:51,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1464123534, now seen corresponding path program 1 times [2022-12-13 17:41:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:51,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380529906] [2022-12-13 17:41:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:51,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380529906] [2022-12-13 17:41:51,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380529906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:51,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:51,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525779435] [2022-12-13 17:41:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:51,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:51,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:51,935 INFO L87 Difference]: Start difference. First operand 5609 states and 7747 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-13 17:41:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:52,447 INFO L93 Difference]: Finished difference Result 5899 states and 8147 transitions. [2022-12-13 17:41:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 73 [2022-12-13 17:41:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:52,452 INFO L225 Difference]: With dead ends: 5899 [2022-12-13 17:41:52,453 INFO L226 Difference]: Without dead ends: 5892 [2022-12-13 17:41:52,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:52,454 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 174 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:52,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 442 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2022-12-13 17:41:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5885. [2022-12-13 17:41:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5885 states, 5876 states have (on average 1.3810415248468346) internal successors, (8115), 5884 states have internal predecessors, (8115), 0 states have call successors, (0), 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-12-13 17:41:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5885 states to 5885 states and 8115 transitions. [2022-12-13 17:41:52,830 INFO L78 Accepts]: Start accepts. Automaton has 5885 states and 8115 transitions. Word has length 73 [2022-12-13 17:41:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:52,830 INFO L495 AbstractCegarLoop]: Abstraction has 5885 states and 8115 transitions. [2022-12-13 17:41:52,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-13 17:41:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5885 states and 8115 transitions. [2022-12-13 17:41:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:41:52,831 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:52,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:52,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 17:41:52,831 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492216, now seen corresponding path program 1 times [2022-12-13 17:41:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:52,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175986691] [2022-12-13 17:41:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175986691] [2022-12-13 17:41:52,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175986691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:52,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:52,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961537098] [2022-12-13 17:41:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:52,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:52,914 INFO L87 Difference]: Start difference. First operand 5885 states and 8115 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-13 17:41:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:53,532 INFO L93 Difference]: Finished difference Result 6952 states and 9663 transitions. [2022-12-13 17:41:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:53,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 73 [2022-12-13 17:41:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:53,539 INFO L225 Difference]: With dead ends: 6952 [2022-12-13 17:41:53,539 INFO L226 Difference]: Without dead ends: 6951 [2022-12-13 17:41:53,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:53,540 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 154 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:53,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 473 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2022-12-13 17:41:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 6933. [2022-12-13 17:41:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6924 states have (on average 1.3926920854997111) internal successors, (9643), 6932 states have internal predecessors, (9643), 0 states have call successors, (0), 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-12-13 17:41:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 9643 transitions. [2022-12-13 17:41:53,977 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 9643 transitions. Word has length 73 [2022-12-13 17:41:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:53,977 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 9643 transitions. [2022-12-13 17:41:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-13 17:41:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 9643 transitions. [2022-12-13 17:41:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 17:41:53,978 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:53,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 17:41:53,978 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1043459298, now seen corresponding path program 1 times [2022-12-13 17:41:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:53,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160921283] [2022-12-13 17:41:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:54,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160921283] [2022-12-13 17:41:54,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160921283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:54,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:54,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863349305] [2022-12-13 17:41:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:54,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:54,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:54,034 INFO L87 Difference]: Start difference. First operand 6933 states and 9643 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-12-13 17:41:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:54,634 INFO L93 Difference]: Finished difference Result 7162 states and 9951 transitions. [2022-12-13 17:41:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 75 [2022-12-13 17:41:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:54,640 INFO L225 Difference]: With dead ends: 7162 [2022-12-13 17:41:54,640 INFO L226 Difference]: Without dead ends: 6721 [2022-12-13 17:41:54,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:54,643 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 181 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:54,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 517 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2022-12-13 17:41:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6713. [2022-12-13 17:41:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6713 states, 6704 states have (on average 1.3912589498806682) internal successors, (9327), 6712 states have internal predecessors, (9327), 0 states have call successors, (0), 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-12-13 17:41:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6713 states to 6713 states and 9327 transitions. [2022-12-13 17:41:55,057 INFO L78 Accepts]: Start accepts. Automaton has 6713 states and 9327 transitions. Word has length 75 [2022-12-13 17:41:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:55,057 INFO L495 AbstractCegarLoop]: Abstraction has 6713 states and 9327 transitions. [2022-12-13 17:41:55,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-12-13 17:41:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6713 states and 9327 transitions. [2022-12-13 17:41:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 17:41:55,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:55,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:55,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 17:41:55,059 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1395000573, now seen corresponding path program 1 times [2022-12-13 17:41:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:55,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724376370] [2022-12-13 17:41:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:55,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:55,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724376370] [2022-12-13 17:41:55,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724376370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:55,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:55,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:55,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10184960] [2022-12-13 17:41:55,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:55,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:55,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:55,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:55,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:55,109 INFO L87 Difference]: Start difference. First operand 6713 states and 9327 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-13 17:41:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:55,615 INFO L93 Difference]: Finished difference Result 6945 states and 9633 transitions. [2022-12-13 17:41:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 96 [2022-12-13 17:41:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:55,620 INFO L225 Difference]: With dead ends: 6945 [2022-12-13 17:41:55,620 INFO L226 Difference]: Without dead ends: 6940 [2022-12-13 17:41:55,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:55,622 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 117 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:55,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 408 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2022-12-13 17:41:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6706. [2022-12-13 17:41:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6700 states have (on average 1.363731343283582) internal successors, (9137), 6705 states have internal predecessors, (9137), 0 states have call successors, (0), 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-12-13 17:41:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 9137 transitions. [2022-12-13 17:41:56,028 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 9137 transitions. Word has length 96 [2022-12-13 17:41:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:56,028 INFO L495 AbstractCegarLoop]: Abstraction has 6706 states and 9137 transitions. [2022-12-13 17:41:56,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-13 17:41:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 9137 transitions. [2022-12-13 17:41:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 17:41:56,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:56,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:56,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 17:41:56,032 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 653198863, now seen corresponding path program 1 times [2022-12-13 17:41:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:56,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531718342] [2022-12-13 17:41:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:56,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531718342] [2022-12-13 17:41:56,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531718342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:56,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:56,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414205776] [2022-12-13 17:41:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:56,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:56,099 INFO L87 Difference]: Start difference. First operand 6706 states and 9137 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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-12-13 17:41:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:56,638 INFO L93 Difference]: Finished difference Result 7223 states and 9841 transitions. [2022-12-13 17:41:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 98 [2022-12-13 17:41:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:56,643 INFO L225 Difference]: With dead ends: 7223 [2022-12-13 17:41:56,643 INFO L226 Difference]: Without dead ends: 6450 [2022-12-13 17:41:56,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:56,645 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 174 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:56,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 514 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6450 states. [2022-12-13 17:41:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6450 to 6430. [2022-12-13 17:41:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6430 states, 6424 states have (on average 1.3669053549190535) internal successors, (8781), 6429 states have internal predecessors, (8781), 0 states have call successors, (0), 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-12-13 17:41:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 8781 transitions. [2022-12-13 17:41:57,043 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 8781 transitions. Word has length 98 [2022-12-13 17:41:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:57,043 INFO L495 AbstractCegarLoop]: Abstraction has 6430 states and 8781 transitions. [2022-12-13 17:41:57,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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-12-13 17:41:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 8781 transitions. [2022-12-13 17:41:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 17:41:57,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:57,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:57,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 17:41:57,045 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1374191545, now seen corresponding path program 1 times [2022-12-13 17:41:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:57,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080807103] [2022-12-13 17:41:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 17:41:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:57,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080807103] [2022-12-13 17:41:57,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080807103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:57,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:57,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375583279] [2022-12-13 17:41:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:41:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:41:57,074 INFO L87 Difference]: Start difference. First operand 6430 states and 8781 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-12-13 17:41:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:57,469 INFO L93 Difference]: Finished difference Result 11947 states and 16373 transitions. [2022-12-13 17:41:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:57,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 98 [2022-12-13 17:41:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:57,475 INFO L225 Difference]: With dead ends: 11947 [2022-12-13 17:41:57,475 INFO L226 Difference]: Without dead ends: 6398 [2022-12-13 17:41:57,479 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-12-13 17:41:57,479 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:57,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6398 states. [2022-12-13 17:41:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6398 to 6320. [2022-12-13 17:41:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6320 states, 6314 states have (on average 1.3492239467849223) internal successors, (8519), 6319 states have internal predecessors, (8519), 0 states have call successors, (0), 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-12-13 17:41:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 8519 transitions. [2022-12-13 17:41:57,861 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 8519 transitions. Word has length 98 [2022-12-13 17:41:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:57,861 INFO L495 AbstractCegarLoop]: Abstraction has 6320 states and 8519 transitions. [2022-12-13 17:41:57,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-12-13 17:41:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 8519 transitions. [2022-12-13 17:41:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 17:41:57,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:57,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 17:41:57,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 17:41:57,863 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 565758719, now seen corresponding path program 2 times [2022-12-13 17:41:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:57,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29346112] [2022-12-13 17:41:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:57,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:57,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29346112] [2022-12-13 17:41:57,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29346112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:57,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:57,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512635915] [2022-12-13 17:41:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:57,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:57,932 INFO L87 Difference]: Start difference. First operand 6320 states and 8519 transitions. Second operand has 5 states, 4 states have (on average 23.0) 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-12-13 17:41:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:58,538 INFO L93 Difference]: Finished difference Result 9406 states and 12796 transitions. [2022-12-13 17:41:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) 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 98 [2022-12-13 17:41:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:58,542 INFO L225 Difference]: With dead ends: 9406 [2022-12-13 17:41:58,542 INFO L226 Difference]: Without dead ends: 5007 [2022-12-13 17:41:58,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:58,546 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 202 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:58,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 408 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2022-12-13 17:41:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 4984. [2022-12-13 17:41:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3457211731619123) internal successors, (6699), 4983 states have internal predecessors, (6699), 0 states have call successors, (0), 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-12-13 17:41:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6699 transitions. [2022-12-13 17:41:58,888 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6699 transitions. Word has length 98 [2022-12-13 17:41:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:58,888 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6699 transitions. [2022-12-13 17:41:58,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) 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-12-13 17:41:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6699 transitions. [2022-12-13 17:41:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 17:41:58,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:58,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2022-12-13 17:41:58,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 17:41:58,890 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1811958509, now seen corresponding path program 1 times [2022-12-13 17:41:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:58,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321768911] [2022-12-13 17:41:58,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:41:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:58,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321768911] [2022-12-13 17:41:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321768911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183275853] [2022-12-13 17:41:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:58,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:58,952 INFO L87 Difference]: Start difference. First operand 4984 states and 6699 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-12-13 17:41:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:59,317 INFO L93 Difference]: Finished difference Result 4992 states and 6704 transitions. [2022-12-13 17:41:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:59,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 100 [2022-12-13 17:41:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:59,321 INFO L225 Difference]: With dead ends: 4992 [2022-12-13 17:41:59,321 INFO L226 Difference]: Without dead ends: 4984 [2022-12-13 17:41:59,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:59,322 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 153 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:59,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 369 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-12-13 17:41:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4984. [2022-12-13 17:41:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3392928887103255) internal successors, (6667), 4983 states have internal predecessors, (6667), 0 states have call successors, (0), 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-12-13 17:41:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6667 transitions. [2022-12-13 17:41:59,607 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6667 transitions. Word has length 100 [2022-12-13 17:41:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:59,608 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6667 transitions. [2022-12-13 17:41:59,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-12-13 17:41:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6667 transitions. [2022-12-13 17:41:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 17:41:59,609 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:59,609 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, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:59,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 17:41:59,609 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:41:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1302363118, now seen corresponding path program 1 times [2022-12-13 17:41:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:59,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700614700] [2022-12-13 17:41:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:41:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:59,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700614700] [2022-12-13 17:41:59,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700614700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:59,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:59,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:59,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107794503] [2022-12-13 17:41:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:59,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:41:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:59,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:59,676 INFO L87 Difference]: Start difference. First operand 4984 states and 6667 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 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-12-13 17:41:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:59,989 INFO L93 Difference]: Finished difference Result 6274 states and 8458 transitions. [2022-12-13 17:41:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:41:59,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 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 101 [2022-12-13 17:41:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:59,993 INFO L225 Difference]: With dead ends: 6274 [2022-12-13 17:41:59,993 INFO L226 Difference]: Without dead ends: 3603 [2022-12-13 17:41:59,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:59,995 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 132 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:59,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 322 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2022-12-13 17:42:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3201. [2022-12-13 17:42:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3198 states have (on average 1.310193871169481) internal successors, (4190), 3200 states have internal predecessors, (4190), 0 states have call successors, (0), 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-12-13 17:42:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4190 transitions. [2022-12-13 17:42:00,228 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4190 transitions. Word has length 101 [2022-12-13 17:42:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:00,228 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 4190 transitions. [2022-12-13 17:42:00,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 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-12-13 17:42:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4190 transitions. [2022-12-13 17:42:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-13 17:42:00,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:00,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:00,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 17:42:00,229 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:42:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -971866840, now seen corresponding path program 1 times [2022-12-13 17:42:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:00,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674791032] [2022-12-13 17:42:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:42:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:00,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674791032] [2022-12-13 17:42:00,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674791032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:00,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:00,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:42:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070747025] [2022-12-13 17:42:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:00,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:42:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:00,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:42:00,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:00,305 INFO L87 Difference]: Start difference. First operand 3201 states and 4190 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-13 17:42:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:00,628 INFO L93 Difference]: Finished difference Result 3202 states and 4190 transitions. [2022-12-13 17:42:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:42:00,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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 102 [2022-12-13 17:42:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:00,630 INFO L225 Difference]: With dead ends: 3202 [2022-12-13 17:42:00,631 INFO L226 Difference]: Without dead ends: 3194 [2022-12-13 17:42:00,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:00,631 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:00,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:42:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-12-13 17:42:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2022-12-13 17:42:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.303163169433135) internal successors, (4161), 3193 states have internal predecessors, (4161), 0 states have call successors, (0), 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-12-13 17:42:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4161 transitions. [2022-12-13 17:42:00,851 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4161 transitions. Word has length 102 [2022-12-13 17:42:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:00,851 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4161 transitions. [2022-12-13 17:42:00,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-13 17:42:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4161 transitions. [2022-12-13 17:42:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-13 17:42:00,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:00,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:00,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 17:42:00,853 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:42:00,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1718550854, now seen corresponding path program 1 times [2022-12-13 17:42:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:00,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023425393] [2022-12-13 17:42:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:42:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023425393] [2022-12-13 17:42:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023425393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:00,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:00,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:42:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648058972] [2022-12-13 17:42:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:00,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:42:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:00,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:42:00,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:00,911 INFO L87 Difference]: Start difference. First operand 3194 states and 4161 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-12-13 17:42:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:01,192 INFO L93 Difference]: Finished difference Result 3195 states and 4161 transitions. [2022-12-13 17:42:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:42:01,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 102 [2022-12-13 17:42:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:01,195 INFO L225 Difference]: With dead ends: 3195 [2022-12-13 17:42:01,195 INFO L226 Difference]: Without dead ends: 3194 [2022-12-13 17:42:01,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:01,196 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:01,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 381 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:42:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-12-13 17:42:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2022-12-13 17:42:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.3006576886940182) internal successors, (4153), 3193 states have internal predecessors, (4153), 0 states have call successors, (0), 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-12-13 17:42:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4153 transitions. [2022-12-13 17:42:01,448 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4153 transitions. Word has length 102 [2022-12-13 17:42:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:01,448 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4153 transitions. [2022-12-13 17:42:01,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-12-13 17:42:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4153 transitions. [2022-12-13 17:42:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 17:42:01,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:01,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:01,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 17:42:01,449 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:42:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1861706580, now seen corresponding path program 1 times [2022-12-13 17:42:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:01,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578834259] [2022-12-13 17:42:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:42:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:01,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578834259] [2022-12-13 17:42:01,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578834259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:01,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:01,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:42:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109881725] [2022-12-13 17:42:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:01,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:42:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:42:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:01,509 INFO L87 Difference]: Start difference. First operand 3194 states and 4153 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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-12-13 17:42:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:01,835 INFO L93 Difference]: Finished difference Result 3416 states and 4449 transitions. [2022-12-13 17:42:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:42:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 104 [2022-12-13 17:42:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:01,838 INFO L225 Difference]: With dead ends: 3416 [2022-12-13 17:42:01,838 INFO L226 Difference]: Without dead ends: 2927 [2022-12-13 17:42:01,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:01,839 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 153 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:01,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 508 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:42:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2022-12-13 17:42:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2706. [2022-12-13 17:42:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 1.2913123844731977) internal successors, (3493), 2705 states have internal predecessors, (3493), 0 states have call successors, (0), 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-12-13 17:42:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3493 transitions. [2022-12-13 17:42:02,016 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3493 transitions. Word has length 104 [2022-12-13 17:42:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:02,016 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 3493 transitions. [2022-12-13 17:42:02,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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-12-13 17:42:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3493 transitions. [2022-12-13 17:42:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 17:42:02,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:02,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:02,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 17:42:02,017 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:42:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1155199980, now seen corresponding path program 2 times [2022-12-13 17:42:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:02,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271349617] [2022-12-13 17:42:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:42:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:02,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271349617] [2022-12-13 17:42:02,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271349617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:02,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:02,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:42:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450469859] [2022-12-13 17:42:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:02,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:42:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:42:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:02,078 INFO L87 Difference]: Start difference. First operand 2706 states and 3493 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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-12-13 17:42:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:02,332 INFO L93 Difference]: Finished difference Result 2707 states and 3493 transitions. [2022-12-13 17:42:02,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:42:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 104 [2022-12-13 17:42:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:02,334 INFO L225 Difference]: With dead ends: 2707 [2022-12-13 17:42:02,334 INFO L226 Difference]: Without dead ends: 1866 [2022-12-13 17:42:02,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:02,335 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 137 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:02,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 486 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:42:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-12-13 17:42:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2022-12-13 17:42:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 1.2809651474530832) internal successors, (2389), 1865 states have internal predecessors, (2389), 0 states have call successors, (0), 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-12-13 17:42:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2389 transitions. [2022-12-13 17:42:02,456 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2389 transitions. Word has length 104 [2022-12-13 17:42:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:02,456 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2389 transitions. [2022-12-13 17:42:02,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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-12-13 17:42:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2389 transitions. [2022-12-13 17:42:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-13 17:42:02,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:42:02,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:02,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 17:42:02,457 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-13 17:42:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 214144641, now seen corresponding path program 1 times [2022-12-13 17:42:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:02,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603539620] [2022-12-13 17:42:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:42:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:02,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603539620] [2022-12-13 17:42:02,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603539620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:02,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:42:02,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:42:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086174174] [2022-12-13 17:42:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:42:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:02,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:42:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:02,536 INFO L87 Difference]: Start difference. First operand 1866 states and 2389 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-12-13 17:42:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:02,691 INFO L93 Difference]: Finished difference Result 1866 states and 2389 transitions. [2022-12-13 17:42:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:42:02,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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 126 [2022-12-13 17:42:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:42:02,692 INFO L225 Difference]: With dead ends: 1866 [2022-12-13 17:42:02,692 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 17:42:02,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:42:02,693 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 127 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:42:02,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:42:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 17:42:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 17:42:02,694 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-12-13 17:42:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 17:42:02,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2022-12-13 17:42:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:42:02,694 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 17:42:02,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-12-13 17:42:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 17:42:02,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 17:42:02,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-12-13 17:42:02,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-12-13 17:42:02,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-12-13 17:42:02,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-12-13 17:42:02,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-12-13 17:42:02,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-12-13 17:42:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 17:42:02,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 17:42:11,671 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 678 DAG size of output: 662 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:42:17,468 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 710 DAG size of output: 694 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:42:24,726 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 738 DAG size of output: 722 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:42:40,001 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 706 DAG size of output: 690 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:42:53,342 WARN L233 SmtUtils]: Spent 13.34s on a formula simplification. DAG size of input: 616 DAG size of output: 617 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:43:00,517 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 679 DAG size of output: 663 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 17:43:36,024 WARN L233 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 617 DAG size of output: 44 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 350) no Hoare annotation was computed. [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 407) no Hoare annotation was computed. [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 447) no Hoare annotation was computed. [2022-12-13 17:43:43,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,903 INFO L895 garLoopResultBuilder]: At program point L170(lines 165 260) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,903 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 345) no Hoare annotation was computed. [2022-12-13 17:43:43,903 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 402) no Hoare annotation was computed. [2022-12-13 17:43:43,903 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 442) no Hoare annotation was computed. [2022-12-13 17:43:43,903 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 344) no Hoare annotation was computed. [2022-12-13 17:43:43,903 INFO L895 garLoopResultBuilder]: At program point L270(lines 267 280) the Hoare annotation is: (let ((.cse8 (+ ~st2~0 ~st1~0))) (let ((.cse1 (<= 0 ~st1~0)) (.cse3 (<= (+ ~st3~0 ~st1~0) 0)) (.cse4 (<= 0 .cse8)) (.cse5 (<= 0 ~st3~0)) (.cse10 (<= 0 ~st2~0)) (.cse11 (<= ~st2~0 0)) (.cse6 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse9 (= ~st3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 (<= ~st3~0 0) .cse2 .cse5) (and (let ((.cse7 (<= ~st1~0 0))) (or (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse2 (<= .cse8 0) .cse4))) .cse9) (and .cse6 .cse2 .cse10 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (and .cse2 .cse11 .cse3 .cse4 .cse5) (and (or (and .cse6 .cse2 .cse10 .cse11) (and .cse6 .cse0 .cse2)) .cse9)))) [2022-12-13 17:43:43,903 INFO L895 garLoopResultBuilder]: At program point L155(lines 150 305) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,904 INFO L895 garLoopResultBuilder]: At program point L122(lines 114 383) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,904 INFO L895 garLoopResultBuilder]: At program point L172(lines 161 286) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,904 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 397) no Hoare annotation was computed. [2022-12-13 17:43:43,904 INFO L895 garLoopResultBuilder]: At program point L189(lines 181 241) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,904 INFO L895 garLoopResultBuilder]: At program point $Ultimate##60(lines 186 222) the Hoare annotation is: (let ((.cse8 (<= 0 ~st1~0)) (.cse7 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse0 (= ~st1~0 1)) (.cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0)) (.cse2 (= ~st3~0 1)) (.cse6 (let ((.cse9 (<= 0 .cse7)) (.cse10 (<= ~st1~0 0))) (or (let ((.cse11 (+ ~st2~0 ~st1~0))) (and .cse9 .cse10 .cse8 (<= .cse11 0) (<= 0 .cse11))) (and (= ~st2~0 1) .cse9 .cse10 .cse8)))) (.cse1 (<= 0 ~st2~0)) (.cse3 (<= 0 ~st3~0))) (or (and .cse0 .cse1 .cse2 (<= ~st2~0 0)) (and .cse0 .cse1 (<= (+ ~st3~0 ~st2~0) 0) .cse3) (let ((.cse5 (+ ~st3~0 ~st1~0))) (and .cse4 (<= 0 .cse5) .cse6 (<= .cse5 0))) (and .cse4 .cse2 .cse6) (and (<= .cse7 0) .cse8 .cse1 .cse3)))) [2022-12-13 17:43:43,904 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 437) no Hoare annotation was computed. [2022-12-13 17:43:43,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,904 INFO L895 garLoopResultBuilder]: At program point L140(lines 135 350) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,905 INFO L895 garLoopResultBuilder]: At program point L322(lines 310 330) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0))) (let ((.cse12 (+ ~st3~0 ~st2~0)) (.cse1 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= 0 .cse14))) (let ((.cse9 (= ~st3~0 1)) (.cse11 (let ((.cse13 (<= ~st1~0 0))) (or (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse2 .cse3 .cse13 .cse4 (<= .cse14 0) .cse5)))) (.cse7 (<= 0 .cse12)) (.cse0 (= ~st1~0 1)) (.cse8 (<= 0 ~st2~0)) (.cse6 (<= 0 ~st3~0))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (or (and .cse7 .cse0 .cse2 .cse8 (<= ~st2~0 0)) (and .cse7 .cse0 .cse1 .cse2 .cse8)) .cse9) (let ((.cse10 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse10) (<= .cse10 0) .cse11)) (and .cse9 .cse11) (and .cse7 .cse0 .cse2 .cse8 (<= .cse12 0) .cse6))))) [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L895 garLoopResultBuilder]: At program point L157(lines 146 331) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,905 INFO L895 garLoopResultBuilder]: At program point L372(lines 360 380) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0)) (.cse11 (+ ~st3~0 ~st1~0))) (let ((.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (<= ~st1~0 0)) (.cse10 (<= 0 .cse11)) (.cse6 (<= 0 ~st1~0)) (.cse2 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse9 (<= 0 ~st2~0)) (.cse12 (= ~st3~0 1)) (.cse13 (<= ~st2~0 0)) (.cse7 (<= .cse14 0)) (.cse8 (<= 0 .cse14))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3) (let ((.cse4 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse4) .cse2 .cse5 (<= .cse4 0) .cse6 .cse7 .cse8)) (and .cse0 .cse2 .cse9 (<= (+ ~st3~0 ~st2~0) 0) .cse3) (and .cse1 .cse2 .cse10 .cse6 (<= .cse11 0) .cse3) (and .cse12 (or (and .cse0 .cse2 .cse9 .cse13) (and .cse0 .cse1 .cse2))) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse2 .cse9 .cse12 .cse13 .cse7 .cse8)))) [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 392) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 432) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L895 garLoopResultBuilder]: At program point L142(lines 126 381) the Hoare annotation is: (let ((.cse2 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse3 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse2 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) (and .cse1 .cse3 (<= ~st2~0 0)))) (and .cse0 .cse4) (and .cse1 .cse3 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse2 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 381) no Hoare annotation was computed. [2022-12-13 17:43:43,905 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 58 469) the Hoare annotation is: true [2022-12-13 17:43:43,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 427) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 467) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 355) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L895 garLoopResultBuilder]: At program point L277(lines 265 285) the Hoare annotation is: (let ((.cse8 (+ ~st2~0 ~st1~0))) (let ((.cse1 (<= 0 ~st1~0)) (.cse3 (<= (+ ~st3~0 ~st1~0) 0)) (.cse4 (<= 0 .cse8)) (.cse5 (<= 0 ~st3~0)) (.cse10 (<= 0 ~st2~0)) (.cse11 (<= ~st2~0 0)) (.cse6 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse9 (= ~st3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 (<= ~st3~0 0) .cse2 .cse5) (and (let ((.cse7 (<= ~st1~0 0))) (or (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse2 (<= .cse8 0) .cse4))) .cse9) (and .cse6 .cse2 .cse10 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (and .cse2 .cse11 .cse3 .cse4 .cse5) (and (or (and .cse6 .cse2 .cse10 .cse11) (and .cse6 .cse0 .cse2)) .cse9)))) [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 380) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 422) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,906 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 387) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 462) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 375) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L895 garLoopResultBuilder]: At program point L131(lines 128 355) the Hoare annotation is: (let ((.cse3 (= ~st2~0 1))) (let ((.cse0 (= ~st3~0 1)) (.cse2 (<= 0 ~st2~0)) (.cse4 (let ((.cse7 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse8 (<= ~st1~0 0)) (.cse9 (<= 0 ~st1~0))) (or (let ((.cse10 (+ ~st2~0 ~st1~0))) (and .cse7 .cse8 .cse9 (<= .cse10 0) (<= 0 .cse10))) (and .cse3 .cse7 .cse8 .cse9)))) (.cse1 (= ~st1~0 1)) (.cse5 (<= 0 ~st3~0))) (or (and .cse0 (or (and .cse1 .cse2 (<= ~st2~0 0)) (and .cse1 .cse3))) (and .cse0 .cse4) (and .cse1 .cse2 (<= (+ ~st3~0 ~st2~0) 0) .cse5) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse6) .cse4 (<= .cse6 0))) (and .cse1 .cse3 (<= ~st3~0 0) .cse5)))) [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 417) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 457) no Hoare annotation was computed. [2022-12-13 17:43:43,907 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 412) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L895 garLoopResultBuilder]: At program point L315(lines 312 325) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0))) (let ((.cse12 (+ ~st3~0 ~st2~0)) (.cse1 (= ~st2~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= 0 .cse14))) (let ((.cse9 (= ~st3~0 1)) (.cse11 (let ((.cse13 (<= ~st1~0 0))) (or (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse2 .cse3 .cse13 .cse4 (<= .cse14 0) .cse5)))) (.cse7 (<= 0 .cse12)) (.cse0 (= ~st1~0 1)) (.cse8 (<= 0 ~st2~0)) (.cse6 (<= 0 ~st3~0))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (or (and .cse7 .cse0 .cse2 .cse8 (<= ~st2~0 0)) (and .cse7 .cse0 .cse1 .cse2 .cse8)) .cse9) (let ((.cse10 (+ ~st3~0 ~st1~0))) (and (<= 0 .cse10) (<= .cse10 0) .cse11)) (and .cse9 .cse11) (and .cse7 .cse0 .cse2 .cse8 (<= .cse12 0) .cse6))))) [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 452) no Hoare annotation was computed. [2022-12-13 17:43:43,908 INFO L895 garLoopResultBuilder]: At program point L365(lines 362 375) the Hoare annotation is: (let ((.cse14 (+ ~st2~0 ~st1~0)) (.cse11 (+ ~st3~0 ~st1~0))) (let ((.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (<= ~st1~0 0)) (.cse10 (<= 0 .cse11)) (.cse6 (<= 0 ~st1~0)) (.cse2 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse9 (<= 0 ~st2~0)) (.cse12 (= ~st3~0 1)) (.cse13 (<= ~st2~0 0)) (.cse7 (<= .cse14 0)) (.cse8 (<= 0 .cse14))) (or (and .cse0 .cse1 (<= ~st3~0 0) .cse2 .cse3) (let ((.cse4 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse4) .cse2 .cse5 (<= .cse4 0) .cse6 .cse7 .cse8)) (and .cse0 .cse2 .cse9 (<= (+ ~st3~0 ~st2~0) 0) .cse3) (and .cse1 .cse2 .cse10 .cse6 (<= .cse11 0) .cse3) (and .cse12 (or (and .cse0 .cse2 .cse9 .cse13) (and .cse0 .cse1 .cse2))) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse2 .cse9 .cse12 .cse13 .cse7 .cse8)))) [2022-12-13 17:43:43,908 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2022-12-13 17:43:43,911 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:43,912 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:43:43,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:43:43 BoogieIcfgContainer [2022-12-13 17:43:43,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:43:43,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:43:43,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:43:43,937 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:43:43,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:38" (3/4) ... [2022-12-13 17:43:43,939 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 17:43:43,949 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 17:43:43,949 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 17:43:43,949 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 17:43:43,949 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 17:43:43,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:43:43,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:43:43,994 INFO L158 Benchmark]: Toolchain (without parser) took 126413.45ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 90.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2022-12-13 17:43:43,994 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:43:43,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.89ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 76.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 17:43:43,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.24ms. Allocated memory is still 125.8MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:43:43,995 INFO L158 Benchmark]: Boogie Preprocessor took 23.21ms. Allocated memory is still 125.8MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:43:43,995 INFO L158 Benchmark]: RCFGBuilder took 426.41ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 52.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 17:43:43,995 INFO L158 Benchmark]: TraceAbstraction took 125601.84ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 51.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 890.0MB. Max. memory is 16.1GB. [2022-12-13 17:43:43,995 INFO L158 Benchmark]: Witness Printer took 56.66ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 17:43:43,996 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.16ms. Allocated memory is still 125.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.89ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 76.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.24ms. Allocated memory is still 125.8MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.21ms. Allocated memory is still 125.8MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 426.41ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 52.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 125601.84ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 51.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 890.0MB. Max. memory is 16.1GB. * Witness Printer took 56.66ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 125.5s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 101.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5964 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5964 mSDsluCounter, 12029 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6274 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 5755 mSDtfsCounter, 2988 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9255occurred in iteration=20, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 7890 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 1725 NumberOfFragments, 2735 HoareAnnotationTreeSize, 17 FomulaSimplifications, 184331 FormulaSimplificationTreeSizeReduction, 59.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 640605 FormulaSimplificationTreeSizeReductionInter, 41.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2490 ConstructedInterpolants, 0 QuantifiedInterpolants, 9860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 773/773 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3) || ((((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)) || ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st3 + st1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1)))) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st3 + st1) && 0 <= st1) && st3 == 1)) || (((((256 * (mode1 / 256) == mode1 && 0 <= st2) && st3 == 1) && st2 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && 0 <= st1) && 0 <= st2 + st1) && 0 <= st3) || ((((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((((0 <= st3 + st2 && st1 == 1) && st2 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2)) && st3 == 1)) || ((0 <= st3 + st1 && st3 + st1 <= 0) && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st3)) || ((((((st2 == 1 && st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2 + st1) || ((((st1 <= 0 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st2 + st1 <= 0) && 0 <= st2 + st1)) && st3 == 1)) || ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((((256 * (mode3 / 256) == mode3 && st2 <= 0) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3)) || (((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3)) && st3 == 1) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && 0 <= st1) && 0 <= st2 + st1) && 0 <= st3) || ((((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((((0 <= st3 + st2 && st1 == 1) && st2 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2)) && st3 == 1)) || ((0 <= st3 + st1 && st3 + st1 <= 0) && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || (((((256 * (mode2 / 256) == mode2 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (((((0 <= st3 + st2 && st1 == 1) && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st3)) || ((((((st2 == 1 && st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2 + st1) || ((((st1 <= 0 && 0 <= st1) && 256 * (mode3 / 256) == mode3) && st2 + st1 <= 0) && 0 <= st2 + st1)) && st3 == 1)) || ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((((256 * (mode3 / 256) == mode3 && st2 <= 0) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3)) || (((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3)) && st3 == 1) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((st1 == 1 && 0 <= st2) && st3 == 1) && st2 <= 0) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || (((r1 / 256 * 256 + 2 < r1 && 0 <= st3 + st1) && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || ((r1 / 256 * 256 + 2 < r1 && st3 == 1) && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st3 + st2 + st1 <= 0 && 0 <= st1) && 0 <= st2) && 0 <= st3) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3) || ((((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)) || ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st3 + st1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1)))) || (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st3 + st1) && 0 <= st1) && st3 == 1)) || (((((256 * (mode1 / 256) == mode1 && 0 <= st2) && st3 == 1) && st2 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((st3 == 1 && (((st1 == 1 && st2 == 1) && 0 <= st2) || ((st1 == 1 && 0 <= st2) && st2 <= 0))) || (st3 == 1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1)))) || (((st1 == 1 && 0 <= st2) && st3 + st2 <= 0) && 0 <= st3)) || ((0 <= st3 + st1 && (((((0 <= st3 + st2 + st1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1) || (((st2 == 1 && 0 <= st3 + st2 + st1) && st1 <= 0) && 0 <= st1))) && st3 + st1 <= 0)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) RESULT: Ultimate proved your program to be correct! [2022-12-13 17:43:44,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9eeb83a-2566-4be4-8500-bffe111ab093/bin/uautomizer-uyxdKDjOR8/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