./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN --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 7a91a43dabf08728aa1c777480ae74ba97759d8b76938ed83c53d35ac672a135 --- 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-6b4ec56 [2022-11-20 10:49:18,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:49:18,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:49:18,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:49:18,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:49:18,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:49:18,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:49:18,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:49:18,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:49:18,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:49:18,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:49:18,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:49:18,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:49:18,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:49:18,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:49:18,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:49:18,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:49:18,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:49:18,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:49:18,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:49:18,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:49:18,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:49:18,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:49:18,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:49:18,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:49:18,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:49:18,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:49:18,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:49:18,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:49:18,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:49:18,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:49:18,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:49:18,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:49:18,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:49:18,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:49:18,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:49:18,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:49:18,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:49:18,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:49:18,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:49:18,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:49:18,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 10:49:18,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:49:18,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:49:18,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:49:18,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:49:18,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:49:18,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:49:18,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:49:18,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:49:18,462 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:49:18,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:49:18,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:49:18,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:49:18,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:49:18,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:49:18,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:49:18,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:49:18,465 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:49:18,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:49:18,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:49:18,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:49:18,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:49:18,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:49:18,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:49:18,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:49:18,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:49:18,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:49:18,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:49:18,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:49:18,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:49:18,469 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:49:18,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:49:18,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:49:18,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/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_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN 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 -> 7a91a43dabf08728aa1c777480ae74ba97759d8b76938ed83c53d35ac672a135 [2022-11-20 10:49:18,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:49:18,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:49:18,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:49:18,811 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:49:18,812 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:49:18,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i [2022-11-20 10:49:21,977 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:49:22,381 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:49:22,382 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i [2022-11-20 10:49:22,411 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/data/f102a93ea/688d2cf15fd24beeb0d7e9195812826e/FLAGe86362060 [2022-11-20 10:49:22,431 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/data/f102a93ea/688d2cf15fd24beeb0d7e9195812826e [2022-11-20 10:49:22,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:49:22,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:49:22,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:49:22,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:49:22,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:49:22,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:49:22" (1/1) ... [2022-11-20 10:49:22,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12958d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:22, skipping insertion in model container [2022-11-20 10:49:22,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:49:22" (1/1) ... [2022-11-20 10:49:22,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:49:22,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:49:22,988 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 10:49:23,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:49:23,519 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:49:23,539 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 10:49:23,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:49:23,740 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:49:23,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23 WrapperNode [2022-11-20 10:49:23,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:49:23,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:49:23,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:49:23,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:49:23,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,810 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 175 [2022-11-20 10:49:23,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:49:23,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:49:23,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:49:23,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:49:23,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,856 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:49:23,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:49:23,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:49:23,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:49:23,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (1/1) ... [2022-11-20 10:49:23,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:49:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:23,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:23,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:49:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-20 10:49:23,974 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-20 10:49:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-20 10:49:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-20 10:49:23,975 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-20 10:49:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:49:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-20 10:49:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:49:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:49:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:49:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:49:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-20 10:49:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:49:24,179 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:49:24,181 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:49:24,541 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:49:24,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:49:24,548 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:49:24,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:49:24 BoogieIcfgContainer [2022-11-20 10:49:24,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:49:24,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:49:24,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:49:24,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:49:24,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:49:22" (1/3) ... [2022-11-20 10:49:24,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4742d15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:49:24, skipping insertion in model container [2022-11-20 10:49:24,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:23" (2/3) ... [2022-11-20 10:49:24,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4742d15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:49:24, skipping insertion in model container [2022-11-20 10:49:24,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:49:24" (3/3) ... [2022-11-20 10:49:24,560 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_15_good.i [2022-11-20 10:49:24,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:49:24,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-20 10:49:24,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:49:24,699 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;@277dea4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:49:24,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 10:49:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-20 10:49:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:49:24,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:24,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:24,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313757, now seen corresponding path program 1 times [2022-11-20 10:49:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:24,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471361137] [2022-11-20 10:49:24,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471361137] [2022-11-20 10:49:25,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471361137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586601938] [2022-11-20 10:49:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,179 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:25,260 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2022-11-20 10:49:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-20 10:49:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:25,275 INFO L225 Difference]: With dead ends: 156 [2022-11-20 10:49:25,276 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:49:25,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,285 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:25,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:49:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:49:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 10:49:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-11-20 10:49:25,351 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 15 [2022-11-20 10:49:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:25,353 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-11-20 10:49:25,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-11-20 10:49:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:49:25,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:25,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:49:25,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1328587979, now seen corresponding path program 1 times [2022-11-20 10:49:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:25,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474150688] [2022-11-20 10:49:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:25,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474150688] [2022-11-20 10:49:25,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474150688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383057549] [2022-11-20 10:49:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,513 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:25,560 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2022-11-20 10:49:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 10:49:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:25,563 INFO L225 Difference]: With dead ends: 172 [2022-11-20 10:49:25,563 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 10:49:25,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,565 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 57 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:25,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 262 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 10:49:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2022-11-20 10:49:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 states have internal predecessors, (76), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 10:49:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2022-11-20 10:49:25,580 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 16 [2022-11-20 10:49:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:25,581 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2022-11-20 10:49:25,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2022-11-20 10:49:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:49:25,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:25,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:25,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:49:25,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1763445692, now seen corresponding path program 1 times [2022-11-20 10:49:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080362604] [2022-11-20 10:49:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080362604] [2022-11-20 10:49:25,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080362604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705973386] [2022-11-20 10:49:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,672 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:25,690 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2022-11-20 10:49:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-20 10:49:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:25,693 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:49:25,693 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 10:49:25,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,695 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 52 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:25,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 10:49:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-20 10:49:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 10:49:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2022-11-20 10:49:25,708 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 17 [2022-11-20 10:49:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:25,709 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-11-20 10:49:25,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2022-11-20 10:49:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:49:25,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:25,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:25,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:49:25,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash 799401358, now seen corresponding path program 1 times [2022-11-20 10:49:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:25,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005148610] [2022-11-20 10:49:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005148610] [2022-11-20 10:49:25,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005148610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178195756] [2022-11-20 10:49:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,766 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:25,786 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2022-11-20 10:49:25,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-20 10:49:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:25,788 INFO L225 Difference]: With dead ends: 124 [2022-11-20 10:49:25,788 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 10:49:25,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,790 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:25,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 10:49:25,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-20 10:49:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 10:49:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-11-20 10:49:25,803 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 22 [2022-11-20 10:49:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:25,804 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-11-20 10:49:25,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:49:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-11-20 10:49:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:49:25,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:25,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:25,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:49:25,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:25,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 510911504, now seen corresponding path program 1 times [2022-11-20 10:49:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:25,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98760955] [2022-11-20 10:49:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:49:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:49:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98760955] [2022-11-20 10:49:25,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98760955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84803889] [2022-11-20 10:49:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,880 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:49:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:25,905 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2022-11-20 10:49:25,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-20 10:49:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:25,909 INFO L225 Difference]: With dead ends: 124 [2022-11-20 10:49:25,909 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 10:49:25,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,917 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:25,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 10:49:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 10:49:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-20 10:49:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-11-20 10:49:25,941 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 26 [2022-11-20 10:49:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:25,942 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-20 10:49:25,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:49:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-11-20 10:49:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 10:49:25,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:25,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:25,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:49:25,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 612038571, now seen corresponding path program 1 times [2022-11-20 10:49:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:25,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861756858] [2022-11-20 10:49:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:49:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861756858] [2022-11-20 10:49:26,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861756858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904401077] [2022-11-20 10:49:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,040 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,091 INFO L93 Difference]: Finished difference Result 115 states and 154 transitions. [2022-11-20 10:49:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-20 10:49:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,093 INFO L225 Difference]: With dead ends: 115 [2022-11-20 10:49:26,093 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:49:26,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,095 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:49:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:49:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.36) internal successors, (68), 64 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:49:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2022-11-20 10:49:26,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 28 [2022-11-20 10:49:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:26,108 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2022-11-20 10:49:26,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2022-11-20 10:49:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:49:26,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:26,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:26,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:49:26,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:26,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1126717929, now seen corresponding path program 1 times [2022-11-20 10:49:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836554104] [2022-11-20 10:49:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:49:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836554104] [2022-11-20 10:49:26,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836554104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:26,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748833950] [2022-11-20 10:49:26,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,256 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,301 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2022-11-20 10:49:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-20 10:49:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,304 INFO L225 Difference]: With dead ends: 134 [2022-11-20 10:49:26,304 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 10:49:26,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,306 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 205 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 10:49:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2022-11-20 10:49:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 66 states have internal predecessors, (72), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:49:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-11-20 10:49:26,319 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 29 [2022-11-20 10:49:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:26,320 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-11-20 10:49:26,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-11-20 10:49:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:49:26,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:26,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:26,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:49:26,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash 568517554, now seen corresponding path program 1 times [2022-11-20 10:49:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692427682] [2022-11-20 10:49:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:49:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692427682] [2022-11-20 10:49:26,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692427682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155828050] [2022-11-20 10:49:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,450 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,480 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-11-20 10:49:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-20 10:49:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,486 INFO L225 Difference]: With dead ends: 73 [2022-11-20 10:49:26,486 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 10:49:26,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,492 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 10:49:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 10:49:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 65 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:49:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-20 10:49:26,507 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 30 [2022-11-20 10:49:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:26,515 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-20 10:49:26,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2022-11-20 10:49:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:49:26,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:26,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:26,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:49:26,517 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -243306749, now seen corresponding path program 1 times [2022-11-20 10:49:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238896833] [2022-11-20 10:49:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:49:26,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238896833] [2022-11-20 10:49:26,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238896833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738741769] [2022-11-20 10:49:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,578 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,590 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-11-20 10:49:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-20 10:49:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,592 INFO L225 Difference]: With dead ends: 104 [2022-11-20 10:49:26,592 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:49:26,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,593 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:49:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:49:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 62 states have internal predecessors, (67), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:49:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-11-20 10:49:26,616 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 35 [2022-11-20 10:49:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:26,617 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-11-20 10:49:26,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:49:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-11-20 10:49:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 10:49:26,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:26,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:26,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:49:26,623 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1207061858, now seen corresponding path program 1 times [2022-11-20 10:49:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090174284] [2022-11-20 10:49:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:49:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090174284] [2022-11-20 10:49:26,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090174284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085837194] [2022-11-20 10:49:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,745 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:49:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,796 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-11-20 10:49:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-20 10:49:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,798 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:49:26,798 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 10:49:26,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,799 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 155 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 10:49:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2022-11-20 10:49:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:49:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-11-20 10:49:26,809 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 40 [2022-11-20 10:49:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:26,809 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-11-20 10:49:26,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:49:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-11-20 10:49:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 10:49:26,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:26,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:26,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:49:26,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1207002276, now seen corresponding path program 1 times [2022-11-20 10:49:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264706593] [2022-11-20 10:49:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:49:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264706593] [2022-11-20 10:49:26,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264706593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485416265] [2022-11-20 10:49:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,872 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:49:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,884 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2022-11-20 10:49:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-20 10:49:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,885 INFO L225 Difference]: With dead ends: 101 [2022-11-20 10:49:26,885 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 10:49:26,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,886 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 10:49:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-20 10:49:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 states have internal predecessors, (71), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:49:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-11-20 10:49:26,895 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 40 [2022-11-20 10:49:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:26,896 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-11-20 10:49:26,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:49:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-11-20 10:49:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:49:26,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:26,897 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:26,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:49:26,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 210930585, now seen corresponding path program 1 times [2022-11-20 10:49:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851367113] [2022-11-20 10:49:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 10:49:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:49:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851367113] [2022-11-20 10:49:26,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851367113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180434116] [2022-11-20 10:49:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,974 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:49:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:26,991 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2022-11-20 10:49:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-11-20 10:49:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:26,993 INFO L225 Difference]: With dead ends: 95 [2022-11-20 10:49:26,993 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 10:49:26,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,995 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:26,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 10:49:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-20 10:49:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 59 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 10:49:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-11-20 10:49:27,048 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 44 [2022-11-20 10:49:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:27,049 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-11-20 10:49:27,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:49:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-11-20 10:49:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 10:49:27,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:27,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:27,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:49:27,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1068830320, now seen corresponding path program 1 times [2022-11-20 10:49:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:27,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982535949] [2022-11-20 10:49:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:49:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982535949] [2022-11-20 10:49:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982535949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:27,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:27,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480694987] [2022-11-20 10:49:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:27,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,127 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:49:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:27,139 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-20 10:49:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:27,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-20 10:49:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:27,140 INFO L225 Difference]: With dead ends: 82 [2022-11-20 10:49:27,141 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 10:49:27,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,145 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:27,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 10:49:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:49:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 56 states have internal predecessors, (60), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 10:49:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-20 10:49:27,155 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 46 [2022-11-20 10:49:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:27,156 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-20 10:49:27,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:49:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-20 10:49:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:49:27,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:27,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:27,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:49:27,159 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:27,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2085155984, now seen corresponding path program 1 times [2022-11-20 10:49:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:27,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261528399] [2022-11-20 10:49:27,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:49:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:49:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261528399] [2022-11-20 10:49:27,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261528399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:27,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:27,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143898274] [2022-11-20 10:49:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:27,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:27,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,276 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:49:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:27,307 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-11-20 10:49:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:27,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-20 10:49:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:27,309 INFO L225 Difference]: With dead ends: 71 [2022-11-20 10:49:27,309 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 10:49:27,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,310 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:27,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 10:49:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:49:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 56 states have internal predecessors, (59), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 10:49:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-20 10:49:27,316 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 51 [2022-11-20 10:49:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:27,316 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-20 10:49:27,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:49:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-20 10:49:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:49:27,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:27,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:27,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:49:27,318 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 10:49:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash -213541358, now seen corresponding path program 1 times [2022-11-20 10:49:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:27,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470723003] [2022-11-20 10:49:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 10:49:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:49:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:49:27,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:27,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470723003] [2022-11-20 10:49:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470723003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:27,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:27,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801717124] [2022-11-20 10:49:27,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:27,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:27,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,405 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:49:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:27,415 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-20 10:49:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-20 10:49:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:27,415 INFO L225 Difference]: With dead ends: 69 [2022-11-20 10:49:27,415 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:49:27,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,419 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:27,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:49:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:49:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:49:27,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-20 10:49:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:27,422 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:49:27,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:49:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:49:27,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:49:27,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-20 10:49:27,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-20 10:49:27,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-20 10:49:27,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-20 10:49:27,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-20 10:49:27,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-20 10:49:27,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-20 10:49:27,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-20 10:49:27,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:49:27,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:49:27,640 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-20 10:49:27,640 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-20 10:49:27,640 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-20 10:49:27,640 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-20 10:49:27,641 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-20 10:49:27,641 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-20 10:49:27,641 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-20 10:49:27,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-20 10:49:27,642 INFO L902 garLoopResultBuilder]: At program point L1695(lines 1689 1696) the Hoare annotation is: true [2022-11-20 10:49:27,642 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2022-11-20 10:49:27,642 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-20 10:49:27,642 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-11-20 10:49:27,643 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-20 10:49:27,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2022-11-20 10:49:27,643 INFO L899 garLoopResultBuilder]: For program point L1671(line 1671) no Hoare annotation was computed. [2022-11-20 10:49:27,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-20 10:49:27,643 INFO L899 garLoopResultBuilder]: For program point L1630(lines 1630 1655) no Hoare annotation was computed. [2022-11-20 10:49:27,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:49:27,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:49:27,644 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,644 INFO L899 garLoopResultBuilder]: For program point L1589(lines 1589 1629) no Hoare annotation was computed. [2022-11-20 10:49:27,644 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-11-20 10:49:27,644 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-11-20 10:49:27,645 INFO L899 garLoopResultBuilder]: For program point L1647-1(line 1647) no Hoare annotation was computed. [2022-11-20 10:49:27,645 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1588) no Hoare annotation was computed. [2022-11-20 10:49:27,645 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2022-11-20 10:49:27,646 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-11-20 10:49:27,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-20 10:49:27,646 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1605) no Hoare annotation was computed. [2022-11-20 10:49:27,646 INFO L899 garLoopResultBuilder]: For program point L1656(lines 1656 1681) no Hoare annotation was computed. [2022-11-20 10:49:27,646 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-11-20 10:49:27,647 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,647 INFO L899 garLoopResultBuilder]: For program point L1615(lines 1615 1623) no Hoare annotation was computed. [2022-11-20 10:49:27,647 INFO L899 garLoopResultBuilder]: For program point L1673(line 1673) no Hoare annotation was computed. [2022-11-20 10:49:27,647 INFO L899 garLoopResultBuilder]: For program point L1673-1(line 1673) no Hoare annotation was computed. [2022-11-20 10:49:27,648 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-11-20 10:49:27,648 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-20 10:49:27,648 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1688) no Hoare annotation was computed. [2022-11-20 10:49:27,648 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-20 10:49:27,648 INFO L899 garLoopResultBuilder]: For program point L1608(line 1608) no Hoare annotation was computed. [2022-11-20 10:49:27,648 INFO L895 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: false [2022-11-20 10:49:27,648 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-11-20 10:49:27,649 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-20 10:49:27,649 INFO L899 garLoopResultBuilder]: For program point L1617(line 1617) no Hoare annotation was computed. [2022-11-20 10:49:27,649 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-20 10:49:27,649 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2022-11-20 10:49:27,649 INFO L895 garLoopResultBuilder]: At program point L1609(line 1609) the Hoare annotation is: false [2022-11-20 10:49:27,649 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-20 10:49:27,650 INFO L895 garLoopResultBuilder]: At program point L1634(lines 1634 1642) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) |ULTIMATE.start_goodG2B1_#t~switch100#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,650 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-20 10:49:27,650 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:49:27,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2022-11-20 10:49:27,650 INFO L902 garLoopResultBuilder]: At program point L1692(line 1692) the Hoare annotation is: true [2022-11-20 10:49:27,651 INFO L899 garLoopResultBuilder]: For program point L1692-1(line 1692) no Hoare annotation was computed. [2022-11-20 10:49:27,651 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2022-11-20 10:49:27,651 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1611) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,651 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-11-20 10:49:27,651 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,651 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-20 10:49:27,652 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1654) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,653 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1585) no Hoare annotation was computed. [2022-11-20 10:49:27,653 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:49:27,653 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2022-11-20 10:49:27,653 INFO L895 garLoopResultBuilder]: At program point L1660(lines 1660 1668) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,653 INFO L895 garLoopResultBuilder]: At program point L1652(line 1652) the Hoare annotation is: false [2022-11-20 10:49:27,654 INFO L899 garLoopResultBuilder]: For program point L1677(line 1677) no Hoare annotation was computed. [2022-11-20 10:49:27,654 INFO L902 garLoopResultBuilder]: At program point L1669(lines 1669 1680) the Hoare annotation is: true [2022-11-20 10:49:27,654 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-11-20 10:49:27,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-20 10:49:27,654 INFO L902 garLoopResultBuilder]: At program point L1694(line 1694) the Hoare annotation is: true [2022-11-20 10:49:27,654 INFO L899 garLoopResultBuilder]: For program point L1694-1(line 1694) no Hoare annotation was computed. [2022-11-20 10:49:27,655 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-20 10:49:27,655 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-20 10:49:27,655 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-20 10:49:27,655 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-20 10:49:27,655 INFO L895 garLoopResultBuilder]: At program point L1612(lines 1612 1628) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,655 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-11-20 10:49:27,656 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-11-20 10:49:27,656 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2022-11-20 10:49:27,656 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: false [2022-11-20 10:49:27,656 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-20 10:49:27,656 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1587) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-20 10:49:27,656 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1598 1605) no Hoare annotation was computed. [2022-11-20 10:49:27,660 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:27,663 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:49:27,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:49:27 BoogieIcfgContainer [2022-11-20 10:49:27,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:49:27,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:49:27,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:49:27,687 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:49:27,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:49:24" (3/4) ... [2022-11-20 10:49:27,691 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:49:27,697 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-20 10:49:27,698 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-20 10:49:27,706 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-20 10:49:27,706 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-20 10:49:27,707 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 10:49:27,709 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:49:27,709 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:49:27,759 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:49:27,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:49:27,760 INFO L158 Benchmark]: Toolchain (without parser) took 5320.35ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 115.4MB in the beginning and 92.7MB in the end (delta: 22.7MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2022-11-20 10:49:27,760 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 77.7MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:49:27,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1299.92ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 70.5MB in the end (delta: 44.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-20 10:49:27,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.81ms. Allocated memory is still 161.5MB. Free memory was 70.5MB in the beginning and 67.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:49:27,761 INFO L158 Benchmark]: Boogie Preprocessor took 43.59ms. Allocated memory is still 161.5MB. Free memory was 67.5MB in the beginning and 65.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:49:27,761 INFO L158 Benchmark]: RCFGBuilder took 688.54ms. Allocated memory is still 161.5MB. Free memory was 65.7MB in the beginning and 47.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:49:27,762 INFO L158 Benchmark]: TraceAbstraction took 3133.36ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 46.9MB in the beginning and 96.9MB in the end (delta: -50.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:49:27,762 INFO L158 Benchmark]: Witness Printer took 72.07ms. Allocated memory is still 201.3MB. Free memory was 96.9MB in the beginning and 92.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:49:27,764 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.22ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 77.7MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1299.92ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 70.5MB in the end (delta: 44.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.81ms. Allocated memory is still 161.5MB. Free memory was 70.5MB in the beginning and 67.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.59ms. Allocated memory is still 161.5MB. Free memory was 67.5MB in the beginning and 65.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.54ms. Allocated memory is still 161.5MB. Free memory was 65.7MB in the beginning and 47.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3133.36ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 46.9MB in the beginning and 96.9MB in the end (delta: -50.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.07ms. Allocated memory is still 201.3MB. Free memory was 96.9MB in the beginning and 92.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 2415 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1062 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1353 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 86 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 111 PreInvPairs, 131 NumberOfFragments, 175 HoareAnnotationTreeSize, 111 FomulaSimplifications, 80 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 104/104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data < 0x7fffffff) { int result = data + 1; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1660]: Loop Invariant Derived loop invariant: (0 <= data + 2147483648 && data == 2) && 0 <= data + 2147483648 - InvariantResult [Line: 1634]: Loop Invariant Derived loop invariant: ((2 == data && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = 2; break; }-aux) && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: { int result = data + 1; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1612]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data < 0x7fffffff) { int result = data + 1; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 RESULT: Ultimate proved your program to be correct! [2022-11-20 10:49:27,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8bccc3-aaa5-445d-ae28-7efedf0c6bbf/bin/uautomizer-ug76WZFUDN/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