./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a91a43dabf08728aa1c777480ae74ba97759d8b76938ed83c53d35ac672a135 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:34:44,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:34:44,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:34:44,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:34:44,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:34:44,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:34:44,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:34:44,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:34:44,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:34:44,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:34:44,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:34:44,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:34:44,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:34:44,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:34:44,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:34:44,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:34:44,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:34:44,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:34:44,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:34:44,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:34:44,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:34:44,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:34:44,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:34:44,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:34:44,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:34:44,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:34:44,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:34:44,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:34:44,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:34:44,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:34:44,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:34:44,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:34:44,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:34:44,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:34:44,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:34:44,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:34:44,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:34:44,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:34:44,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:34:44,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:34:44,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:34:44,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 07:34:44,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:34:44,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:34:44,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:34:44,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:34:44,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:34:44,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:34:44,709 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:34:44,709 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:34:44,709 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:34:44,710 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:34:44,710 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:34:44,710 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:34:44,710 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:34:44,710 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:34:44,710 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:34:44,711 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:34:44,718 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:34:44,719 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:34:44,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:34:44,720 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:34:44,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:34:44,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:34:44,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:34:44,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:34:44,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:34:44,721 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:34:44,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:34:44,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:34:44,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:34:44,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:34:44,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:34:44,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:34:44,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:34:44,722 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:34:44,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:34:44,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:34:44,723 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:34:44,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:34:44,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:34:44,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:34:44,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/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_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a91a43dabf08728aa1c777480ae74ba97759d8b76938ed83c53d35ac672a135 [2022-11-19 07:34:45,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:34:45,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:34:45,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:34:45,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:34:45,069 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:34:45,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i [2022-11-19 07:34:45,159 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/data/879106323/c0c0e3eaab3e4e32814f911c7a8508a8/FLAGab1047730 [2022-11-19 07:34:45,870 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:34:45,871 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_15_good.i [2022-11-19 07:34:45,909 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/data/879106323/c0c0e3eaab3e4e32814f911c7a8508a8/FLAGab1047730 [2022-11-19 07:34:46,167 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/data/879106323/c0c0e3eaab3e4e32814f911c7a8508a8 [2022-11-19 07:34:46,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:34:46,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:34:46,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:34:46,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:34:46,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:34:46,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:46" (1/1) ... [2022-11-19 07:34:46,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a11ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:46, skipping insertion in model container [2022-11-19 07:34:46,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:46" (1/1) ... [2022-11-19 07:34:46,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:34:46,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:34:46,639 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 07:34:47,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:34:47,171 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:34:47,187 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 07:34:47,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:34:47,367 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:34:47,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47 WrapperNode [2022-11-19 07:34:47,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:34:47,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:34:47,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:34:47,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:34:47,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,438 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 175 [2022-11-19 07:34:47,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:34:47,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:34:47,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:34:47,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:34:47,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:34:47,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:34:47,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:34:47,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:34:47,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (1/1) ... [2022-11-19 07:34:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:34:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:34:47,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:34:47,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:34:47,578 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 07:34:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 07:34:47,578 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-19 07:34:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 07:34:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 07:34:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:34:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-19 07:34:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:34:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:34:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:34:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:34:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 07:34:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:34:47,798 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:34:47,800 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:34:48,073 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:34:48,117 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:34:48,123 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:34:48,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:48 BoogieIcfgContainer [2022-11-19 07:34:48,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:34:48,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:34:48,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:34:48,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:34:48,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:34:46" (1/3) ... [2022-11-19 07:34:48,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddbb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:48, skipping insertion in model container [2022-11-19 07:34:48,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:47" (2/3) ... [2022-11-19 07:34:48,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddbb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:48, skipping insertion in model container [2022-11-19 07:34:48,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:48" (3/3) ... [2022-11-19 07:34:48,137 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_15_good.i [2022-11-19 07:34:48,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:34:48,161 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 07:34:48,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:34:48,264 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=FINITE_AUTOMATA, 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;@6e38cc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:34:48,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 07:34:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 66 states have internal predecessors, (69), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 07:34:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:34:48,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:48,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:48,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1091132290, now seen corresponding path program 1 times [2022-11-19 07:34:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367655834] [2022-11-19 07:34:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:34:48,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367655834] [2022-11-19 07:34:48,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367655834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:48,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:48,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696229842] [2022-11-19 07:34:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:48,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:48,649 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 66 states have internal predecessors, (69), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:48,753 INFO L93 Difference]: Finished difference Result 133 states and 195 transitions. [2022-11-19 07:34:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:48,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-19 07:34:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:48,769 INFO L225 Difference]: With dead ends: 133 [2022-11-19 07:34:48,769 INFO L226 Difference]: Without dead ends: 62 [2022-11-19 07:34:48,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:48,781 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:48,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-19 07:34:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-19 07:34:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 58 states have internal predecessors, (60), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 07:34:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2022-11-19 07:34:48,842 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 12 [2022-11-19 07:34:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:48,844 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2022-11-19 07:34:48,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2022-11-19 07:34:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:34:48,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:48,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:48,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:34:48,848 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1341832372, now seen corresponding path program 1 times [2022-11-19 07:34:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:48,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619319771] [2022-11-19 07:34:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:34:48,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:48,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619319771] [2022-11-19 07:34:48,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619319771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:48,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:48,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:34:48,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648525025] [2022-11-19 07:34:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:48,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:48,997 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,058 INFO L93 Difference]: Finished difference Result 153 states and 220 transitions. [2022-11-19 07:34:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-11-19 07:34:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,061 INFO L225 Difference]: With dead ends: 153 [2022-11-19 07:34:49,063 INFO L226 Difference]: Without dead ends: 107 [2022-11-19 07:34:49,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,067 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 52 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 219 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-19 07:34:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2022-11-19 07:34:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 61 states have internal predecessors, (66), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 07:34:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2022-11-19 07:34:49,098 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 13 [2022-11-19 07:34:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,099 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2022-11-19 07:34:49,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2022-11-19 07:34:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:34:49,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:34:49,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1352869347, now seen corresponding path program 1 times [2022-11-19 07:34:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644288889] [2022-11-19 07:34:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:34:49,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:49,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644288889] [2022-11-19 07:34:49,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644288889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:49,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:49,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:34:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282563101] [2022-11-19 07:34:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:49,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,252 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,283 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2022-11-19 07:34:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-19 07:34:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,285 INFO L225 Difference]: With dead ends: 66 [2022-11-19 07:34:49,285 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 07:34:49,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,287 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 90 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 07:34:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 07:34:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 07:34:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2022-11-19 07:34:49,299 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 14 [2022-11-19 07:34:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,300 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2022-11-19 07:34:49,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2022-11-19 07:34:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:34:49,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:34:49,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1461364025, now seen corresponding path program 1 times [2022-11-19 07:34:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071357122] [2022-11-19 07:34:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:34:49,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:49,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071357122] [2022-11-19 07:34:49,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071357122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:49,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:49,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413615995] [2022-11-19 07:34:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:49,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,371 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,431 INFO L93 Difference]: Finished difference Result 109 states and 154 transitions. [2022-11-19 07:34:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2022-11-19 07:34:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,438 INFO L225 Difference]: With dead ends: 109 [2022-11-19 07:34:49,438 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 07:34:49,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,440 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 07:34:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 07:34:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 07:34:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2022-11-19 07:34:49,458 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 18 [2022-11-19 07:34:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,459 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2022-11-19 07:34:49,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 07:34:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2022-11-19 07:34:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:34:49,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,460 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:34:49,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1720129784, now seen corresponding path program 1 times [2022-11-19 07:34:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302332505] [2022-11-19 07:34:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:34:49,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302332505] [2022-11-19 07:34:49,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302332505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:49,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:49,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514306425] [2022-11-19 07:34:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:49,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,535 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:34:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,564 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2022-11-19 07:34:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 20 [2022-11-19 07:34:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,566 INFO L225 Difference]: With dead ends: 109 [2022-11-19 07:34:49,566 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 07:34:49,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,567 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 07:34:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-19 07:34:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 07:34:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2022-11-19 07:34:49,577 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 20 [2022-11-19 07:34:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,578 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2022-11-19 07:34:49,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 07:34:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2022-11-19 07:34:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:34:49,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,595 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:34:49,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1856265741, now seen corresponding path program 1 times [2022-11-19 07:34:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247605656] [2022-11-19 07:34:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:34:49,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:49,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247605656] [2022-11-19 07:34:49,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247605656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:49,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:49,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722390742] [2022-11-19 07:34:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:49,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,643 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,675 INFO L93 Difference]: Finished difference Result 101 states and 136 transitions. [2022-11-19 07:34:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 22 [2022-11-19 07:34:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,677 INFO L225 Difference]: With dead ends: 101 [2022-11-19 07:34:49,677 INFO L226 Difference]: Without dead ends: 62 [2022-11-19 07:34:49,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,679 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-19 07:34:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-19 07:34:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.380952380952381) internal successors, (58), 56 states have internal predecessors, (58), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 07:34:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-11-19 07:34:49,689 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 22 [2022-11-19 07:34:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,690 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-11-19 07:34:49,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-11-19 07:34:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:34:49,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,691 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:34:49,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1043054535, now seen corresponding path program 1 times [2022-11-19 07:34:49,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354146363] [2022-11-19 07:34:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:34:49,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:49,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354146363] [2022-11-19 07:34:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354146363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:49,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:49,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:34:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550616300] [2022-11-19 07:34:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:49,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,762 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,831 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2022-11-19 07:34:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-19 07:34:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,833 INFO L225 Difference]: With dead ends: 117 [2022-11-19 07:34:49,833 INFO L226 Difference]: Without dead ends: 89 [2022-11-19 07:34:49,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,835 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 33 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-19 07:34:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2022-11-19 07:34:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 07:34:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2022-11-19 07:34:49,846 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 23 [2022-11-19 07:34:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,847 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2022-11-19 07:34:49,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2022-11-19 07:34:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:34:49,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,848 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:34:49,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047660, now seen corresponding path program 1 times [2022-11-19 07:34:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993413706] [2022-11-19 07:34:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:34:49,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:49,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993413706] [2022-11-19 07:34:49,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993413706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:49,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:49,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:34:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504742835] [2022-11-19 07:34:49,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:49,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,920 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:49,946 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-11-19 07:34:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:49,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-19 07:34:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:49,948 INFO L225 Difference]: With dead ends: 65 [2022-11-19 07:34:49,948 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 07:34:49,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:49,950 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:49,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 07:34:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-19 07:34:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 07:34:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2022-11-19 07:34:49,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 24 [2022-11-19 07:34:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:49,969 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2022-11-19 07:34:49,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-11-19 07:34:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:34:49,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:49,971 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:49,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:34:49,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -927432608, now seen corresponding path program 1 times [2022-11-19 07:34:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807866965] [2022-11-19 07:34:49,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:34:50,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:50,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807866965] [2022-11-19 07:34:50,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807866965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:50,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:50,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930022022] [2022-11-19 07:34:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:50,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:50,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,044 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:50,078 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2022-11-19 07:34:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) 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 27 [2022-11-19 07:34:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:50,081 INFO L225 Difference]: With dead ends: 90 [2022-11-19 07:34:50,081 INFO L226 Difference]: Without dead ends: 62 [2022-11-19 07:34:50,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,085 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:50,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-19 07:34:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-19 07:34:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.2666666666666666) 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-11-19 07:34:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-11-19 07:34:50,095 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 27 [2022-11-19 07:34:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:50,095 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-11-19 07:34:50,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-19 07:34:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-11-19 07:34:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 07:34:50,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:50,097 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:50,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:34:50,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash -278017534, now seen corresponding path program 1 times [2022-11-19 07:34:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:50,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91908608] [2022-11-19 07:34:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:34:50,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91908608] [2022-11-19 07:34:50,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91908608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:50,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:50,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:34:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122477143] [2022-11-19 07:34:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:50,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:50,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,195 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:34:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:50,235 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-11-19 07:34:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-11-19 07:34:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:50,238 INFO L225 Difference]: With dead ends: 81 [2022-11-19 07:34:50,238 INFO L226 Difference]: Without dead ends: 79 [2022-11-19 07:34:50,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,240 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:50,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-19 07:34:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2022-11-19 07:34:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 57 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 07:34:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-11-19 07:34:50,267 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 30 [2022-11-19 07:34:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:50,267 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-11-19 07:34:50,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:34:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-11-19 07:34:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 07:34:50,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:50,269 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:34:50,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1626026728, now seen corresponding path program 1 times [2022-11-19 07:34:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454909476] [2022-11-19 07:34:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:50,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:34:50,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:50,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454909476] [2022-11-19 07:34:50,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454909476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:50,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:50,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288240993] [2022-11-19 07:34:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:50,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,364 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 07:34:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:50,393 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-11-19 07:34:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 33 [2022-11-19 07:34:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:50,396 INFO L225 Difference]: With dead ends: 83 [2022-11-19 07:34:50,396 INFO L226 Difference]: Without dead ends: 59 [2022-11-19 07:34:50,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,397 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:50,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-19 07:34:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-19 07:34:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2) internal successors, (54), 51 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 07:34:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-11-19 07:34:50,406 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 33 [2022-11-19 07:34:50,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:50,407 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-11-19 07:34:50,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 07:34:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-11-19 07:34:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 07:34:50,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:50,409 INFO L195 NwaCegarLoop]: trace histogram [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-11-19 07:34:50,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:34:50,410 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash -159028986, now seen corresponding path program 1 times [2022-11-19 07:34:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:50,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220338088] [2022-11-19 07:34:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:34:50,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:50,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220338088] [2022-11-19 07:34:50,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220338088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:50,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:50,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49256194] [2022-11-19 07:34:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,485 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:34:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:50,509 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-11-19 07:34:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:50,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 35 [2022-11-19 07:34:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:50,514 INFO L225 Difference]: With dead ends: 71 [2022-11-19 07:34:50,515 INFO L226 Difference]: Without dead ends: 57 [2022-11-19 07:34:50,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,516 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:50,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 100 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-19 07:34:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-19 07:34:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-19 07:34:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-11-19 07:34:50,524 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 35 [2022-11-19 07:34:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:50,525 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-11-19 07:34:50,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 07:34:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-11-19 07:34:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-19 07:34:50,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:50,528 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:34:50,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:34:50,529 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:50,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:50,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1188947576, now seen corresponding path program 1 times [2022-11-19 07:34:50,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:50,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111836757] [2022-11-19 07:34:50,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:34:50,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:50,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111836757] [2022-11-19 07:34:50,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111836757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:50,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:50,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:34:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058168777] [2022-11-19 07:34:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:50,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:50,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,610 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:34:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:50,634 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-19 07:34:50,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:50,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-11-19 07:34:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:50,636 INFO L225 Difference]: With dead ends: 63 [2022-11-19 07:34:50,636 INFO L226 Difference]: Without dead ends: 57 [2022-11-19 07:34:50,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,637 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:50,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-19 07:34:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-19 07:34:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.1363636363636365) 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-11-19 07:34:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2022-11-19 07:34:50,644 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 39 [2022-11-19 07:34:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:50,644 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2022-11-19 07:34:50,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:34:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-11-19 07:34:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 07:34:50,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:34:50,646 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:50,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:34:50,646 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:34:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:34:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1799115514, now seen corresponding path program 1 times [2022-11-19 07:34:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:34:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069348596] [2022-11-19 07:34:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:34:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:34:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:34:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:34:50,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:34:50,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069348596] [2022-11-19 07:34:50,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069348596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:34:50,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:34:50,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:34:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359921052] [2022-11-19 07:34:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:34:50,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:34:50,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:34:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:34:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,707 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:34:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:34:50,724 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-11-19 07:34:50,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:34:50,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (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 40 [2022-11-19 07:34:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:34:50,725 INFO L225 Difference]: With dead ends: 59 [2022-11-19 07:34:50,725 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:34:50,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:34:50,727 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:34:50,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:34:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:34:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:34:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:34:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:34:50,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-11-19 07:34:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:34:50,729 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:34:50,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:34:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:34:50,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:34:50,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 07:34:50,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 07:34:50,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 07:34:50,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 07:34:50,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 07:34:50,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 07:34:50,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 07:34:50,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 07:34:50,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:34:50,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:34:50,938 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 07:34:50,938 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 07:34:50,938 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 07:34:50,938 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 07:34:50,938 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-19 07:34:50,939 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2022-11-19 07:34:50,939 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-19 07:34:50,939 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-11-19 07:34:50,939 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-19 07:34:50,939 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2022-11-19 07:34:50,939 INFO L899 garLoopResultBuilder]: For program point L1671(line 1671) no Hoare annotation was computed. [2022-11-19 07:34:50,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-19 07:34:50,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:34:50,940 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,940 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-11-19 07:34:50,940 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-11-19 07:34:50,940 INFO L899 garLoopResultBuilder]: For program point L1647-1(line 1647) no Hoare annotation was computed. [2022-11-19 07:34:50,940 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-11-19 07:34:50,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-19 07:34:50,941 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1605) no Hoare annotation was computed. [2022-11-19 07:34:50,941 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-11-19 07:34:50,941 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,941 INFO L899 garLoopResultBuilder]: For program point L1615(lines 1615 1623) no Hoare annotation was computed. [2022-11-19 07:34:50,941 INFO L899 garLoopResultBuilder]: For program point L1673(line 1673) no Hoare annotation was computed. [2022-11-19 07:34:50,941 INFO L899 garLoopResultBuilder]: For program point L1673-1(line 1673) no Hoare annotation was computed. [2022-11-19 07:34:50,942 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-11-19 07:34:50,942 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-19 07:34:50,942 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-19 07:34:50,943 INFO L899 garLoopResultBuilder]: For program point L1608(line 1608) no Hoare annotation was computed. [2022-11-19 07:34:50,943 INFO L895 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: false [2022-11-19 07:34:50,943 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-11-19 07:34:50,943 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-19 07:34:50,943 INFO L899 garLoopResultBuilder]: For program point L1617(line 1617) no Hoare annotation was computed. [2022-11-19 07:34:50,943 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-19 07:34:50,944 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2022-11-19 07:34:50,944 INFO L895 garLoopResultBuilder]: At program point L1609(line 1609) the Hoare annotation is: false [2022-11-19 07:34:50,944 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-19 07:34:50,944 INFO L895 garLoopResultBuilder]: At program point L1634(lines 1634 1642) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,944 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-19 07:34:50,945 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2022-11-19 07:34:50,945 INFO L902 garLoopResultBuilder]: At program point L1692(line 1692) the Hoare annotation is: true [2022-11-19 07:34:50,945 INFO L899 garLoopResultBuilder]: For program point L1692-1(line 1692) no Hoare annotation was computed. [2022-11-19 07:34:50,945 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2022-11-19 07:34:50,945 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1611) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,945 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-11-19 07:34:50,946 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,946 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-19 07:34:50,946 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1654) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,946 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1585) no Hoare annotation was computed. [2022-11-19 07:34:50,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:34:50,946 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2022-11-19 07:34:50,946 INFO L895 garLoopResultBuilder]: At program point L1660(lines 1660 1668) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,947 INFO L895 garLoopResultBuilder]: At program point L1652(line 1652) the Hoare annotation is: false [2022-11-19 07:34:50,947 INFO L899 garLoopResultBuilder]: For program point L1677(line 1677) no Hoare annotation was computed. [2022-11-19 07:34:50,947 INFO L902 garLoopResultBuilder]: At program point L1669(lines 1669 1680) the Hoare annotation is: true [2022-11-19 07:34:50,947 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-11-19 07:34:50,947 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-19 07:34:50,947 INFO L902 garLoopResultBuilder]: At program point L1694(line 1694) the Hoare annotation is: true [2022-11-19 07:34:50,947 INFO L902 garLoopResultBuilder]: At program point L1694-1(line 1694) the Hoare annotation is: true [2022-11-19 07:34:50,948 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-19 07:34:50,948 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-19 07:34:50,949 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-19 07:34:50,949 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-19 07:34:50,949 INFO L895 garLoopResultBuilder]: At program point L1612(lines 1612 1628) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,949 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-11-19 07:34:50,949 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-11-19 07:34:50,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2022-11-19 07:34:50,949 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: false [2022-11-19 07:34:50,950 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-19 07:34:50,950 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1587) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-19 07:34:50,950 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1598 1605) no Hoare annotation was computed. [2022-11-19 07:34:50,953 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:34:50,955 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:34:50,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:34:50 BoogieIcfgContainer [2022-11-19 07:34:50,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:34:50,985 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:34:50,985 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:34:50,985 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:34:50,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:48" (3/4) ... [2022-11-19 07:34:50,989 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:34:50,994 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 07:34:50,994 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 07:34:51,002 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-19 07:34:51,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-19 07:34:51,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-19 07:34:51,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-19 07:34:51,004 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:34:51,059 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:34:51,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:34:51,060 INFO L158 Benchmark]: Toolchain (without parser) took 4888.08ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 73.7MB in the beginning and 76.4MB in the end (delta: -2.8MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2022-11-19 07:34:51,060 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:34:51,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1193.46ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 80.1MB in the end (delta: -6.7MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-11-19 07:34:51,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.10ms. Allocated memory is still 109.1MB. Free memory was 80.1MB in the beginning and 76.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:34:51,061 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 75.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:34:51,062 INFO L158 Benchmark]: RCFGBuilder took 637.47ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 54.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-19 07:34:51,062 INFO L158 Benchmark]: TraceAbstraction took 2856.49ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 54.4MB in the beginning and 81.7MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:34:51,062 INFO L158 Benchmark]: Witness Printer took 74.44ms. Allocated memory is still 132.1MB. Free memory was 81.7MB in the beginning and 76.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-19 07:34:51,064 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.32ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1193.46ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 80.1MB in the end (delta: -6.7MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.10ms. Allocated memory is still 109.1MB. Free memory was 80.1MB in the beginning and 76.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 75.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 637.47ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 54.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2856.49ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 54.4MB in the beginning and 81.7MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.44ms. Allocated memory is still 132.1MB. Free memory was 81.7MB in the beginning and 76.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 1801 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 781 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1020 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 78 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 108 PreInvPairs, 128 NumberOfFragments, 174 HoareAnnotationTreeSize, 108 FomulaSimplifications, 80 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 46/46 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data < 0x7fffffff) { int result = data + 1; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1660]: Loop Invariant Derived loop invariant: (0 <= data + 2147483648 && data == 2) && 0 <= data + 2147483648 - InvariantResult [Line: 1634]: Loop Invariant Derived loop invariant: (2 == data && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1694]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: { int result = data + 1; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1612]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data < 0x7fffffff) { int result = data + 1; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 RESULT: Ultimate proved your program to be correct! [2022-11-19 07:34:51,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f086ac5-b33c-491e-9e32-6849f8a803dc/bin/utaipan-I9t0OCRTmS/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