./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_10_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/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_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_10_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/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_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/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 b48751c7aad9390af50bed0eaa90d62f106159428b7c8ec3acb28c8693712e2f --- 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 20:51:07,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:51:07,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:51:07,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:51:07,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:51:07,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:51:07,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:51:07,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:51:07,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:51:07,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:51:07,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:51:07,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:51:07,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:51:07,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:51:07,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:51:07,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:51:07,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:51:07,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:51:07,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:51:07,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:51:07,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:51:07,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:51:07,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:51:07,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:51:07,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:51:07,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:51:07,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:51:07,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:51:07,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:51:07,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:51:07,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:51:07,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:51:07,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:51:07,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:51:07,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:51:07,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:51:07,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:51:07,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:51:07,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:51:07,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:51:07,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:51:07,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 20:51:07,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:51:07,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:51:07,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:51:07,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:51:07,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:51:07,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:51:07,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:51:07,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:51:07,395 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:51:07,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:51:07,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:51:07,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:51:07,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:51:07,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:51:07,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:51:07,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:51:07,397 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 20:51:07,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:51:07,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:51:07,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:51:07,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:51:07,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:51:07,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:51:07,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:51:07,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:51:07,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:51:07,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:51:07,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:51:07,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:51:07,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:51:07,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:51:07,399 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:51:07,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:51:07,400 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:51:07,400 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_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/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_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/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 -> b48751c7aad9390af50bed0eaa90d62f106159428b7c8ec3acb28c8693712e2f [2022-12-13 20:51:07,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:51:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:51:07,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:51:07,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:51:07,605 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:51:07,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_10_good.i [2022-12-13 20:51:10,279 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:51:10,522 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:51:10,522 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_10_good.i [2022-12-13 20:51:10,534 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/data/ae98ebf77/42fa49d091414b7a8098d88a81350147/FLAG337f91fd2 [2022-12-13 20:51:10,548 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/data/ae98ebf77/42fa49d091414b7a8098d88a81350147 [2022-12-13 20:51:10,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:51:10,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:51:10,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:51:10,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:51:10,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:51:10,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:51:10" (1/1) ... [2022-12-13 20:51:10,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:10, skipping insertion in model container [2022-12-13 20:51:10,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:51:10" (1/1) ... [2022-12-13 20:51:10,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:51:10,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:51:10,893 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 20:51:11,225 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 20:51:11,229 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 20:51:11,231 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 20:51:11,232 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 20:51:11,233 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 20:51:11,259 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 20:51:11,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:51:11,267 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:51:11,279 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 20:51:11,309 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 20:51:11,310 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 20:51:11,310 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 20:51:11,312 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 20:51:11,312 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 20:51:11,319 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 20:51:11,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:51:11,413 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:51:11,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11 WrapperNode [2022-12-13 20:51:11,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:51:11,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:51:11,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:51:11,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:51:11,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,470 INFO L138 Inliner]: procedures = 503, calls = 69, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2022-12-13 20:51:11,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:51:11,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:51:11,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:51:11,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:51:11,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,495 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:51:11,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:51:11,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:51:11,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:51:11,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (1/1) ... [2022-12-13 20:51:11,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:51:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:51:11,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:51:11,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:51:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 20:51:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 20:51:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 20:51:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 20:51:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:51:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:51:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:51:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 20:51:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:51:11,685 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:51:11,688 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:51:11,878 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:51:11,884 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:51:11,885 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:51:11,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:51:11 BoogieIcfgContainer [2022-12-13 20:51:11,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:51:11,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:51:11,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:51:11,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:51:11,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:51:10" (1/3) ... [2022-12-13 20:51:11,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79da2b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:51:11, skipping insertion in model container [2022-12-13 20:51:11,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:11" (2/3) ... [2022-12-13 20:51:11,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79da2b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:51:11, skipping insertion in model container [2022-12-13 20:51:11,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:51:11" (3/3) ... [2022-12-13 20:51:11,895 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_10_good.i [2022-12-13 20:51:11,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:51:11,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 20:51:11,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:51:11,967 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;@471e66ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:51:11,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 20:51:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 53 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 20:51:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 20:51:11,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:11,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:51:11,977 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 20:51:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash 332326054, now seen corresponding path program 1 times [2022-12-13 20:51:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:11,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447337899] [2022-12-13 20:51:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,216 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 20:51:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447337899] [2022-12-13 20:51:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447337899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:51:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958834347] [2022-12-13 20:51:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,255 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 53 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 20:51:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,294 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2022-12-13 20:51:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2022-12-13 20:51:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,302 INFO L225 Difference]: With dead ends: 111 [2022-12-13 20:51:12,302 INFO L226 Difference]: Without dead ends: 51 [2022-12-13 20:51:12,305 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 20:51:12,307 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-13 20:51:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-13 20:51:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 44 states have internal predecessors, (47), 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 20:51:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-12-13 20:51:12,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 12 [2022-12-13 20:51:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,338 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-12-13 20:51:12,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 20:51:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-12-13 20:51:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 20:51:12,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:51:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:51:12,339 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 20:51:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1267729675, now seen corresponding path program 1 times [2022-12-13 20:51:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263296895] [2022-12-13 20:51:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,406 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 20:51:12,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263296895] [2022-12-13 20:51:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263296895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834424096] [2022-12-13 20:51:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,409 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 20:51:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,423 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-12-13 20:51:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-13 20:51:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,424 INFO L225 Difference]: With dead ends: 51 [2022-12-13 20:51:12,424 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 20:51:12,424 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 20:51:12,425 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 20:51:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 20:51:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.393939393939394) internal successors, (46), 43 states have internal predecessors, (46), 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 20:51:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-12-13 20:51:12,431 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 14 [2022-12-13 20:51:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,432 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-12-13 20:51:12,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 20:51:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-12-13 20:51:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 20:51:12,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:51:12,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:51:12,433 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 20:51:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 644914331, now seen corresponding path program 1 times [2022-12-13 20:51:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173325256] [2022-12-13 20:51:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,522 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 20:51:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173325256] [2022-12-13 20:51:12,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173325256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838433562] [2022-12-13 20:51:12,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,524 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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 20:51:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,534 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-12-13 20:51:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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 20:51:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,535 INFO L225 Difference]: With dead ends: 50 [2022-12-13 20:51:12,536 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 20:51:12,536 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 20:51:12,537 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 20:51:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-13 20:51:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 42 states have internal predecessors, (45), 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 20:51:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-12-13 20:51:12,542 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 15 [2022-12-13 20:51:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,543 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-12-13 20:51:12,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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 20:51:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-12-13 20:51:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:51:12,543 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,543 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] [2022-12-13 20:51:12,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:51:12,544 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 20:51:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash 881836552, now seen corresponding path program 1 times [2022-12-13 20:51:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035114745] [2022-12-13 20:51:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:51:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,592 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 20:51:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035114745] [2022-12-13 20:51:12,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035114745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:51:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659813545] [2022-12-13 20:51:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,594 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20:51:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,602 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-12-13 20:51:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 24 [2022-12-13 20:51:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,603 INFO L225 Difference]: With dead ends: 83 [2022-12-13 20:51:12,603 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 20:51:12,604 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 20:51:12,605 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 20:51:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-13 20:51:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.303030303030303) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:51:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-12-13 20:51:12,609 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2022-12-13 20:51:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,610 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-12-13 20:51:12,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20:51:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-12-13 20:51:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:51:12,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:51:12,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:51:12,611 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 20:51:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1942028122, now seen corresponding path program 1 times [2022-12-13 20:51:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077368020] [2022-12-13 20:51:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 20:51:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,651 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 20:51:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077368020] [2022-12-13 20:51:12,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077368020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106458656] [2022-12-13 20:51:12,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,653 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:51:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,665 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-12-13 20:51:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-13 20:51:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,666 INFO L225 Difference]: With dead ends: 47 [2022-12-13 20:51:12,666 INFO L226 Difference]: Without dead ends: 46 [2022-12-13 20:51:12,666 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 20:51:12,667 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-13 20:51:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-12-13 20:51:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 39 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:51:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-12-13 20:51:12,671 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-12-13 20:51:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,671 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-12-13 20:51:12,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:51:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-12-13 20:51:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:51:12,672 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,672 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 20:51:12,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:51:12,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 20:51:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 73329737, now seen corresponding path program 1 times [2022-12-13 20:51:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285779313] [2022-12-13 20:51:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 20:51:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,740 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 20:51:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285779313] [2022-12-13 20:51:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285779313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481118214] [2022-12-13 20:51:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,742 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:51:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,751 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-12-13 20:51:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-12-13 20:51:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,752 INFO L225 Difference]: With dead ends: 46 [2022-12-13 20:51:12,752 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 20:51:12,752 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 20:51:12,753 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 20:51:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-12-13 20:51:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:51:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-12-13 20:51:12,757 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 26 [2022-12-13 20:51:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,757 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-12-13 20:51:12,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 20:51:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-12-13 20:51:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 20:51:12,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,758 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] [2022-12-13 20:51:12,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:51:12,758 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 20:51:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,759 INFO L85 PathProgramCache]: Analyzing trace with hash 745918815, now seen corresponding path program 1 times [2022-12-13 20:51:12,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954116560] [2022-12-13 20:51:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 20:51:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 20:51:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,801 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 20:51:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954116560] [2022-12-13 20:51:12,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954116560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781791729] [2022-12-13 20:51:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,803 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 20:51:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,810 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-12-13 20:51:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 33 [2022-12-13 20:51:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,812 INFO L225 Difference]: With dead ends: 45 [2022-12-13 20:51:12,812 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 20:51:12,812 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 20:51:12,813 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 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 20:51:12,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 20:51:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-13 20:51:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:51:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-12-13 20:51:12,817 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-12-13 20:51:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,817 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-12-13 20:51:12,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 20:51:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-12-13 20:51:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 20:51:12,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,818 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] [2022-12-13 20:51:12,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:51:12,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 20:51:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1648646907, now seen corresponding path program 1 times [2022-12-13 20:51:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150551692] [2022-12-13 20:51:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 20:51:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 20:51:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,882 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 20:51:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150551692] [2022-12-13 20:51:12,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150551692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829242072] [2022-12-13 20:51:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,884 INFO L87 Difference]: Start difference. First operand 44 states and 52 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, (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 20:51:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,892 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-12-13 20:51:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,893 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, (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 34 [2022-12-13 20:51:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,894 INFO L225 Difference]: With dead ends: 44 [2022-12-13 20:51:12,894 INFO L226 Difference]: Without dead ends: 43 [2022-12-13 20:51:12,894 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 20:51:12,895 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 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 20:51:12,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-13 20:51:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-13 20:51:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:51:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-12-13 20:51:12,902 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 34 [2022-12-13 20:51:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,902 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-12-13 20:51:12,903 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, (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 20:51:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-12-13 20:51:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 20:51:12,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:51:12,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:51:12,905 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 20:51:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash 914121248, now seen corresponding path program 1 times [2022-12-13 20:51:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81340733] [2022-12-13 20:51:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 20:51:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 20:51:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:51:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:12,974 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 20:51:12,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:12,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81340733] [2022-12-13 20:51:12,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81340733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:12,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:12,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051146619] [2022-12-13 20:51:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:12,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:12,975 INFO L87 Difference]: Start difference. First operand 43 states and 51 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, (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 20:51:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:12,981 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-12-13 20:51:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:12,981 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, (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 42 [2022-12-13 20:51:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:12,982 INFO L225 Difference]: With dead ends: 43 [2022-12-13 20:51:12,982 INFO L226 Difference]: Without dead ends: 42 [2022-12-13 20:51:12,983 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 20:51:12,983 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:51:12,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-13 20:51:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-13 20:51:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 20:51:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-12-13 20:51:12,989 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 42 [2022-12-13 20:51:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:12,989 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-12-13 20:51:12,989 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, (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 20:51:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-12-13 20:51:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 20:51:12,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:51:12,990 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] [2022-12-13 20:51:12,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:51:12,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 20:51:12,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:51:12,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1727012244, now seen corresponding path program 1 times [2022-12-13 20:51:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:51:12,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747374950] [2022-12-13 20:51:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:51:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:51:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:51:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:13,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 20:51:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 20:51:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:51:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:51:13,038 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 20:51:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:51:13,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747374950] [2022-12-13 20:51:13,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747374950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:51:13,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:51:13,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:51:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715056955] [2022-12-13 20:51:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:51:13,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:51:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:51:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:51:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:51:13,039 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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 20:51:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:51:13,044 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-12-13 20:51:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:51:13,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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 43 [2022-12-13 20:51:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:51:13,045 INFO L225 Difference]: With dead ends: 42 [2022-12-13 20:51:13,045 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 20:51:13,045 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 20:51:13,046 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 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 20:51:13,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:51:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 20:51:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 20:51:13,047 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 20:51:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 20:51:13,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-12-13 20:51:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:51:13,047 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:51:13,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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 20:51:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 20:51:13,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 20:51:13,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 20:51:13,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:51:13,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 20:51:13,103 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 20:51:13,103 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 20:51:13,103 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 20:51:13,103 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 20:51:13,103 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 20:51:13,103 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 20:51:13,103 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 20:51:13,103 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1586) no Hoare annotation was computed. [2022-12-13 20:51:13,104 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1616) no Hoare annotation was computed. [2022-12-13 20:51:13,104 INFO L899 garLoopResultBuilder]: For program point L1621(lines 1621 1624) no Hoare annotation was computed. [2022-12-13 20:51:13,104 INFO L895 garLoopResultBuilder]: At program point L1588(line 1588) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= ~globalFalse~0 0) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (= ~globalTrue~0 1)) [2022-12-13 20:51:13,104 INFO L899 garLoopResultBuilder]: For program point L1621-2(lines 1618 1633) no Hoare annotation was computed. [2022-12-13 20:51:13,104 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (= ~globalTrue~0 1) [2022-12-13 20:51:13,104 INFO L895 garLoopResultBuilder]: At program point L1613(line 1613) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= ~globalFalse~0 0) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (= ~globalTrue~0 1)) [2022-12-13 20:51:13,104 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2022-12-13 20:51:13,104 INFO L899 garLoopResultBuilder]: For program point L1580(line 1580) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1641 1648) the Hoare annotation is: (= ~globalTrue~0 1) [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1628) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: (= ~globalTrue~0 1) [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point L1564-1(line 1564) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 20:51:13,105 INFO L899 garLoopResultBuilder]: For program point L1574(lines 1574 1595) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L895 garLoopResultBuilder]: At program point L1566(line 1566) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= ~globalFalse~0 0) (= ~globalTrue~0 1)) [2022-12-13 20:51:13,106 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1607) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L1600-1(lines 1597 1616) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= ~globalFalse~0 0) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (= ~globalTrue~0 1)) [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L1617(lines 1617 1633) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L1584(lines 1584 1593) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1640) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1611) no Hoare annotation was computed. [2022-12-13 20:51:13,106 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1555) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1549 1573) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L895 garLoopResultBuilder]: At program point L1602(line 1602) the Hoare annotation is: false [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1611) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1586-1(line 1586) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L895 garLoopResultBuilder]: At program point L1644(line 1644) the Hoare annotation is: (and (= ~globalFalse~0 0) (= ~globalTrue~0 1)) [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1644-1(line 1644) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1578(lines 1578 1581) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1611-1(line 1611) no Hoare annotation was computed. [2022-12-13 20:51:13,107 INFO L899 garLoopResultBuilder]: For program point L1578-2(lines 1575 1595) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= ~globalFalse~0 0) (= ~globalTrue~0 1)) [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1548 1573) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1586) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point L1628(line 1628) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point L1628-1(line 1628) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point L1562(lines 1562 1571) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point L1554-2(line 1554) no Hoare annotation was computed. [2022-12-13 20:51:13,108 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1628) no Hoare annotation was computed. [2022-12-13 20:51:13,111 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:51:13,113 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:51:13,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:51:13 BoogieIcfgContainer [2022-12-13 20:51:13,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:51:13,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:51:13,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:51:13,126 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:51:13,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:51:11" (3/4) ... [2022-12-13 20:51:13,130 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 20:51:13,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 20:51:13,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 20:51:13,140 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-12-13 20:51:13,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 20:51:13,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 20:51:13,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 20:51:13,180 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:51:13,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:51:13,181 INFO L158 Benchmark]: Toolchain (without parser) took 2629.73ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 95.4MB in the beginning and 78.3MB in the end (delta: 17.1MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,181 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 167.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:51:13,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 861.37ms. Allocated memory is still 125.8MB. Free memory was 95.0MB in the beginning and 73.8MB in the end (delta: 21.2MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.28ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 70.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,182 INFO L158 Benchmark]: Boogie Preprocessor took 28.76ms. Allocated memory is still 125.8MB. Free memory was 70.5MB in the beginning and 68.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,182 INFO L158 Benchmark]: RCFGBuilder took 386.28ms. Allocated memory is still 125.8MB. Free memory was 68.3MB in the beginning and 50.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,182 INFO L158 Benchmark]: TraceAbstraction took 1236.90ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 50.2MB in the beginning and 82.5MB in the end (delta: -32.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,183 INFO L158 Benchmark]: Witness Printer took 54.01ms. Allocated memory is still 169.9MB. Free memory was 82.5MB in the beginning and 78.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 20:51:13,184 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.14ms. Allocated memory is still 125.8MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 167.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 861.37ms. Allocated memory is still 125.8MB. Free memory was 95.0MB in the beginning and 73.8MB in the end (delta: 21.2MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.28ms. Allocated memory is still 125.8MB. Free memory was 73.8MB in the beginning and 70.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.76ms. Allocated memory is still 125.8MB. Free memory was 70.5MB in the beginning and 68.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.28ms. Allocated memory is still 125.8MB. Free memory was 68.3MB in the beginning and 50.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1236.90ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 50.2MB in the beginning and 82.5MB in the end (delta: -32.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Witness Printer took 54.01ms. Allocated memory is still 169.9MB. Free memory was 82.5MB in the beginning and 78.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: 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, 59 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 845 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 530 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 33 PreInvPairs, 41 NumberOfFragments, 84 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 60/60 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: 1641]: Loop Invariant Derived loop invariant: globalTrue == 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 20:51:13,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e55f0aa-1709-44a9-8d3f-025b0638ee7c/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