./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_predec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_predec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R --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 64bit --witnessprinter.graph.data.programhash ae5ba7d6fd7114a96c87d24a6261751fd332b98d07d1a53815b0c414e7d334e3 --- 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-38b53e6 [2022-11-25 18:22:29,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:22:29,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:22:29,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:22:29,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:22:29,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:22:29,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:22:29,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:22:29,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:22:29,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:22:29,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:22:29,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:22:29,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:22:29,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:22:29,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:22:29,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:22:29,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:22:29,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:22:29,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:22:29,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:22:29,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:22:29,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:22:29,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:22:29,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:22:29,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:22:29,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:22:29,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:22:29,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:22:29,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:22:29,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:22:29,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:22:29,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:22:29,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:22:29,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:22:29,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:22:29,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:22:29,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:22:29,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:22:29,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:22:29,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:22:29,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:22:29,463 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 18:22:29,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:22:29,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:22:29,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:22:29,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:22:29,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:22:29,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:22:29,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:22:29,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:22:29,491 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:22:29,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:22:29,492 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:22:29,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:22:29,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:22:29,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:22:29,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:22:29,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:22:29,494 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 18:22:29,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:22:29,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:22:29,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:22:29,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:22:29,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:22:29,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:22:29,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:22:29,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:22:29,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:22:29,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:22:29,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:22:29,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:22:29,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:22:29,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:22:29,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:22:29,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:22:29,498 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_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/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_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5ba7d6fd7114a96c87d24a6261751fd332b98d07d1a53815b0c414e7d334e3 [2022-11-25 18:22:29,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:22:29,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:22:29,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:22:29,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:22:29,783 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:22:29,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_predec_15_good.i [2022-11-25 18:22:32,878 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:22:33,292 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:22:33,293 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_predec_15_good.i [2022-11-25 18:22:33,336 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/data/a51b8219b/62a20f4d122d47ba84ec631c4e982299/FLAG0253a1ce4 [2022-11-25 18:22:33,349 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/data/a51b8219b/62a20f4d122d47ba84ec631c4e982299 [2022-11-25 18:22:33,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:22:33,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:22:33,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:22:33,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:22:33,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:22:33,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:33" (1/1) ... [2022-11-25 18:22:33,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7351fe04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:33, skipping insertion in model container [2022-11-25 18:22:33,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:22:33" (1/1) ... [2022-11-25 18:22:33,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:22:33,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:22:33,818 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 18:22:34,341 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 18:22:34,350 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:22:34,352 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:22:34,361 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:22:34,364 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:22:34,390 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 18:22:34,398 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 18:22:34,408 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 18:22:34,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:22:34,420 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:22:34,441 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 18:22:34,507 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 18:22:34,509 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:22:34,510 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:22:34,513 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:22:34,514 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:22:34,518 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 18:22:34,522 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 18:22:34,527 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 18:22:34,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:22:34,708 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:22:34,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34 WrapperNode [2022-11-25 18:22:34,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:22:34,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:22:34,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:22:34,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:22:34,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,851 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 187 [2022-11-25 18:22:34,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:22:34,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:22:34,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:22:34,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:22:34,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:22:34,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:22:34,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:22:34,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:22:34,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (1/1) ... [2022-11-25 18:22:34,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:22:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:22:34,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:22:34,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:22:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 18:22:34,989 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 18:22:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-25 18:22:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 18:22:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 18:22:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:22:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 18:22:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:22:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:22:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:22:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:22:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 18:22:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:22:35,138 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:22:35,140 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:22:35,462 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:22:35,477 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:22:35,478 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:22:35,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:35 BoogieIcfgContainer [2022-11-25 18:22:35,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:22:35,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:22:35,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:22:35,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:22:35,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:22:33" (1/3) ... [2022-11-25 18:22:35,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45da800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:35, skipping insertion in model container [2022-11-25 18:22:35,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:22:34" (2/3) ... [2022-11-25 18:22:35,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45da800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:22:35, skipping insertion in model container [2022-11-25 18:22:35,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:35" (3/3) ... [2022-11-25 18:22:35,489 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_predec_15_good.i [2022-11-25 18:22:35,510 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:22:35,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 18:22:35,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:22:35,570 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;@3b2bd580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:22:35,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 18:22:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 18:22:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:22:35,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:35,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:35,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:35,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:35,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313757, now seen corresponding path program 1 times [2022-11-25 18:22:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:35,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393257681] [2022-11-25 18:22:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:35,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:35,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393257681] [2022-11-25 18:22:35,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393257681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:35,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:35,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752187377] [2022-11-25 18:22:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:35,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:35,943 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:35,998 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2022-11-25 18:22:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:36,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-25 18:22:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:36,010 INFO L225 Difference]: With dead ends: 156 [2022-11-25 18:22:36,010 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:22:36,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,017 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:36,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:22:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 18:22:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 18:22:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-11-25 18:22:36,066 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 15 [2022-11-25 18:22:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:36,068 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-11-25 18:22:36,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-11-25 18:22:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 18:22:36,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:36,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:36,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:22:36,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1328587979, now seen corresponding path program 1 times [2022-11-25 18:22:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:36,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870651163] [2022-11-25 18:22:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:36,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870651163] [2022-11-25 18:22:36,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870651163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:36,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:36,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339759716] [2022-11-25 18:22:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:36,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,237 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:36,301 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2022-11-25 18:22:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-25 18:22:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:36,308 INFO L225 Difference]: With dead ends: 172 [2022-11-25 18:22:36,311 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 18:22:36,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,314 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:36,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 18:22:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2022-11-25 18:22:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 states have internal predecessors, (76), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 18:22:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2022-11-25 18:22:36,338 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 16 [2022-11-25 18:22:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:36,338 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2022-11-25 18:22:36,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2022-11-25 18:22:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:22:36,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:36,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:36,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:22:36,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1763445692, now seen corresponding path program 1 times [2022-11-25 18:22:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286032775] [2022-11-25 18:22:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:36,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286032775] [2022-11-25 18:22:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286032775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:36,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528346562] [2022-11-25 18:22:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,497 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:36,517 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2022-11-25 18:22:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-25 18:22:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:36,525 INFO L225 Difference]: With dead ends: 74 [2022-11-25 18:22:36,525 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 18:22:36,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,527 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 51 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:36,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 18:22:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-25 18:22:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 18:22:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2022-11-25 18:22:36,548 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 17 [2022-11-25 18:22:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:36,548 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-11-25 18:22:36,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2022-11-25 18:22:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:22:36,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:36,550 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] [2022-11-25 18:22:36,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:22:36,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash 799401358, now seen corresponding path program 1 times [2022-11-25 18:22:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:36,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86740986] [2022-11-25 18:22:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:22:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:36,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86740986] [2022-11-25 18:22:36,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86740986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:36,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:36,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111734291] [2022-11-25 18:22:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:36,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,645 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:36,682 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2022-11-25 18:22:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-25 18:22:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:36,684 INFO L225 Difference]: With dead ends: 124 [2022-11-25 18:22:36,684 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 18:22:36,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,686 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:36,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 18:22:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-25 18:22:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 18:22:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-11-25 18:22:36,698 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 22 [2022-11-25 18:22:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:36,703 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-11-25 18:22:36,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:22:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-11-25 18:22:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:22:36,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:36,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:36,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:22:36,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash 510911504, now seen corresponding path program 1 times [2022-11-25 18:22:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64184534] [2022-11-25 18:22:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:22:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:22:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:36,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64184534] [2022-11-25 18:22:36,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64184534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:36,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:36,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:36,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315267168] [2022-11-25 18:22:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:36,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,795 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:22:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:36,809 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2022-11-25 18:22:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:36,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-25 18:22:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:36,811 INFO L225 Difference]: With dead ends: 124 [2022-11-25 18:22:36,811 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 18:22:36,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,819 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:36,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 18:22:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 18:22:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:22:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-11-25 18:22:36,839 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 26 [2022-11-25 18:22:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:36,840 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-25 18:22:36,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:22:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-11-25 18:22:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:22:36,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:36,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:36,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:22:36,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash 612038571, now seen corresponding path program 1 times [2022-11-25 18:22:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:36,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560478935] [2022-11-25 18:22:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:36,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:22:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560478935] [2022-11-25 18:22:36,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560478935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:36,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:36,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341682857] [2022-11-25 18:22:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:36,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:36,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,912 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:36,922 INFO L93 Difference]: Finished difference Result 115 states and 154 transitions. [2022-11-25 18:22:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 18:22:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:36,924 INFO L225 Difference]: With dead ends: 115 [2022-11-25 18:22:36,924 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:22:36,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:36,926 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:36,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:22:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 18:22:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.36) internal successors, (68), 64 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:22:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2022-11-25 18:22:36,935 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 28 [2022-11-25 18:22:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:36,935 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2022-11-25 18:22:36,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2022-11-25 18:22:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 18:22:36,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:36,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:36,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:22:36,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1126717929, now seen corresponding path program 1 times [2022-11-25 18:22:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:36,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338086513] [2022-11-25 18:22:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:22:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338086513] [2022-11-25 18:22:37,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338086513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347091196] [2022-11-25 18:22:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,034 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,073 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2022-11-25 18:22:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-25 18:22:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,078 INFO L225 Difference]: With dead ends: 134 [2022-11-25 18:22:37,079 INFO L226 Difference]: Without dead ends: 100 [2022-11-25 18:22:37,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,081 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-25 18:22:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2022-11-25 18:22:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 66 states have internal predecessors, (72), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:22:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-11-25 18:22:37,107 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 29 [2022-11-25 18:22:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,109 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-11-25 18:22:37,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-11-25 18:22:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:22:37,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:22:37,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 568517554, now seen corresponding path program 1 times [2022-11-25 18:22:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094130374] [2022-11-25 18:22:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:22:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094130374] [2022-11-25 18:22:37,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094130374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:37,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453050203] [2022-11-25 18:22:37,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,247 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,269 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-11-25 18:22:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 18:22:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,271 INFO L225 Difference]: With dead ends: 73 [2022-11-25 18:22:37,272 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 18:22:37,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,275 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 18:22:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 18:22:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 65 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:22:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-25 18:22:37,307 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 30 [2022-11-25 18:22:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,308 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-25 18:22:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2022-11-25 18:22:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 18:22:37,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:22:37,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash -243306749, now seen corresponding path program 1 times [2022-11-25 18:22:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801905706] [2022-11-25 18:22:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:22:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801905706] [2022-11-25 18:22:37,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801905706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037120223] [2022-11-25 18:22:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,378 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,401 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-11-25 18:22:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-25 18:22:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,403 INFO L225 Difference]: With dead ends: 104 [2022-11-25 18:22:37,403 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:22:37,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,407 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:22:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 18:22:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 62 states have internal predecessors, (67), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:22:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-11-25 18:22:37,421 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 35 [2022-11-25 18:22:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,421 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-11-25 18:22:37,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-11-25 18:22:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:22:37,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:22:37,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1207061858, now seen corresponding path program 1 times [2022-11-25 18:22:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128456655] [2022-11-25 18:22:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128456655] [2022-11-25 18:22:37,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128456655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613299497] [2022-11-25 18:22:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,517 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,540 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2022-11-25 18:22:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-25 18:22:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,545 INFO L225 Difference]: With dead ends: 81 [2022-11-25 18:22:37,545 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 18:22:37,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,546 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 19 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 18:22:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2022-11-25 18:22:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 61 states have internal predecessors, (66), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:22:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-11-25 18:22:37,558 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 40 [2022-11-25 18:22:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,558 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-11-25 18:22:37,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-11-25 18:22:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:22:37,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:22:37,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1235788226, now seen corresponding path program 1 times [2022-11-25 18:22:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980188616] [2022-11-25 18:22:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980188616] [2022-11-25 18:22:37,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980188616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060412959] [2022-11-25 18:22:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,662 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,687 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2022-11-25 18:22:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-11-25 18:22:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,690 INFO L225 Difference]: With dead ends: 88 [2022-11-25 18:22:37,690 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 18:22:37,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,690 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 18:22:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2022-11-25 18:22:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 states have internal predecessors, (71), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:22:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-11-25 18:22:37,700 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 41 [2022-11-25 18:22:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,701 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-11-25 18:22:37,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-11-25 18:22:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:22:37,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:22:37,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1237635268, now seen corresponding path program 1 times [2022-11-25 18:22:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278090844] [2022-11-25 18:22:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278090844] [2022-11-25 18:22:37,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278090844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082548461] [2022-11-25 18:22:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,785 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,796 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2022-11-25 18:22:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-11-25 18:22:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,798 INFO L225 Difference]: With dead ends: 99 [2022-11-25 18:22:37,798 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 18:22:37,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,799 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 18:22:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-25 18:22:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 64 states have internal predecessors, (70), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:22:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2022-11-25 18:22:37,806 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 41 [2022-11-25 18:22:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,806 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2022-11-25 18:22:37,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-11-25 18:22:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 18:22:37,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,808 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:22:37,808 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2051086297, now seen corresponding path program 1 times [2022-11-25 18:22:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046325551] [2022-11-25 18:22:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:22:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 18:22:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:37,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046325551] [2022-11-25 18:22:37,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046325551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:37,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:37,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385301423] [2022-11-25 18:22:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:37,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,901 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:22:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:37,910 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-11-25 18:22:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:37,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-11-25 18:22:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:37,912 INFO L225 Difference]: With dead ends: 94 [2022-11-25 18:22:37,913 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:22:37,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:37,914 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:37,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:22:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 18:22:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 59 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:22:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-11-25 18:22:37,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 45 [2022-11-25 18:22:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:37,926 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-11-25 18:22:37,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:22:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-11-25 18:22:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 18:22:37,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:37,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:22:37,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:37,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1068830320, now seen corresponding path program 1 times [2022-11-25 18:22:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299234714] [2022-11-25 18:22:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299234714] [2022-11-25 18:22:38,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299234714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:38,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:38,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203334972] [2022-11-25 18:22:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:38,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,024 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:38,039 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-25 18:22:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:38,040 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-25 18:22:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:38,041 INFO L225 Difference]: With dead ends: 82 [2022-11-25 18:22:38,041 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:22:38,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,043 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:38,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:22:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 18:22:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 56 states have internal predecessors, (60), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:22:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-25 18:22:38,050 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 46 [2022-11-25 18:22:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:38,051 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-25 18:22:38,051 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:22:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-25 18:22:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:22:38,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:38,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:38,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:22:38,053 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2085155984, now seen corresponding path program 1 times [2022-11-25 18:22:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:38,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228664099] [2022-11-25 18:22:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:22:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:38,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228664099] [2022-11-25 18:22:38,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228664099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:38,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:38,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:38,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031806868] [2022-11-25 18:22:38,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:38,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:38,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:38,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,148 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:38,159 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-11-25 18:22:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-25 18:22:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:38,160 INFO L225 Difference]: With dead ends: 65 [2022-11-25 18:22:38,160 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:22:38,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,162 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:38,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:22:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 18:22:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:22:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-11-25 18:22:38,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 51 [2022-11-25 18:22:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:38,171 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-11-25 18:22:38,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-11-25 18:22:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 18:22:38,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:38,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:38,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:22:38,172 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -215325871, now seen corresponding path program 1 times [2022-11-25 18:22:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:38,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880626250] [2022-11-25 18:22:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:22:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:38,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880626250] [2022-11-25 18:22:38,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880626250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:38,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:38,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:22:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006659625] [2022-11-25 18:22:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:38,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,251 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:38,262 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-25 18:22:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-25 18:22:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:38,263 INFO L225 Difference]: With dead ends: 69 [2022-11-25 18:22:38,263 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:22:38,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,264 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:38,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:22:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 18:22:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 55 states have internal predecessors, (58), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:22:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-11-25 18:22:38,272 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 52 [2022-11-25 18:22:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:38,272 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-11-25 18:22:38,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-11-25 18:22:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 18:22:38,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:38,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:22:38,275 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:22:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1970152687, now seen corresponding path program 1 times [2022-11-25 18:22:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:38,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506455085] [2022-11-25 18:22:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:22:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:22:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:22:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 18:22:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506455085] [2022-11-25 18:22:38,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506455085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:38,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:38,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:22:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774205357] [2022-11-25 18:22:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:38,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:22:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:22:38,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,364 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:38,368 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-11-25 18:22:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:22:38,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-11-25 18:22:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:38,369 INFO L225 Difference]: With dead ends: 68 [2022-11-25 18:22:38,369 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:22:38,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:22:38,370 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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-11-25 18:22:38,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:22:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:22:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:22:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:22:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:22:38,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-11-25 18:22:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:38,371 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:22:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:22:38,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:22:38,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 18:22:38,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 18:22:38,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 18:22:38,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 18:22:38,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 18:22:38,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 18:22:38,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 18:22:38,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 18:22:38,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:22:38,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:22:38,624 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 18:22:38,624 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 18:22:38,624 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 18:22:38,624 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 18:22:38,625 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 18:22:38,625 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 18:22:38,625 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 18:22:38,625 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-25 18:22:38,625 INFO L899 garLoopResultBuilder]: For program point L1596(line 1596) no Hoare annotation was computed. [2022-11-25 18:22:38,625 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1| (not (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0))) [2022-11-25 18:22:38,626 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-11-25 18:22:38,626 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-25 18:22:38,626 INFO L895 garLoopResultBuilder]: At program point L1613(lines 1613 1630) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-11-25 18:22:38,626 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-25 18:22:38,627 INFO L895 garLoopResultBuilder]: At program point L1605(line 1605) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (not (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,627 INFO L899 garLoopResultBuilder]: For program point L1605-1(lines 1599 1606) no Hoare annotation was computed. [2022-11-25 18:22:38,627 INFO L902 garLoopResultBuilder]: At program point L1696(line 1696) the Hoare annotation is: true [2022-11-25 18:22:38,627 INFO L899 garLoopResultBuilder]: For program point L1696-1(line 1696) no Hoare annotation was computed. [2022-11-25 18:22:38,627 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-25 18:22:38,628 INFO L895 garLoopResultBuilder]: At program point L1663(lines 1663 1671) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= .cse0 0))) [2022-11-25 18:22:38,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:22:38,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:22:38,628 INFO L895 garLoopResultBuilder]: At program point L1655(line 1655) the Hoare annotation is: false [2022-11-25 18:22:38,628 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-11-25 18:22:38,628 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-25 18:22:38,629 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1589) no Hoare annotation was computed. [2022-11-25 18:22:38,629 INFO L902 garLoopResultBuilder]: At program point L1672(lines 1672 1684) the Hoare annotation is: true [2022-11-25 18:22:38,630 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-25 18:22:38,630 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-11-25 18:22:38,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-25 18:22:38,630 INFO L899 garLoopResultBuilder]: For program point L1590(lines 1590 1631) no Hoare annotation was computed. [2022-11-25 18:22:38,630 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-11-25 18:22:38,630 INFO L899 garLoopResultBuilder]: For program point L1681(line 1681) no Hoare annotation was computed. [2022-11-25 18:22:38,631 INFO L899 garLoopResultBuilder]: For program point L1615(line 1615) no Hoare annotation was computed. [2022-11-25 18:22:38,631 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-11-25 18:22:38,632 INFO L902 garLoopResultBuilder]: At program point L1698(line 1698) the Hoare annotation is: true [2022-11-25 18:22:38,632 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-25 18:22:38,632 INFO L899 garLoopResultBuilder]: For program point L1698-1(line 1698) no Hoare annotation was computed. [2022-11-25 18:22:38,633 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1658) no Hoare annotation was computed. [2022-11-25 18:22:38,633 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1606) no Hoare annotation was computed. [2022-11-25 18:22:38,633 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,633 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-25 18:22:38,633 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-25 18:22:38,633 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1625) no Hoare annotation was computed. [2022-11-25 18:22:38,633 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-11-25 18:22:38,634 INFO L899 garLoopResultBuilder]: For program point L1674(line 1674) no Hoare annotation was computed. [2022-11-25 18:22:38,634 INFO L899 garLoopResultBuilder]: For program point L1641(line 1641) no Hoare annotation was computed. [2022-11-25 18:22:38,634 INFO L902 garLoopResultBuilder]: At program point L1699(lines 1693 1700) the Hoare annotation is: true [2022-11-25 18:22:38,634 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-11-25 18:22:38,634 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-11-25 18:22:38,634 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-25 18:22:38,634 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-25 18:22:38,635 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:22:38,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-11-25 18:22:38,635 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1685) no Hoare annotation was computed. [2022-11-25 18:22:38,635 INFO L895 garLoopResultBuilder]: At program point L1651(line 1651) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,635 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-25 18:22:38,635 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-25 18:22:38,636 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-25 18:22:38,636 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-11-25 18:22:38,636 INFO L899 garLoopResultBuilder]: For program point L1676(line 1676) no Hoare annotation was computed. [2022-11-25 18:22:38,636 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-25 18:22:38,636 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: false [2022-11-25 18:22:38,636 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1586) no Hoare annotation was computed. [2022-11-25 18:22:38,636 INFO L899 garLoopResultBuilder]: For program point L1668(line 1668) no Hoare annotation was computed. [2022-11-25 18:22:38,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:22:38,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-11-25 18:22:38,637 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 18:22:38,637 INFO L895 garLoopResultBuilder]: At program point L1594(lines 1594 1612) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,637 INFO L895 garLoopResultBuilder]: At program point L1669(line 1669) the Hoare annotation is: false [2022-11-25 18:22:38,637 INFO L895 garLoopResultBuilder]: At program point L1636(lines 1636 1644) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch102#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 .cse0))) [2022-11-25 18:22:38,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-25 18:22:38,638 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: false [2022-11-25 18:22:38,638 INFO L899 garLoopResultBuilder]: For program point L1686(lines 1686 1692) no Hoare annotation was computed. [2022-11-25 18:22:38,638 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,638 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 18:22:38,638 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-25 18:22:38,639 INFO L895 garLoopResultBuilder]: At program point L1645(lines 1645 1657) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:22:38,639 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-11-25 18:22:38,639 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-11-25 18:22:38,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-11-25 18:22:38,639 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1588) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-25 18:22:38,643 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:22:38,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:22:38,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:22:38 BoogieIcfgContainer [2022-11-25 18:22:38,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:22:38,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:22:38,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:22:38,671 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:22:38,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:22:35" (3/4) ... [2022-11-25 18:22:38,674 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:22:38,681 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 18:22:38,681 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 18:22:38,690 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-25 18:22:38,691 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 18:22:38,691 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 18:22:38,692 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:22:38,692 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:22:38,769 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:22:38,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:22:38,771 INFO L158 Benchmark]: Toolchain (without parser) took 5416.48ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 111.4MB in the beginning and 122.7MB in the end (delta: -11.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-11-25 18:22:38,771 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 94.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:22:38,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1354.74ms. Allocated memory is still 144.7MB. Free memory was 111.4MB in the beginning and 108.5MB in the end (delta: 2.9MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2022-11-25 18:22:38,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.99ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 105.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:22:38,772 INFO L158 Benchmark]: Boogie Preprocessor took 58.30ms. Allocated memory is still 144.7MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:22:38,773 INFO L158 Benchmark]: RCFGBuilder took 569.51ms. Allocated memory is still 144.7MB. Free memory was 103.2MB in the beginning and 84.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 18:22:38,774 INFO L158 Benchmark]: TraceAbstraction took 3186.85ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 84.3MB in the beginning and 126.9MB in the end (delta: -42.7MB). Peak memory consumption was 403.4kB. Max. memory is 16.1GB. [2022-11-25 18:22:38,774 INFO L158 Benchmark]: Witness Printer took 99.39ms. Allocated memory is still 186.6MB. Free memory was 126.9MB in the beginning and 122.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:22:38,778 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.25ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 94.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1354.74ms. Allocated memory is still 144.7MB. Free memory was 111.4MB in the beginning and 108.5MB in the end (delta: 2.9MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.99ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 105.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.30ms. Allocated memory is still 144.7MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.51ms. Allocated memory is still 144.7MB. Free memory was 103.2MB in the beginning and 84.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3186.85ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 84.3MB in the beginning and 126.9MB in the end (delta: -42.7MB). Peak memory consumption was 403.4kB. Max. memory is 16.1GB. * Witness Printer took 99.39ms. Allocated memory is still 186.6MB. Free memory was 126.9MB in the beginning and 122.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: 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 3 procedures, 83 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 2678 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1493 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 97 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 111 PreInvPairs, 131 NumberOfFragments, 143 HoareAnnotationTreeSize, 111 FomulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 121 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 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 8 specifications checked. All of them hold - InvariantResult [Line: 1636]: Loop Invariant Derived loop invariant: (((2 + data <= 0 && data <= 2147483647) && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && data <= 2147483647) && 0 <= 2 + data - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data > (-0x7fffffff - 1)) { --data; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux - InvariantResult [Line: 1613]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data > (-0x7fffffff - 1)) { --data; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1693]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1645]: Loop Invariant Derived loop invariant: (data <= 2147483647 && aux-switch(7) { case 7: { --data; int result = data; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux) && data <= 2147483647 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux - InvariantResult [Line: 1672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1663]: Loop Invariant Derived loop invariant: ((0 <= data + 2 && data <= 2147483647) && data <= 2147483647) && data + 2 <= 0 RESULT: Ultimate proved your program to be correct! [2022-11-25 18:22:38,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b0f462c-8079-4671-a68f-24f00737e991/bin/uautomizer-ZsLfNo2U6R/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