./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51ccbaa2988d04f4dc74974694add0529ac8a83852aa1c5cd464965ea1329ad9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:55:21,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:55:21,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:55:21,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:55:21,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:55:21,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:55:21,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:55:21,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:55:21,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:55:21,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:55:21,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:55:21,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:55:21,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:55:21,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:55:21,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:55:21,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:55:21,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:55:21,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:55:21,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:55:21,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:55:21,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:55:21,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:55:21,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:55:21,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:55:21,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:55:21,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:55:21,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:55:21,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:55:21,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:55:21,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:55:21,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:55:21,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:55:21,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:55:21,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:55:21,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:55:21,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:55:21,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:55:21,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:55:21,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:55:21,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:55:21,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:55:21,513 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 18:55:21,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:55:21,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:55:21,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:55:21,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:55:21,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:55:21,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:55:21,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:55:21,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:55:21,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:55:21,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:55:21,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:55:21,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:55:21,530 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51ccbaa2988d04f4dc74974694add0529ac8a83852aa1c5cd464965ea1329ad9 [2022-12-13 18:55:21,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:55:21,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:55:21,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:55:21,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:55:21,712 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:55:21,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i [2022-12-13 18:55:24,341 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:55:24,604 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:55:24,604 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i [2022-12-13 18:55:24,618 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/data/1b87f66b8/b309fce3cc1a4097b4e0f9644bdcad07/FLAG8cb1e31ba [2022-12-13 18:55:24,629 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/data/1b87f66b8/b309fce3cc1a4097b4e0f9644bdcad07 [2022-12-13 18:55:24,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:55:24,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:55:24,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:55:24,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:55:24,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:55:24,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:55:24" (1/1) ... [2022-12-13 18:55:24,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5182f178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:24, skipping insertion in model container [2022-12-13 18:55:24,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:55:24" (1/1) ... [2022-12-13 18:55:24,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:55:24,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:55:24,905 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 18:55:25,203 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 18:55:25,207 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:55:25,209 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:55:25,211 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:55:25,211 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:55:25,228 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-13 18:55:25,234 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-13 18:55:25,243 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 18:55:25,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:55:25,251 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:55:25,265 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 18:55:25,309 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 18:55:25,310 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:55:25,311 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 18:55:25,313 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:55:25,313 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 18:55:25,316 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-13 18:55:25,318 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-13 18:55:25,322 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 18:55:25,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:55:25,442 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:55:25,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25 WrapperNode [2022-12-13 18:55:25,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:55:25,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:55:25,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:55:25,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:55:25,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,506 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 187 [2022-12-13 18:55:25,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:55:25,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:55:25,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:55:25,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:55:25,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:55:25,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:55:25,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:55:25,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:55:25,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (1/1) ... [2022-12-13 18:55:25,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:55:25,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:55:25,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:55:25,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:55:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 18:55:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 18:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-13 18:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 18:55:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 18:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 18:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:55:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:55:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:55:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:55:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 18:55:25,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:55:25,724 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:55:25,726 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:55:25,915 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:55:25,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:55:25,921 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:55:25,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:55:25 BoogieIcfgContainer [2022-12-13 18:55:25,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:55:25,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:55:25,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:55:25,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:55:25,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:55:24" (1/3) ... [2022-12-13 18:55:25,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b07b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:55:25, skipping insertion in model container [2022-12-13 18:55:25,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:55:25" (2/3) ... [2022-12-13 18:55:25,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b07b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:55:25, skipping insertion in model container [2022-12-13 18:55:25,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:55:25" (3/3) ... [2022-12-13 18:55:25,932 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_15_good.i [2022-12-13 18:55:25,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:55:25,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 18:55:25,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:55:25,992 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;@4921b3bb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:55:25,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 18:55:25,995 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-12-13 18:55:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 18:55:26,001 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313757, now seen corresponding path program 1 times [2022-12-13 18:55:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821354395] [2022-12-13 18:55:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821354395] [2022-12-13 18:55:26,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821354395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28497072] [2022-12-13 18:55:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,238 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-12-13 18:55:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,266 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2022-12-13 18:55:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-13 18:55:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,274 INFO L225 Difference]: With dead ends: 156 [2022-12-13 18:55:26,274 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 18:55:26,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,279 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-12-13 18:55:26,280 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-12-13 18:55:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 18:55:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-13 18:55:26,308 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-12-13 18:55:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-12-13 18:55:26,311 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 15 [2022-12-13 18:55:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,312 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-12-13 18:55:26,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-12-13 18:55:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 18:55:26,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:55:26,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1328587979, now seen corresponding path program 1 times [2022-12-13 18:55:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982280157] [2022-12-13 18:55:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982280157] [2022-12-13 18:55:26,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982280157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:55:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270431655] [2022-12-13 18:55:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:26,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,437 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-12-13 18:55:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,450 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-12-13 18:55:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 18:55:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,452 INFO L225 Difference]: With dead ends: 70 [2022-12-13 18:55:26,452 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 18:55:26,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,453 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:26,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 18:55:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-13 18:55:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5) internal successors, (69), 65 states have internal predecessors, (69), 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-12-13 18:55:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2022-12-13 18:55:26,459 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 16 [2022-12-13 18:55:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,460 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2022-12-13 18:55:26,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2022-12-13 18:55:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 18:55:26,460 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:55:26,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1763445692, now seen corresponding path program 1 times [2022-12-13 18:55:26,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013400306] [2022-12-13 18:55:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013400306] [2022-12-13 18:55:26,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013400306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416093395] [2022-12-13 18:55:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:26,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:26,556 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,580 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2022-12-13 18:55:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:26,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-13 18:55:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,581 INFO L225 Difference]: With dead ends: 69 [2022-12-13 18:55:26,581 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:55:26,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:55:26,582 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:26,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:55:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 18:55:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 64 states have internal predecessors, (68), 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-12-13 18:55:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-12-13 18:55:26,589 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 17 [2022-12-13 18:55:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,589 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-12-13 18:55:26,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2022-12-13 18:55:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 18:55:26,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:55:26,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash 799401358, now seen corresponding path program 1 times [2022-12-13 18:55:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013192121] [2022-12-13 18:55:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:55:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013192121] [2022-12-13 18:55:26,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013192121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923716612] [2022-12-13 18:55:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,638 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,656 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2022-12-13 18:55:26,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:26,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-12-13 18:55:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,658 INFO L225 Difference]: With dead ends: 119 [2022-12-13 18:55:26,658 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:55:26,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,660 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-12-13 18:55:26,661 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-12-13 18:55:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:55:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 18:55:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 63 states have internal predecessors, (67), 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-12-13 18:55:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-12-13 18:55:26,670 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 22 [2022-12-13 18:55:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,670 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-12-13 18:55:26,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:55:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2022-12-13 18:55:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 18:55:26,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,671 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:55:26,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 510911504, now seen corresponding path program 1 times [2022-12-13 18:55:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283871323] [2022-12-13 18:55:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:55:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:55:26,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283871323] [2022-12-13 18:55:26,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283871323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305709522] [2022-12-13 18:55:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:26,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,726 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,741 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2022-12-13 18:55:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-12-13 18:55:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,742 INFO L225 Difference]: With dead ends: 119 [2022-12-13 18:55:26,742 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 18:55:26,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,744 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-12-13 18:55:26,744 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-12-13 18:55:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 18:55:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-13 18:55:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 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-12-13 18:55:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2022-12-13 18:55:26,752 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 26 [2022-12-13 18:55:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,752 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2022-12-13 18:55:26,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:55:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-12-13 18:55:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 18:55:26,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:55:26,754 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 612038571, now seen corresponding path program 1 times [2022-12-13 18:55:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962425924] [2022-12-13 18:55:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:55:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962425924] [2022-12-13 18:55:26,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962425924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800449491] [2022-12-13 18:55:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,805 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,817 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-12-13 18:55:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-12-13 18:55:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,819 INFO L225 Difference]: With dead ends: 110 [2022-12-13 18:55:26,819 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 18:55:26,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,821 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-12-13 18:55:26,821 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-12-13 18:55:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 18:55:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-13 18:55:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:55:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-12-13 18:55:26,839 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 28 [2022-12-13 18:55:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,840 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-12-13 18:55:26,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-12-13 18:55:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 18:55:26,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:55:26,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1126717929, now seen corresponding path program 1 times [2022-12-13 18:55:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293866312] [2022-12-13 18:55:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:55:26,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:26,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293866312] [2022-12-13 18:55:26,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293866312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:26,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:26,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:55:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86787681] [2022-12-13 18:55:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:26,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:26,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:26,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,959 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:26,970 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-12-13 18:55:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:26,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-12-13 18:55:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:26,971 INFO L225 Difference]: With dead ends: 65 [2022-12-13 18:55:26,971 INFO L226 Difference]: Without dead ends: 64 [2022-12-13 18:55:26,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:26,973 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:26,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-13 18:55:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-12-13 18:55:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 59 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:55:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-12-13 18:55:26,978 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 29 [2022-12-13 18:55:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:26,978 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-12-13 18:55:26,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-12-13 18:55:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 18:55:26,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:26,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:26,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:55:26,980 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 568517554, now seen corresponding path program 1 times [2022-12-13 18:55:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:26,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32776753] [2022-12-13 18:55:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:55:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32776753] [2022-12-13 18:55:27,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32776753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573643882] [2022-12-13 18:55:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:27,044 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,062 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-12-13 18:55:27,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:27,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 18:55:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,063 INFO L225 Difference]: With dead ends: 64 [2022-12-13 18:55:27,063 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 18:55:27,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:55:27,065 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:27,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 198 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 18:55:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 18:55:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 58 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 18:55:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-12-13 18:55:27,070 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 30 [2022-12-13 18:55:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,070 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-12-13 18:55:27,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-12-13 18:55:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 18:55:27,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:55:27,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash -243306749, now seen corresponding path program 1 times [2022-12-13 18:55:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124882232] [2022-12-13 18:55:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:55:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124882232] [2022-12-13 18:55:27,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124882232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486952288] [2022-12-13 18:55:27,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:27,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,111 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,118 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-12-13 18:55:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-12-13 18:55:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,120 INFO L225 Difference]: With dead ends: 95 [2022-12-13 18:55:27,120 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 18:55:27,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,122 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-12-13 18:55:27,122 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-12-13 18:55:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 18:55:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-12-13 18:55:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 18:55:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-12-13 18:55:27,126 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 35 [2022-12-13 18:55:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,126 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-12-13 18:55:27,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 18:55:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-12-13 18:55:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 18:55:27,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:55:27,127 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1207061858, now seen corresponding path program 1 times [2022-12-13 18:55:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033591404] [2022-12-13 18:55:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033591404] [2022-12-13 18:55:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033591404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111319466] [2022-12-13 18:55:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:27,184 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,202 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-12-13 18:55:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-12-13 18:55:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,203 INFO L225 Difference]: With dead ends: 72 [2022-12-13 18:55:27,203 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 18:55:27,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:55:27,204 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:27,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 18:55:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2022-12-13 18:55:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 54 states have internal predecessors, (57), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 18:55:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-12-13 18:55:27,209 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 40 [2022-12-13 18:55:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,209 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-12-13 18:55:27,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-12-13 18:55:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:55:27,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:55:27,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1235788226, now seen corresponding path program 1 times [2022-12-13 18:55:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286467229] [2022-12-13 18:55:27,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286467229] [2022-12-13 18:55:27,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286467229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345779338] [2022-12-13 18:55:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:27,278 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,302 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-12-13 18:55:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-12-13 18:55:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,303 INFO L225 Difference]: With dead ends: 79 [2022-12-13 18:55:27,303 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 18:55:27,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:55:27,304 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:27,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 18:55:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2022-12-13 18:55:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 18:55:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2022-12-13 18:55:27,310 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 41 [2022-12-13 18:55:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,311 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2022-12-13 18:55:27,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2022-12-13 18:55:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 18:55:27,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,312 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:55:27,312 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1237635268, now seen corresponding path program 1 times [2022-12-13 18:55:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297241261] [2022-12-13 18:55:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297241261] [2022-12-13 18:55:27,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297241261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457489873] [2022-12-13 18:55:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,362 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,373 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-12-13 18:55:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-12-13 18:55:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,374 INFO L225 Difference]: With dead ends: 90 [2022-12-13 18:55:27,374 INFO L226 Difference]: Without dead ends: 64 [2022-12-13 18:55:27,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,375 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:27,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-13 18:55:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-12-13 18:55:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 57 states have internal predecessors, (61), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 18:55:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-12-13 18:55:27,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 41 [2022-12-13 18:55:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,381 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-12-13 18:55:27,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-12-13 18:55:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 18:55:27,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,382 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:55:27,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2051086297, now seen corresponding path program 1 times [2022-12-13 18:55:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058594764] [2022-12-13 18:55:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 18:55:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 18:55:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058594764] [2022-12-13 18:55:27,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058594764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770015755] [2022-12-13 18:55:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:27,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,426 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:55:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,434 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-12-13 18:55:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-12-13 18:55:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,435 INFO L225 Difference]: With dead ends: 85 [2022-12-13 18:55:27,435 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 18:55:27,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,435 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-12-13 18:55:27,436 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-12-13 18:55:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 18:55:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 18:55:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 52 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 18:55:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-12-13 18:55:27,440 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 45 [2022-12-13 18:55:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,440 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-12-13 18:55:27,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:55:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-12-13 18:55:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 18:55:27,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:55:27,441 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1068830320, now seen corresponding path program 1 times [2022-12-13 18:55:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121695826] [2022-12-13 18:55:27,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121695826] [2022-12-13 18:55:27,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121695826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656382665] [2022-12-13 18:55:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,481 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,489 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-12-13 18:55:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-12-13 18:55:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,490 INFO L225 Difference]: With dead ends: 73 [2022-12-13 18:55:27,490 INFO L226 Difference]: Without dead ends: 56 [2022-12-13 18:55:27,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,490 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-12-13 18:55:27,490 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-12-13 18:55:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-13 18:55:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-12-13 18:55:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.186046511627907) internal successors, (51), 49 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 18:55:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-12-13 18:55:27,494 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 46 [2022-12-13 18:55:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,495 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-12-13 18:55:27,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:55:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-12-13 18:55:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 18:55:27,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,495 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:55:27,495 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2085155984, now seen corresponding path program 1 times [2022-12-13 18:55:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314902972] [2022-12-13 18:55:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:55:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314902972] [2022-12-13 18:55:27,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314902972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143878388] [2022-12-13 18:55:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:27,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:27,553 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 18:55:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,566 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-12-13 18:55:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-12-13 18:55:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,567 INFO L225 Difference]: With dead ends: 56 [2022-12-13 18:55:27,567 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 18:55:27,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:55:27,568 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:27,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 18:55:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 18:55:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 48 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 18:55:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-12-13 18:55:27,574 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 51 [2022-12-13 18:55:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,574 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-12-13 18:55:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 18:55:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-12-13 18:55:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 18:55:27,575 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:55:27,575 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash -215325871, now seen corresponding path program 1 times [2022-12-13 18:55:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922226322] [2022-12-13 18:55:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:55:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922226322] [2022-12-13 18:55:27,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922226322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554177276] [2022-12-13 18:55:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:55:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:55:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:55:27,643 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 18:55:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,660 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-12-13 18:55:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:55:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-12-13 18:55:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,661 INFO L225 Difference]: With dead ends: 60 [2022-12-13 18:55:27,661 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 18:55:27,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:55:27,662 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:55:27,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:55:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 18:55:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 18:55:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 18:55:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-12-13 18:55:27,665 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 52 [2022-12-13 18:55:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,666 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-12-13 18:55:27,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 18:55:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-12-13 18:55:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 18:55:27,666 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:55:27,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 18:55:27,666 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 18:55:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1970152687, now seen corresponding path program 1 times [2022-12-13 18:55:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:27,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471612535] [2022-12-13 18:55:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:55:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 18:55:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 18:55:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:55:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 18:55:27,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471612535] [2022-12-13 18:55:27,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471612535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:55:27,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:55:27,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:55:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880207677] [2022-12-13 18:55:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:55:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:55:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,709 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 18:55:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:55:27,712 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-12-13 18:55:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:55:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-12-13 18:55:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:55:27,712 INFO L225 Difference]: With dead ends: 59 [2022-12-13 18:55:27,712 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 18:55:27,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:55:27,713 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-12-13 18:55:27,713 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-12-13 18:55:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 18:55:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 18:55:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:55:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 18:55:27,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-12-13 18:55:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:55:27,714 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 18:55:27,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 18:55:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 18:55:27,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 18:55:27,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 18:55:27,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 18:55:27,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 18:55:27,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 18:55:27,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 18:55:27,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 18:55:27,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 18:55:27,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 18:55:27,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:55:27,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 18:55:27,848 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 18:55:27,848 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 18:55:27,848 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 18:55:27,848 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 18:55:27,848 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 18:55:27,848 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 18:55:27,848 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 18:55:27,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-12-13 18:55:27,849 INFO L899 garLoopResultBuilder]: For program point L1596(line 1596) no Hoare annotation was computed. [2022-12-13 18:55:27,849 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-12-13 18:55:27,849 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-12-13 18:55:27,849 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-12-13 18:55:27,849 INFO L895 garLoopResultBuilder]: At program point L1613(lines 1613 1630) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,849 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1693 1700) the Hoare annotation is: true [2022-12-13 18:55:27,849 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-12-13 18:55:27,849 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-12-13 18:55:27,849 INFO L895 garLoopResultBuilder]: At program point L1605(line 1605) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,850 INFO L899 garLoopResultBuilder]: For program point L1605-1(lines 1599 1606) no Hoare annotation was computed. [2022-12-13 18:55:27,850 INFO L902 garLoopResultBuilder]: At program point L1696(line 1696) the Hoare annotation is: true [2022-12-13 18:55:27,850 INFO L899 garLoopResultBuilder]: For program point L1696-1(line 1696) no Hoare annotation was computed. [2022-12-13 18:55:27,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-12-13 18:55:27,850 INFO L895 garLoopResultBuilder]: At program point L1663(lines 1663 1671) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= .cse0 0))) [2022-12-13 18:55:27,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 18:55:27,850 INFO L895 garLoopResultBuilder]: At program point L1655(line 1655) the Hoare annotation is: false [2022-12-13 18:55:27,850 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1589) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L902 garLoopResultBuilder]: At program point L1672(lines 1672 1684) the Hoare annotation is: true [2022-12-13 18:55:27,851 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point L1590(lines 1590 1631) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point L1681(line 1681) no Hoare annotation was computed. [2022-12-13 18:55:27,851 INFO L899 garLoopResultBuilder]: For program point L1615(line 1615) no Hoare annotation was computed. [2022-12-13 18:55:27,852 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 18:55:27,852 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-12-13 18:55:27,852 INFO L902 garLoopResultBuilder]: At program point L1698(line 1698) the Hoare annotation is: true [2022-12-13 18:55:27,852 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-12-13 18:55:27,852 INFO L899 garLoopResultBuilder]: For program point L1698-1(line 1698) no Hoare annotation was computed. [2022-12-13 18:55:27,852 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1658) no Hoare annotation was computed. [2022-12-13 18:55:27,852 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1606) no Hoare annotation was computed. [2022-12-13 18:55:27,852 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,852 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-12-13 18:55:27,852 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1625) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1674(line 1674) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1641(line 1641) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-12-13 18:55:27,853 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1685) no Hoare annotation was computed. [2022-12-13 18:55:27,854 INFO L895 garLoopResultBuilder]: At program point L1651(line 1651) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,854 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-12-13 18:55:27,854 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-12-13 18:55:27,854 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-12-13 18:55:27,854 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-12-13 18:55:27,854 INFO L899 garLoopResultBuilder]: For program point L1676(line 1676) no Hoare annotation was computed. [2022-12-13 18:55:27,854 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-12-13 18:55:27,854 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: false [2022-12-13 18:55:27,854 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1586) no Hoare annotation was computed. [2022-12-13 18:55:27,855 INFO L899 garLoopResultBuilder]: For program point L1668(line 1668) no Hoare annotation was computed. [2022-12-13 18:55:27,855 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 18:55:27,855 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-12-13 18:55:27,855 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-12-13 18:55:27,855 INFO L895 garLoopResultBuilder]: At program point L1594(lines 1594 1612) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,855 INFO L895 garLoopResultBuilder]: At program point L1669(line 1669) the Hoare annotation is: false [2022-12-13 18:55:27,855 INFO L895 garLoopResultBuilder]: At program point L1636(lines 1636 1644) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch102#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 .cse0))) [2022-12-13 18:55:27,856 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-12-13 18:55:27,856 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: false [2022-12-13 18:55:27,856 INFO L899 garLoopResultBuilder]: For program point L1686(lines 1686 1692) no Hoare annotation was computed. [2022-12-13 18:55:27,856 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,856 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 18:55:27,856 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-12-13 18:55:27,856 INFO L895 garLoopResultBuilder]: At program point L1645(lines 1645 1657) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-12-13 18:55:27,856 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-12-13 18:55:27,856 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-12-13 18:55:27,857 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-12-13 18:55:27,857 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1588) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-12-13 18:55:27,860 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:27,862 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:55:27,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:55:27 BoogieIcfgContainer [2022-12-13 18:55:27,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:55:27,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:55:27,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:55:27,879 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:55:27,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:55:25" (3/4) ... [2022-12-13 18:55:27,882 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 18:55:27,888 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 18:55:27,888 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 18:55:27,893 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-12-13 18:55:27,893 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 18:55:27,894 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-13 18:55:27,894 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 18:55:27,894 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 18:55:27,938 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:55:27,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:55:27,939 INFO L158 Benchmark]: Toolchain (without parser) took 3306.98ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 106.8MB in the beginning and 131.1MB in the end (delta: -24.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-12-13 18:55:27,939 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:55:27,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.13ms. Allocated memory is still 169.9MB. Free memory was 106.5MB in the beginning and 100.8MB in the end (delta: 5.7MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2022-12-13 18:55:27,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.30ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 97.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:55:27,940 INFO L158 Benchmark]: Boogie Preprocessor took 32.95ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 96.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:55:27,940 INFO L158 Benchmark]: RCFGBuilder took 381.90ms. Allocated memory is still 169.9MB. Free memory was 96.0MB in the beginning and 77.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 18:55:27,940 INFO L158 Benchmark]: TraceAbstraction took 1952.75ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 77.1MB in the beginning and 135.3MB in the end (delta: -58.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:55:27,940 INFO L158 Benchmark]: Witness Printer took 59.60ms. Allocated memory is still 205.5MB. Free memory was 135.3MB in the beginning and 131.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:55:27,942 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.16ms. Allocated memory is still 94.4MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.13ms. Allocated memory is still 169.9MB. Free memory was 106.5MB in the beginning and 100.8MB in the end (delta: 5.7MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.30ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 97.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.95ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 96.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.90ms. Allocated memory is still 169.9MB. Free memory was 96.0MB in the beginning and 77.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1952.75ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 77.1MB in the beginning and 135.3MB in the end (delta: -58.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.60ms. Allocated memory is still 205.5MB. Free memory was 135.3MB in the beginning and 131.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 3008 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1633 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1375 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 96 PreInvPairs, 114 NumberOfFragments, 131 HoareAnnotationTreeSize, 96 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1636]: Loop Invariant Derived loop invariant: (((2 + data <= 0 && data <= 2147483647) && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && data <= 2147483647) && 0 <= 2 + data - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data > (-0x7fffffff - 1)) { data--; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux - InvariantResult [Line: 1613]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data > (-0x7fffffff - 1)) { data--; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1693]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1645]: Loop Invariant Derived loop invariant: (data <= 2147483647 && aux-switch(7) { case 7: { data--; int result = data; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux) && data <= 2147483647 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux - InvariantResult [Line: 1672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1663]: Loop Invariant Derived loop invariant: ((0 <= data + 2 && data <= 2147483647) && data <= 2147483647) && data + 2 <= 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 18:55:27,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb6c3c64-3b48-46aa-a008-d4586997186e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE