./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_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_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/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_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/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_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/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 74029f571d90ae6361d68ab8baba7b04affd26584db9ebc1f710c68ed85ed771 --- 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:12:31,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:12:31,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:12:31,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:12:31,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:12:31,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:12:31,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:12:31,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:12:31,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:12:31,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:12:31,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:12:31,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:12:31,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:12:31,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:12:31,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:12:31,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:12:31,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:12:31,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:12:31,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:12:31,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:12:31,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:12:31,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:12:31,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:12:31,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:12:31,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:12:31,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:12:31,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:12:31,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:12:31,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:12:31,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:12:31,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:12:31,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:12:31,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:12:31,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:12:31,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:12:31,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:12:31,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:12:31,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:12:31,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:12:31,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:12:31,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:12:31,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 18:12:31,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:12:31,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:12:31,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:12:31,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:12:31,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:12:31,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:12:31,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:12:31,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:12:31,482 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:12:31,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:12:31,482 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:12:31,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:12:31,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:12:31,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:12:31,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:12:31,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:12:31,484 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 18:12:31,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:12:31,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:12:31,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:12:31,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:12:31,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:12:31,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:12:31,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:12:31,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:12:31,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:12:31,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:12:31,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:12:31,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:12:31,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:12:31,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:12:31,487 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:12:31,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:12:31,487 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_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/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_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/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 -> 74029f571d90ae6361d68ab8baba7b04affd26584db9ebc1f710c68ed85ed771 [2022-11-25 18:12:31,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:12:31,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:12:31,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:12:31,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:12:31,771 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:12:31,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_15_good.i [2022-11-25 18:12:34,880 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:12:35,352 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:12:35,354 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_predec_15_good.i [2022-11-25 18:12:35,388 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/data/424c1b9cf/4e49bd20c03f47ad8bc55bd1d9138bbf/FLAG36ec384d5 [2022-11-25 18:12:35,411 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/data/424c1b9cf/4e49bd20c03f47ad8bc55bd1d9138bbf [2022-11-25 18:12:35,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:12:35,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:12:35,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:12:35,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:12:35,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:12:35,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:12:35" (1/1) ... [2022-11-25 18:12:35,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9ba0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:35, skipping insertion in model container [2022-11-25 18:12:35,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:12:35" (1/1) ... [2022-11-25 18:12:35,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:12:35,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:12:35,918 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 18:12:36,470 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 18:12:36,477 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:12:36,480 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:12:36,483 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:12:36,484 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:12:36,536 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 18:12:36,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:12:36,549 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:12:36,571 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 18:12:36,666 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 18:12:36,668 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:12:36,669 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:12:36,671 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:12:36,672 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:12:36,695 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 18:12:36,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:12:36,838 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:12:36,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36 WrapperNode [2022-11-25 18:12:36,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:12:36,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:12:36,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:12:36,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:12:36,849 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:12:36" (1/1) ... [2022-11-25 18:12:36,884 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:12:36" (1/1) ... [2022-11-25 18:12:36,935 INFO L138 Inliner]: procedures = 503, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 179 [2022-11-25 18:12:36,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:12:36,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:12:36,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:12:36,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:12:36,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,974 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:12:36,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:12:36,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:12:36,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:12:36,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (1/1) ... [2022-11-25 18:12:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:12:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:12:37,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:12:37,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:12:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 18:12:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 18:12:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 18:12:37,083 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 18:12:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:12:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:12:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:12:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:12:37,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:12:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:12:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 18:12:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:12:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:12:37,235 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:12:37,237 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:12:37,563 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:12:37,570 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:12:37,571 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:12:37,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:12:37 BoogieIcfgContainer [2022-11-25 18:12:37,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:12:37,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:12:37,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:12:37,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:12:37,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:12:35" (1/3) ... [2022-11-25 18:12:37,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9899e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:12:37, skipping insertion in model container [2022-11-25 18:12:37,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:12:36" (2/3) ... [2022-11-25 18:12:37,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9899e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:12:37, skipping insertion in model container [2022-11-25 18:12:37,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:12:37" (3/3) ... [2022-11-25 18:12:37,581 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_predec_15_good.i [2022-11-25 18:12:37,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:12:37,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 18:12:37,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:12:37,661 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;@1e825e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:12:37,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 18:12:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 18:12:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 18:12:37,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:37,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:37,675 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:12:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash -389693070, now seen corresponding path program 1 times [2022-11-25 18:12:37,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:37,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326681867] [2022-11-25 18:12:37,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,314 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:12:38,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:38,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326681867] [2022-11-25 18:12:38,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326681867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:38,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:38,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501460985] [2022-11-25 18:12:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:38,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:12:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:12:38,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:12:38,354 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:38,419 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-11-25 18:12:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:12:38,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-11-25 18:12:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:38,431 INFO L225 Difference]: With dead ends: 77 [2022-11-25 18:12:38,431 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:12:38,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:12:38,437 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:38,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 298 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:12:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:12:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 18:12:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:12:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2022-11-25 18:12:38,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 14 [2022-11-25 18:12:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:38,481 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2022-11-25 18:12:38,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2022-11-25 18:12:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:12:38,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:38,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:38,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:12:38,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash 804416791, now seen corresponding path program 1 times [2022-11-25 18:12:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:38,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269534008] [2022-11-25 18:12:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:38,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,637 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:12:38,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:38,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269534008] [2022-11-25 18:12:38,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269534008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:38,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:38,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962274074] [2022-11-25 18:12:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:38,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:12:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:12:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:12:38,650 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:12:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:38,721 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-11-25 18:12:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:12:38,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:12:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:38,723 INFO L225 Difference]: With dead ends: 65 [2022-11-25 18:12:38,724 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:12:38,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:12:38,725 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 8 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:38,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 231 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:12:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:12:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 18:12:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:12:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2022-11-25 18:12:38,737 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 15 [2022-11-25 18:12:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:38,737 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2022-11-25 18:12:38,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:12:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-11-25 18:12:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:12:38,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:38,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:38,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:12:38,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1566270844, now seen corresponding path program 1 times [2022-11-25 18:12:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:38,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934577310] [2022-11-25 18:12:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,838 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:12:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:38,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934577310] [2022-11-25 18:12:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934577310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:38,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:38,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643792] [2022-11-25 18:12:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:38,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:38,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:38,849 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:12:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:38,875 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2022-11-25 18:12:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-25 18:12:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:38,878 INFO L225 Difference]: With dead ends: 112 [2022-11-25 18:12:38,878 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:12:38,878 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:12:38,880 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 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:12:38,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:12:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:12:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 18:12:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 59 states have internal predecessors, (64), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:12:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2022-11-25 18:12:38,891 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 19 [2022-11-25 18:12:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:38,892 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2022-11-25 18:12:38,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:12:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-11-25 18:12:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:12:38,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:38,894 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] [2022-11-25 18:12:38,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:12:38,894 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:12:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash -126826538, now seen corresponding path program 1 times [2022-11-25 18:12:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:38,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927592371] [2022-11-25 18:12:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 18:12:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:38,957 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:12:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927592371] [2022-11-25 18:12:38,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927592371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:38,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:38,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650066032] [2022-11-25 18:12:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:38,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:38,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:38,961 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:12:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:38,986 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2022-11-25 18:12:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2022-11-25 18:12:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:38,989 INFO L225 Difference]: With dead ends: 112 [2022-11-25 18:12:38,991 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 18:12:38,991 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:12:38,993 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 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:12:38,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:12:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 18:12:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 18:12:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 58 states have internal predecessors, (63), 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:12:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-25 18:12:39,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 23 [2022-11-25 18:12:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:39,014 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-25 18:12:39,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:12:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-25 18:12:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:12:39,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:39,016 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] [2022-11-25 18:12:39,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:12:39,017 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:12:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash 745548059, now seen corresponding path program 1 times [2022-11-25 18:12:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:39,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483295515] [2022-11-25 18:12:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:39,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,203 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:12:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:39,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483295515] [2022-11-25 18:12:39,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483295515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:39,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:39,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373910248] [2022-11-25 18:12:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:39,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:12:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:39,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:12:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:12:39,219 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:12:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:39,271 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-11-25 18:12:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:12:39,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2022-11-25 18:12:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:39,273 INFO L225 Difference]: With dead ends: 63 [2022-11-25 18:12:39,275 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 18:12:39,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:12:39,276 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:39,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 232 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:12:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 18:12:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 18:12:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 57 states have internal predecessors, (62), 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:12:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-11-25 18:12:39,295 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 25 [2022-11-25 18:12:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:39,296 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-11-25 18:12:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:12:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-11-25 18:12:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:12:39,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:39,298 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:12:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:12:39,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1637153456, now seen corresponding path program 1 times [2022-11-25 18:12:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:39,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251100164] [2022-11-25 18:12:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,524 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:12:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:39,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251100164] [2022-11-25 18:12:39,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251100164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:39,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:39,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:12:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974260331] [2022-11-25 18:12:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:39,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:12:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:39,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:12:39,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:12:39,527 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:12:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:39,636 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2022-11-25 18:12:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:12:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 26 [2022-11-25 18:12:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:39,638 INFO L225 Difference]: With dead ends: 62 [2022-11-25 18:12:39,638 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 18:12:39,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:12:39,640 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:12:39,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:12:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 18:12:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 18:12:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 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:12:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2022-11-25 18:12:39,650 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 26 [2022-11-25 18:12:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:39,651 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2022-11-25 18:12:39,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:12:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2022-11-25 18:12:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:12:39,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:39,652 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] [2022-11-25 18:12:39,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:12:39,653 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -332330315, now seen corresponding path program 1 times [2022-11-25 18:12:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:39,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650029948] [2022-11-25 18:12:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,745 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:12:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:39,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650029948] [2022-11-25 18:12:39,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650029948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:39,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:39,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241604749] [2022-11-25 18:12:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:39,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:39,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:39,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:39,749 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:39,775 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-11-25 18:12:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2022-11-25 18:12:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:39,780 INFO L225 Difference]: With dead ends: 93 [2022-11-25 18:12:39,780 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 18:12:39,781 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:12:39,783 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:12:39,787 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:12:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 18:12:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 18:12:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 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:12:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2022-11-25 18:12:39,807 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 31 [2022-11-25 18:12:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:39,813 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2022-11-25 18:12:39,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-11-25 18:12:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 18:12:39,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:39,815 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] [2022-11-25 18:12:39,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:12:39,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1965523148, now seen corresponding path program 1 times [2022-11-25 18:12:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:39,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711679075] [2022-11-25 18:12:39,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:39,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:39,926 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:12:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:39,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711679075] [2022-11-25 18:12:39,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711679075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:39,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:39,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:12:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136668930] [2022-11-25 18:12:39,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:39,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:39,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:39,932 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:39,948 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2022-11-25 18:12:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 36 [2022-11-25 18:12:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:39,952 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:12:39,952 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 18:12:39,952 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:12:39,956 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:12:39,956 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:12:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 18:12:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-11-25 18:12:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 52 states have internal predecessors, (57), 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:12:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2022-11-25 18:12:39,976 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 36 [2022-11-25 18:12:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:39,976 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2022-11-25 18:12:39,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2022-11-25 18:12:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:12:39,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:39,985 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] [2022-11-25 18:12:39,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:12:39,986 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:39,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash -801675300, now seen corresponding path program 1 times [2022-11-25 18:12:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:39,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100038299] [2022-11-25 18:12:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,080 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:12:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100038299] [2022-11-25 18:12:40,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100038299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:12:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382628473] [2022-11-25 18:12:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,085 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:12:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,105 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-11-25 18:12:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2022-11-25 18:12:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,107 INFO L225 Difference]: With dead ends: 77 [2022-11-25 18:12:40,108 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 18:12:40,108 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:12:40,111 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:12:40,111 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:12:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 18:12:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-25 18:12:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 56 states have internal predecessors, (62), 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:12:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-11-25 18:12:40,134 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 37 [2022-11-25 18:12:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,134 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-11-25 18:12:40,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:12:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-11-25 18:12:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:12:40,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:40,140 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] [2022-11-25 18:12:40,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:12:40,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -799828258, now seen corresponding path program 1 times [2022-11-25 18:12:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:40,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576668200] [2022-11-25 18:12:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,207 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:12:40,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576668200] [2022-11-25 18:12:40,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576668200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210124793] [2022-11-25 18:12:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,211 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:12:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,221 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-11-25 18:12:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2022-11-25 18:12:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,226 INFO L225 Difference]: With dead ends: 88 [2022-11-25 18:12:40,226 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 18:12:40,226 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:12:40,227 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:12:40,227 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:12:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 18:12:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 18:12:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 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:12:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-11-25 18:12:40,239 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 37 [2022-11-25 18:12:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,240 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-25 18:12:40,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:12:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-11-25 18:12:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:12:40,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:40,241 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] [2022-11-25 18:12:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:12:40,241 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:12:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1822720215, now seen corresponding path program 1 times [2022-11-25 18:12:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661603337] [2022-11-25 18:12:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:12:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,303 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:12:40,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661603337] [2022-11-25 18:12:40,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661603337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614524923] [2022-11-25 18:12:40,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,305 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,313 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-11-25 18:12:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 41 [2022-11-25 18:12:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,314 INFO L225 Difference]: With dead ends: 83 [2022-11-25 18:12:40,314 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 18:12:40,315 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:12:40,315 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:12:40,316 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:12:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 18:12:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 18:12:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 50 states have internal predecessors, (54), 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:12:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-11-25 18:12:40,320 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 41 [2022-11-25 18:12:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,321 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-11-25 18:12:40,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-11-25 18:12:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:12:40,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:40,322 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] [2022-11-25 18:12:40,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:12:40,322 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash 763162534, now seen corresponding path program 1 times [2022-11-25 18:12:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:40,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800293998] [2022-11-25 18:12:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,387 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:12:40,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800293998] [2022-11-25 18:12:40,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800293998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990111037] [2022-11-25 18:12:40,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,390 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:12:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,396 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-11-25 18:12:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 42 [2022-11-25 18:12:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,397 INFO L225 Difference]: With dead ends: 71 [2022-11-25 18:12:40,398 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 18:12:40,398 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:12:40,399 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:12:40,399 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:12:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 18:12:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 18:12:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 47 states have internal predecessors, (51), 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:12:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-25 18:12:40,405 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 42 [2022-11-25 18:12:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,405 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-25 18:12:40,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:12:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-25 18:12:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:12:40,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:40,407 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] [2022-11-25 18:12:40,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:12:40,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1582332810, now seen corresponding path program 1 times [2022-11-25 18:12:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:40,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184550308] [2022-11-25 18:12:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:12:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,490 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:12:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184550308] [2022-11-25 18:12:40,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184550308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:12:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138073811] [2022-11-25 18:12:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,492 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:12:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,499 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-11-25 18:12:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 47 [2022-11-25 18:12:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,501 INFO L225 Difference]: With dead ends: 54 [2022-11-25 18:12:40,501 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 18:12:40,501 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:12:40,502 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:12:40,502 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:12:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 18:12:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 18:12:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 46 states have internal predecessors, (50), 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:12:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-25 18:12:40,507 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 47 [2022-11-25 18:12:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,507 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-25 18:12:40,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:12:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-25 18:12:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 18:12:40,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:40,508 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] [2022-11-25 18:12:40,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:12:40,509 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1807677031, now seen corresponding path program 1 times [2022-11-25 18:12:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:40,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896193852] [2022-11-25 18:12:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:40,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:12:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,574 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:12:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896193852] [2022-11-25 18:12:40,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896193852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:12:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663146854] [2022-11-25 18:12:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,577 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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:12:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,584 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-11-25 18:12:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 48 [2022-11-25 18:12:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,586 INFO L225 Difference]: With dead ends: 58 [2022-11-25 18:12:40,586 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 18:12:40,586 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:12:40,587 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:12:40,587 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:12:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 18:12:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 18:12:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 46 states have internal predecessors, (49), 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:12:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-25 18:12:40,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 48 [2022-11-25 18:12:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,592 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-25 18:12:40,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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:12:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-25 18:12:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:12:40,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:12:40,593 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] [2022-11-25 18:12:40,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:12:40,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 18:12:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:12:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash 258733193, now seen corresponding path program 1 times [2022-11-25 18:12:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:12:40,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447969958] [2022-11-25 18:12:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:12:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:12:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:12:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:12:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:12:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:12:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:40,650 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:12:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:40,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447969958] [2022-11-25 18:12:40,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447969958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:12:40,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:12:40,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:12:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206293748] [2022-11-25 18:12:40,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:12:40,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:12:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:40,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:12:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:12:40,653 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:12:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:12:40,656 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-11-25 18:12:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:12:40,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 49 [2022-11-25 18:12:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:12:40,656 INFO L225 Difference]: With dead ends: 57 [2022-11-25 18:12:40,657 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:12:40,657 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:12:40,658 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:12:40,658 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:12:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:12:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:12:40,659 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:12:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:12:40,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-11-25 18:12:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:12:40,659 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:12:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:12:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:12:40,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:12:40,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 18:12:40,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 18:12:40,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 18:12:40,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 18:12:40,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 18:12:40,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 18:12:40,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 18:12:40,664 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 18:12:40,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:12:40,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:12:40,754 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 18:12:40,755 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 18:12:40,755 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 18:12:40,755 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 18:12:40,755 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 18:12:40,756 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 18:12:40,756 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 18:12:40,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 18:12:40,757 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-25 18:12:40,757 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-25 18:12:40,757 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-11-25 18:12:40,757 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-25 18:12:40,758 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 18:12:40,758 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-25 18:12:40,758 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-11-25 18:12:40,758 INFO L902 garLoopResultBuilder]: At program point L1679(lines 1673 1680) the Hoare annotation is: true [2022-11-25 18:12:40,758 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1611) no Hoare annotation was computed. [2022-11-25 18:12:40,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 18:12:40,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 18:12:40,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:12:40,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:12:40,759 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-25 18:12:40,759 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-25 18:12:40,759 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1579) no Hoare annotation was computed. [2022-11-25 18:12:40,760 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1665) no Hoare annotation was computed. [2022-11-25 18:12:40,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 18:12:40,760 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2022-11-25 18:12:40,760 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-11-25 18:12:40,760 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-25 18:12:40,760 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-25 18:12:40,761 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-25 18:12:40,762 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647) [2022-11-25 18:12:40,762 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 18:12:40,762 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-25 18:12:40,762 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-11-25 18:12:40,762 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 18:12:40,762 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647) [2022-11-25 18:12:40,763 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-11-25 18:12:40,763 INFO L895 garLoopResultBuilder]: At program point L1616(lines 1616 1624) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) |ULTIMATE.start_goodG2B1_#t~switch106#1| (<= 0 .cse0))) [2022-11-25 18:12:40,763 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-25 18:12:40,765 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 18:12:40,765 INFO L899 garLoopResultBuilder]: For program point L1666(lines 1666 1672) no Hoare annotation was computed. [2022-11-25 18:12:40,765 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 18:12:40,765 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-11-25 18:12:40,766 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-25 18:12:40,766 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2022-11-25 18:12:40,766 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647) [2022-11-25 18:12:40,766 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-25 18:12:40,766 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:12:40,767 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 18:12:40,767 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 18:12:40,767 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-25 18:12:40,767 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647) [2022-11-25 18:12:40,767 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-11-25 18:12:40,767 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-25 18:12:40,768 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1651) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0))) [2022-11-25 18:12:40,768 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-11-25 18:12:40,768 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-25 18:12:40,768 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:12:40,768 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-25 18:12:40,769 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 18:12:40,770 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 18:12:40,770 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 18:12:40,770 INFO L902 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: true [2022-11-25 18:12:40,770 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-11-25 18:12:40,770 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-11-25 18:12:40,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 18:12:40,771 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-25 18:12:40,771 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-25 18:12:40,771 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 18:12:40,771 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-25 18:12:40,771 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-25 18:12:40,771 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2022-11-25 18:12:40,772 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1638) no Hoare annotation was computed. [2022-11-25 18:12:40,772 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 18:12:40,772 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 18:12:40,772 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 18:12:40,776 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:12:40,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:12:40,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:12:40 BoogieIcfgContainer [2022-11-25 18:12:40,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:12:40,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:12:40,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:12:40,804 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:12:40,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:12:37" (3/4) ... [2022-11-25 18:12:40,808 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:12:40,815 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 18:12:40,815 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 18:12:40,823 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 18:12:40,824 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 18:12:40,824 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 18:12:40,824 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:12:40,825 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:12:40,903 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:12:40,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:12:40,904 INFO L158 Benchmark]: Toolchain (without parser) took 5484.93ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 133.8MB in the beginning and 105.3MB in the end (delta: 28.5MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2022-11-25 18:12:40,904 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 115.3MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:12:40,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1419.06ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 69.1MB in the end (delta: 64.8MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2022-11-25 18:12:40,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.01ms. Allocated memory is still 167.8MB. Free memory was 69.1MB in the beginning and 65.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:12:40,905 INFO L158 Benchmark]: Boogie Preprocessor took 50.60ms. Allocated memory is still 167.8MB. Free memory was 65.8MB in the beginning and 64.9MB in the end (delta: 898.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:12:40,906 INFO L158 Benchmark]: RCFGBuilder took 585.71ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 131.9MB in the end (delta: -67.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 18:12:40,906 INFO L158 Benchmark]: TraceAbstraction took 3228.64ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 131.0MB in the beginning and 109.5MB in the end (delta: 21.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2022-11-25 18:12:40,907 INFO L158 Benchmark]: Witness Printer took 99.23ms. Allocated memory is still 201.3MB. Free memory was 109.5MB in the beginning and 105.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:12:40,909 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.18ms. Allocated memory is still 115.3MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1419.06ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 69.1MB in the end (delta: 64.8MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.01ms. Allocated memory is still 167.8MB. Free memory was 69.1MB in the beginning and 65.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.60ms. Allocated memory is still 167.8MB. Free memory was 65.8MB in the beginning and 64.9MB in the end (delta: 898.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 585.71ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 131.9MB in the end (delta: -67.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3228.64ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 131.0MB in the beginning and 109.5MB in the end (delta: 21.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Witness Printer took 99.23ms. Allocated memory is still 201.3MB. Free memory was 109.5MB in the beginning and 105.3MB 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: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 2549 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1167 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 15 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 68 PreInvPairs, 78 NumberOfFragments, 120 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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: 1616]: Loop Invariant Derived loop invariant: (2 + data <= 0 && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && 0 <= 2 + data - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1673]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: 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 && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1593]: 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 && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: 0 <= data + 2 && data + 2 <= 0 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1625]: Loop Invariant Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2022-11-25 18:12:40,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d272a0e1-9adc-4d5c-a70e-23c21f5deb7b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE