./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 75f94ec890a31cd0d9e6ecdb36e033f6c1d3a88cbf7a148d56b584438268f28f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 22:08:51,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:08:51,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:08:51,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:08:51,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:08:51,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:08:51,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:08:51,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:08:51,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:08:51,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:08:51,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:08:51,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:08:51,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:08:51,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:08:51,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:08:51,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:08:51,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:08:51,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:08:51,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:08:51,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:08:51,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:08:51,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:08:51,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:08:51,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:08:51,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:08:51,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:08:51,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:08:51,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:08:51,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:08:51,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:08:51,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:08:51,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:08:51,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:08:51,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:08:51,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:08:51,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:08:51,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:08:51,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:08:51,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:08:51,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:08:51,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:08:51,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 22:08:51,613 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:08:51,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:08:51,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:08:51,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:08:51,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:08:51,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:08:51,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:08:51,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:08:51,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:08:51,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:08:51,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:08:51,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:08:51,617 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:08:51,617 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_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75f94ec890a31cd0d9e6ecdb36e033f6c1d3a88cbf7a148d56b584438268f28f [2022-12-13 22:08:51,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:08:51,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:08:51,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:08:51,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:08:51,799 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:08:51,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i [2022-12-13 22:08:54,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:08:54,704 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:08:54,704 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i [2022-12-13 22:08:54,717 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/data/381e643a2/420010f429424b768ef754881dd7af2a/FLAG6a2124351 [2022-12-13 22:08:54,730 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/data/381e643a2/420010f429424b768ef754881dd7af2a [2022-12-13 22:08:54,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:08:54,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:08:54,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:08:54,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:08:54,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:08:54,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:08:54" (1/1) ... [2022-12-13 22:08:54,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@968d013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:54, skipping insertion in model container [2022-12-13 22:08:54,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:08:54" (1/1) ... [2022-12-13 22:08:54,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:08:54,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:08:55,045 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 22:08:55,350 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 22:08:55,355 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 22:08:55,357 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 22:08:55,360 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 22:08:55,361 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 22:08:55,395 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 22:08:55,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:08:55,405 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:08:55,420 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 22:08:55,464 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 22:08:55,466 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 22:08:55,467 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 22:08:55,469 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 22:08:55,470 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 22:08:55,481 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 22:08:55,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:08:55,584 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:08:55,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55 WrapperNode [2022-12-13 22:08:55,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:08:55,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:08:55,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:08:55,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:08:55,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,645 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2022-12-13 22:08:55,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:08:55,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:08:55,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:08:55,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:08:55,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:08:55,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:08:55,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:08:55,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:08:55,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (1/1) ... [2022-12-13 22:08:55,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:08:55,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:08:55,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:08:55,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:08:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 22:08:55,741 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 22:08:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 22:08:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 22:08:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:08:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:08:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:08:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 22:08:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:08:55,856 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:08:55,858 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:08:56,086 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:08:56,093 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:08:56,093 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:08:56,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:08:56 BoogieIcfgContainer [2022-12-13 22:08:56,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:08:56,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:08:56,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:08:56,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:08:56,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:08:54" (1/3) ... [2022-12-13 22:08:56,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54568059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:08:56, skipping insertion in model container [2022-12-13 22:08:56,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:08:55" (2/3) ... [2022-12-13 22:08:56,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54568059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:08:56, skipping insertion in model container [2022-12-13 22:08:56,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:08:56" (3/3) ... [2022-12-13 22:08:56,104 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_15_good.i [2022-12-13 22:08:56,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:08:56,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 22:08:56,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:08:56,178 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;@37c72811, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:08:56,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 22:08:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 76 states have internal predecessors, (83), 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-12-13 22:08:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 22:08:56,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:56,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:56,191 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-12-13 22:08:56,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 998974264, now seen corresponding path program 1 times [2022-12-13 22:08:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680790692] [2022-12-13 22:08:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680790692] [2022-12-13 22:08:56,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680790692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:56,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:56,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451742011] [2022-12-13 22:08:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:56,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,449 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 76 states have internal predecessors, (83), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:56,480 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2022-12-13 22:08:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:56,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-13 22:08:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:56,491 INFO L225 Difference]: With dead ends: 153 [2022-12-13 22:08:56,492 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 22:08:56,495 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-12-13 22:08:56,498 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:56,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 22:08:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 22:08:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 64 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 22:08:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2022-12-13 22:08:56,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 15 [2022-12-13 22:08:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:56,533 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2022-12-13 22:08:56,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2022-12-13 22:08:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 22:08:56,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:56,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:56,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:08:56,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 45972825, now seen corresponding path program 1 times [2022-12-13 22:08:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348830312] [2022-12-13 22:08:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:56,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348830312] [2022-12-13 22:08:56,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348830312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:56,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:56,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:08:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111911754] [2022-12-13 22:08:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:56,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:56,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,665 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:56,684 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2022-12-13 22:08:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 22:08:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:56,685 INFO L225 Difference]: With dead ends: 68 [2022-12-13 22:08:56,685 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 22:08:56,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,686 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:56,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 22:08:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-13 22:08:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5) internal successors, (69), 63 states have internal predecessors, (69), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 22:08:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-12-13 22:08:56,694 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 16 [2022-12-13 22:08:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:56,694 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-12-13 22:08:56,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-12-13 22:08:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 22:08:56,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:56,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:08:56,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1425157655, now seen corresponding path program 1 times [2022-12-13 22:08:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808607573] [2022-12-13 22:08:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:56,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808607573] [2022-12-13 22:08:56,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808607573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:56,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:56,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:08:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001626684] [2022-12-13 22:08:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:56,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,745 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:56,765 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2022-12-13 22:08:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:56,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-13 22:08:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:56,767 INFO L225 Difference]: With dead ends: 110 [2022-12-13 22:08:56,767 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 22:08:56,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,768 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 242 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-12-13 22:08:56,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 22:08:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 66. [2022-12-13 22:08:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 62 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 22:08:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2022-12-13 22:08:56,782 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 17 [2022-12-13 22:08:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:56,782 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-12-13 22:08:56,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-12-13 22:08:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 22:08:56,783 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:56,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:56,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:08:56,783 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-12-13 22:08:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash -674493454, now seen corresponding path program 1 times [2022-12-13 22:08:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985869584] [2022-12-13 22:08:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:08:56,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985869584] [2022-12-13 22:08:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985869584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:56,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:56,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815905961] [2022-12-13 22:08:56,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:56,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,832 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:56,849 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-12-13 22:08:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:56,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-13 22:08:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:56,850 INFO L225 Difference]: With dead ends: 116 [2022-12-13 22:08:56,850 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 22:08:56,851 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-12-13 22:08:56,852 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 168 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-12-13 22:08:56,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 22:08:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-13 22:08:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 61 states have internal predecessors, (67), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 22:08:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2022-12-13 22:08:56,863 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2022-12-13 22:08:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:56,863 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2022-12-13 22:08:56,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 22:08:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2022-12-13 22:08:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 22:08:56,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:56,864 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-12-13 22:08:56,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:08:56,865 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-12-13 22:08:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1904871187, now seen corresponding path program 1 times [2022-12-13 22:08:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088418546] [2022-12-13 22:08:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 22:08:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 22:08:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:56,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088418546] [2022-12-13 22:08:56,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088418546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:56,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:56,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778703893] [2022-12-13 22:08:56,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:56,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:56,924 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 22:08:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:56,938 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2022-12-13 22:08:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-12-13 22:08:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:56,940 INFO L225 Difference]: With dead ends: 116 [2022-12-13 22:08:56,940 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 22:08:56,940 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-12-13 22:08:56,942 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 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-12-13 22:08:56,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 22:08:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-13 22:08:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 22:08:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-12-13 22:08:56,951 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 26 [2022-12-13 22:08:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:56,951 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-12-13 22:08:56,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 22:08:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-12-13 22:08:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 22:08:56,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:56,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:56,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:08:56,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:56,954 INFO L85 PathProgramCache]: Analyzing trace with hash 902429544, now seen corresponding path program 1 times [2022-12-13 22:08:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:56,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035760532] [2022-12-13 22:08:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 22:08:57,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035760532] [2022-12-13 22:08:57,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035760532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744370007] [2022-12-13 22:08:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,003 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,014 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2022-12-13 22:08:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-12-13 22:08:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,016 INFO L225 Difference]: With dead ends: 108 [2022-12-13 22:08:57,016 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 22:08:57,016 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-12-13 22:08:57,017 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:57,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 22:08:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 22:08:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 22:08:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2022-12-13 22:08:57,025 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 28 [2022-12-13 22:08:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,025 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2022-12-13 22:08:57,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-12-13 22:08:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 22:08:57,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:08:57,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1839930966, now seen corresponding path program 1 times [2022-12-13 22:08:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071089897] [2022-12-13 22:08:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 22:08:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071089897] [2022-12-13 22:08:57,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071089897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:08:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868217636] [2022-12-13 22:08:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,124 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,136 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-12-13 22:08:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-12-13 22:08:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,137 INFO L225 Difference]: With dead ends: 63 [2022-12-13 22:08:57,137 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 22:08:57,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,138 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:57,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 22:08:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-13 22:08:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 57 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 22:08:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-12-13 22:08:57,146 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 29 [2022-12-13 22:08:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,147 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-12-13 22:08:57,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-12-13 22:08:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 22:08:57,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:08:57,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1203284977, now seen corresponding path program 1 times [2022-12-13 22:08:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054604313] [2022-12-13 22:08:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 22:08:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054604313] [2022-12-13 22:08:57,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054604313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:08:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278063958] [2022-12-13 22:08:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,197 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,211 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2022-12-13 22:08:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 22:08:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,213 INFO L225 Difference]: With dead ends: 87 [2022-12-13 22:08:57,213 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 22:08:57,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,214 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 30 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 188 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-12-13 22:08:57,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 22:08:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2022-12-13 22:08:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 22:08:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-12-13 22:08:57,222 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 30 [2022-12-13 22:08:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,222 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-12-13 22:08:57,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-12-13 22:08:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 22:08:57,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:08:57,224 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1995870532, now seen corresponding path program 1 times [2022-12-13 22:08:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039436364] [2022-12-13 22:08:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 22:08:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039436364] [2022-12-13 22:08:57,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039436364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87258211] [2022-12-13 22:08:57,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,282 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,291 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2022-12-13 22:08:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-12-13 22:08:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,292 INFO L225 Difference]: With dead ends: 93 [2022-12-13 22:08:57,292 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 22:08:57,293 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-12-13 22:08:57,293 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 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-12-13 22:08:57,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 22:08:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 22:08:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 53 states have internal predecessors, (58), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 22:08:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-12-13 22:08:57,302 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 35 [2022-12-13 22:08:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,302 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-12-13 22:08:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 22:08:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-12-13 22:08:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 22:08:57,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:08:57,304 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -182219195, now seen corresponding path program 1 times [2022-12-13 22:08:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384958065] [2022-12-13 22:08:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 22:08:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:08:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384958065] [2022-12-13 22:08:57,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384958065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:08:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754296209] [2022-12-13 22:08:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,356 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 22:08:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,371 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-12-13 22:08:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 22:08:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,372 INFO L225 Difference]: With dead ends: 79 [2022-12-13 22:08:57,372 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 22:08:57,373 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-12-13 22:08:57,373 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:57,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 22:08:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-12-13 22:08:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 22:08:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-12-13 22:08:57,382 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 40 [2022-12-13 22:08:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,383 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-12-13 22:08:57,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 22:08:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2022-12-13 22:08:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 22:08:57,384 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:08:57,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash -182159613, now seen corresponding path program 1 times [2022-12-13 22:08:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393929519] [2022-12-13 22:08:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 22:08:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:08:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393929519] [2022-12-13 22:08:57,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393929519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132942255] [2022-12-13 22:08:57,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,425 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (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-12-13 22:08:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,434 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2022-12-13 22:08:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 22:08:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,435 INFO L225 Difference]: With dead ends: 90 [2022-12-13 22:08:57,435 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 22:08:57,435 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-12-13 22:08:57,436 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 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-12-13 22:08:57,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 22:08:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 22:08:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 56 states have internal predecessors, (62), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 22:08:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-12-13 22:08:57,443 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 40 [2022-12-13 22:08:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,443 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-12-13 22:08:57,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (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-12-13 22:08:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-12-13 22:08:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 22:08:57,444 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:08:57,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1673585398, now seen corresponding path program 1 times [2022-12-13 22:08:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817956307] [2022-12-13 22:08:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 22:08:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 22:08:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 22:08:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817956307] [2022-12-13 22:08:57,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817956307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282655550] [2022-12-13 22:08:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,489 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-12-13 22:08:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,496 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-12-13 22:08:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 44 [2022-12-13 22:08:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,497 INFO L225 Difference]: With dead ends: 84 [2022-12-13 22:08:57,497 INFO L226 Difference]: Without dead ends: 56 [2022-12-13 22:08:57,497 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-12-13 22:08:57,498 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 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-12-13 22:08:57,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-13 22:08:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-12-13 22:08:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 22:08:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-12-13 22:08:57,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 44 [2022-12-13 22:08:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,503 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-12-13 22:08:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-12-13 22:08:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-12-13 22:08:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 22:08:57,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:08:57,505 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-12-13 22:08:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1929747657, now seen corresponding path program 1 times [2022-12-13 22:08:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602002271] [2022-12-13 22:08:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 22:08:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:08:57,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602002271] [2022-12-13 22:08:57,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602002271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949504518] [2022-12-13 22:08:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,555 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 22:08:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,562 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-12-13 22:08:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-12-13 22:08:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,563 INFO L225 Difference]: With dead ends: 71 [2022-12-13 22:08:57,563 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 22:08:57,564 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-12-13 22:08:57,564 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 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-12-13 22:08:57,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 22:08:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-13 22:08:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.186046511627907) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 22:08:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-12-13 22:08:57,569 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 46 [2022-12-13 22:08:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,569 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-12-13 22:08:57,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 22:08:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-12-13 22:08:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 22:08:57,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:08:57,571 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1871777561, now seen corresponding path program 1 times [2022-12-13 22:08:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459473613] [2022-12-13 22:08:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 22:08:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 22:08:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:08:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459473613] [2022-12-13 22:08:57,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459473613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:08:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997772478] [2022-12-13 22:08:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,620 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 22:08:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,629 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-12-13 22:08:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-12-13 22:08:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,629 INFO L225 Difference]: With dead ends: 60 [2022-12-13 22:08:57,629 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 22:08:57,630 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-12-13 22:08:57,630 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:57,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 22:08:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-13 22:08:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 47 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 22:08:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-12-13 22:08:57,634 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 51 [2022-12-13 22:08:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-12-13 22:08:57,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 22:08:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-12-13 22:08:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 22:08:57,635 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:08:57,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:08:57,635 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:08:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:08:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2106222457, now seen corresponding path program 1 times [2022-12-13 22:08:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:08:57,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477473969] [2022-12-13 22:08:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:08:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:08:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 22:08:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 22:08:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 22:08:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 22:08:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:08:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:08:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:08:57,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477473969] [2022-12-13 22:08:57,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477473969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:08:57,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:08:57,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:08:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699195813] [2022-12-13 22:08:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:08:57,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:08:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:08:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:08:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:08:57,684 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 22:08:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:08:57,689 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-12-13 22:08:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:08:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-12-13 22:08:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:08:57,689 INFO L225 Difference]: With dead ends: 58 [2022-12-13 22:08:57,690 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 22:08:57,690 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-12-13 22:08:57,690 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:08:57,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:08:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 22:08:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 22:08:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:08:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 22:08:57,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-12-13 22:08:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:08:57,692 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 22:08:57,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 22:08:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 22:08:57,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 22:08:57,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 22:08:57,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 22:08:57,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 22:08:57,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 22:08:57,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 22:08:57,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 22:08:57,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 22:08:57,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 22:08:57,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 22:08:57,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 22:08:57,845 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 22:08:57,845 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 22:08:57,845 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 22:08:57,845 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 22:08:57,845 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point L1662(lines 1662 1668) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point L1555(line 1555) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L899 garLoopResultBuilder]: For program point L1555-2(line 1555) no Hoare annotation was computed. [2022-12-13 22:08:57,846 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: false [2022-12-13 22:08:57,846 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1669 1676) the Hoare annotation is: true [2022-12-13 22:08:57,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-12-13 22:08:57,847 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-12-13 22:08:57,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-12-13 22:08:57,847 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-12-13 22:08:57,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 22:08:57,847 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-12-13 22:08:57,847 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-12-13 22:08:57,847 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: false [2022-12-13 22:08:57,847 INFO L895 garLoopResultBuilder]: At program point L1614(lines 1614 1622) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) |ULTIMATE.start_goodG2B1_#t~switch112#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,848 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1578) no Hoare annotation was computed. [2022-12-13 22:08:57,848 INFO L902 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: true [2022-12-13 22:08:57,848 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2022-12-13 22:08:57,848 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: false [2022-12-13 22:08:57,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-12-13 22:08:57,848 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-12-13 22:08:57,848 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch111#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,848 INFO L895 garLoopResultBuilder]: At program point L1623(lines 1623 1634) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch113#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,848 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-12-13 22:08:57,848 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 22:08:57,849 INFO L895 garLoopResultBuilder]: At program point L1640(lines 1640 1648) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,849 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-12-13 22:08:57,849 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: false [2022-12-13 22:08:57,849 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-13 22:08:57,849 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-12-13 22:08:57,849 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-12-13 22:08:57,849 INFO L902 garLoopResultBuilder]: At program point L1649(lines 1649 1660) the Hoare annotation is: true [2022-12-13 22:08:57,849 INFO L899 garLoopResultBuilder]: For program point L1616(line 1616) no Hoare annotation was computed. [2022-12-13 22:08:57,849 INFO L895 garLoopResultBuilder]: At program point L1583(lines 1583 1591) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch102#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,849 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-12-13 22:08:57,849 INFO L899 garLoopResultBuilder]: For program point L1674-1(line 1674) no Hoare annotation was computed. [2022-12-13 22:08:57,849 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1575) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L895 garLoopResultBuilder]: At program point L1592(lines 1592 1608) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch111#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,850 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: false [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-12-13 22:08:57,850 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-12-13 22:08:57,850 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 1635) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L895 garLoopResultBuilder]: At program point L1602(line 1602) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch111#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1594(line 1594) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1577) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1619(line 1619) no Hoare annotation was computed. [2022-12-13 22:08:57,851 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1586-2(line 1586) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1661) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch113#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1595(lines 1595 1603) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-12-13 22:08:57,852 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1609) no Hoare annotation was computed. [2022-12-13 22:08:57,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-12-13 22:08:57,856 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:08:57,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:08:57,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:08:57 BoogieIcfgContainer [2022-12-13 22:08:57,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:08:57,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:08:57,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:08:57,873 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:08:57,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:08:56" (3/4) ... [2022-12-13 22:08:57,876 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 22:08:57,882 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 22:08:57,882 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 22:08:57,886 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 22:08:57,886 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-13 22:08:57,887 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 22:08:57,887 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 22:08:57,887 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 22:08:57,934 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:08:57,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:08:57,935 INFO L158 Benchmark]: Toolchain (without parser) took 3201.26ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 88.8MB in the beginning and 114.6MB in the end (delta: -25.9MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,935 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 98.8MB in the beginning and 98.8MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:08:57,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.85ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 88.8MB in the beginning and 98.8MB in the end (delta: -10.0MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.01ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 94.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,936 INFO L158 Benchmark]: Boogie Preprocessor took 29.99ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,937 INFO L158 Benchmark]: RCFGBuilder took 418.48ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 72.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,937 INFO L158 Benchmark]: TraceAbstraction took 1774.79ms. Allocated memory is still 151.0MB. Free memory was 72.7MB in the beginning and 47.8MB in the end (delta: 24.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,937 INFO L158 Benchmark]: Witness Printer took 61.91ms. Allocated memory is still 151.0MB. Free memory was 47.8MB in the beginning and 114.6MB in the end (delta: -66.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-12-13 22:08:57,939 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.13ms. Allocated memory is still 125.8MB. Free memory was 98.8MB in the beginning and 98.8MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.85ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 88.8MB in the beginning and 98.8MB in the end (delta: -10.0MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.01ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 94.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.99ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.48ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 72.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1774.79ms. Allocated memory is still 151.0MB. Free memory was 72.7MB in the beginning and 47.8MB in the end (delta: 24.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 61.91ms. Allocated memory is still 151.0MB. Free memory was 47.8MB in the beginning and 114.6MB in the end (delta: -66.8MB). Peak memory consumption was 5.6MB. 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: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 2279 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1275 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 89 PreInvPairs, 106 NumberOfFragments, 150 HoareAnnotationTreeSize, 89 FomulaSimplifications, 200 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 170 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 104/104 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: 1614]: Loop Invariant Derived loop invariant: ((2 == data && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = 2; break; }-aux) && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1640]: Loop Invariant Derived loop invariant: (0 <= data + 2147483648 && data == 2) && 0 <= data + 2147483648 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data < 0x7fffffff) { int result = data + 1; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1583]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)); break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)); break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1623]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: { int result = data + 1; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data < 0x7fffffff) { int result = data + 1; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1649]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 22:08:57,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cda0536-b1b5-41a1-9f22-e93ba76c5e99/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE