./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:32:47,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:32:47,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:32:47,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:32:47,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:32:47,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:32:47,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:32:47,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:32:47,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:32:47,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:32:47,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:32:47,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:32:47,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:32:47,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:32:47,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:32:47,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:32:47,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:32:47,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:32:47,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:32:47,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:32:47,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:32:47,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:32:47,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:32:47,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:32:47,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:32:47,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:32:47,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:32:47,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:32:47,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:32:47,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:32:47,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:32:47,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:32:47,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:32:47,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:32:47,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:32:47,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:32:47,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:32:47,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:32:47,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:32:47,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:32:47,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:32:47,552 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-11-20 05:32:47,582 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:32:47,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:32:47,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:32:47,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:32:47,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:32:47,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:32:47,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:32:47,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:32:47,585 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:32:47,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:32:47,586 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:32:47,586 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 05:32:47,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:32:47,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:32:47,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:32:47,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 05:32:47,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:32:47,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 05:32:47,587 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-20 05:32:47,588 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:32:47,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:32:47,588 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:32:47,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 05:32:47,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:32:47,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:32:47,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:32:47,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:32:47,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:32:47,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:32:47,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 05:32:47,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:32:47,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:32:47,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 05:32:47,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:32:47,595 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_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/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_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2021-11-20 05:32:47,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:32:47,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:32:47,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:32:47,918 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:32:47,921 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:32:47,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2021-11-20 05:32:48,014 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/data/4bb4e67c8/053ce2f93ef84962853be0ce92d986b3/FLAGb455cfda0 [2021-11-20 05:32:48,447 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:32:48,447 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2021-11-20 05:32:48,462 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/data/4bb4e67c8/053ce2f93ef84962853be0ce92d986b3/FLAGb455cfda0 [2021-11-20 05:32:48,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/data/4bb4e67c8/053ce2f93ef84962853be0ce92d986b3 [2021-11-20 05:32:48,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:32:48,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:32:48,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:32:48,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:32:48,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:32:48,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:32:48" (1/1) ... [2021-11-20 05:32:48,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f59f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:48, skipping insertion in model container [2021-11-20 05:32:48,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:32:48" (1/1) ... [2021-11-20 05:32:48,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:32:48,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:32:49,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c[727,740] [2021-11-20 05:32:49,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:32:49,129 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:32:49,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c[727,740] [2021-11-20 05:32:49,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:32:49,181 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:32:49,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49 WrapperNode [2021-11-20 05:32:49,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:32:49,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:32:49,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:32:49,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:32:49,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,236 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2021-11-20 05:32:49,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:32:49,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:32:49,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:32:49,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:32:49,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:32:49,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:32:49,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:32:49,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:32:49,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (1/1) ... [2021-11-20 05:32:49,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:32:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:32:49,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:32:49,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:32:49,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:32:49,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 05:32:49,365 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-11-20 05:32:49,365 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-11-20 05:32:49,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:32:49,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:32:49,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-20 05:32:49,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-20 05:32:49,433 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:32:49,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:32:49,713 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:32:49,720 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:32:49,721 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 05:32:49,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:32:49 BoogieIcfgContainer [2021-11-20 05:32:49,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:32:49,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:32:49,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:32:49,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:32:49,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:32:48" (1/3) ... [2021-11-20 05:32:49,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195716d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:32:49, skipping insertion in model container [2021-11-20 05:32:49,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:32:49" (2/3) ... [2021-11-20 05:32:49,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195716d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:32:49, skipping insertion in model container [2021-11-20 05:32:49,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:32:49" (3/3) ... [2021-11-20 05:32:49,730 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2021-11-20 05:32:49,736 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:32:49,736 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2021-11-20 05:32:49,798 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:32:49,829 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 05:32:49,829 INFO L340 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2021-11-20 05:32:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 88 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 05:32:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-20 05:32:49,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:49,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:49,857 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1894792754, now seen corresponding path program 1 times [2021-11-20 05:32:49,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:49,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412719733] [2021-11-20 05:32:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:49,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:32:50,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412719733] [2021-11-20 05:32:50,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412719733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:50,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:50,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 05:32:50,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373174808] [2021-11-20 05:32:50,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:50,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 05:32:50,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 05:32:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 05:32:50,042 INFO L87 Difference]: Start difference. First operand has 95 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 88 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:32:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:50,075 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2021-11-20 05:32:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 05:32:50,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-20 05:32:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:50,087 INFO L225 Difference]: With dead ends: 185 [2021-11-20 05:32:50,094 INFO L226 Difference]: Without dead ends: 77 [2021-11-20 05:32:50,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 05:32:50,106 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:50,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:32:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-20 05:32:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-11-20 05:32:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 71 states have internal predecessors, (81), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2021-11-20 05:32:50,155 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 9 [2021-11-20 05:32:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:50,155 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2021-11-20 05:32:50,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:32:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2021-11-20 05:32:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-20 05:32:50,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:50,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:50,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 05:32:50,158 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1895734020, now seen corresponding path program 1 times [2021-11-20 05:32:50,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:50,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805485129] [2021-11-20 05:32:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:50,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:32:50,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:50,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805485129] [2021-11-20 05:32:50,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805485129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:50,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:50,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 05:32:50,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049603869] [2021-11-20 05:32:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:50,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:32:50,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:32:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:32:50,288 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:32:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:50,416 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2021-11-20 05:32:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:32:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-20 05:32:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:50,421 INFO L225 Difference]: With dead ends: 197 [2021-11-20 05:32:50,421 INFO L226 Difference]: Without dead ends: 123 [2021-11-20 05:32:50,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:50,424 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:50,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 225 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:32:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-20 05:32:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2021-11-20 05:32:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 104 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2021-11-20 05:32:50,445 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 9 [2021-11-20 05:32:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:50,446 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2021-11-20 05:32:50,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:32:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2021-11-20 05:32:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 05:32:50,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:50,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:50,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 05:32:50,448 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 456021693, now seen corresponding path program 1 times [2021-11-20 05:32:50,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704165423] [2021-11-20 05:32:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:50,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:32:50,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:50,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704165423] [2021-11-20 05:32:50,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704165423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:50,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:50,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:32:50,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768990875] [2021-11-20 05:32:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:50,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:32:50,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:32:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:32:50,513 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:32:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:50,580 INFO L93 Difference]: Finished difference Result 224 states and 276 transitions. [2021-11-20 05:32:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:32:50,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 05:32:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:50,590 INFO L225 Difference]: With dead ends: 224 [2021-11-20 05:32:50,590 INFO L226 Difference]: Without dead ends: 116 [2021-11-20 05:32:50,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:50,593 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:50,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 245 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:32:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-20 05:32:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-20 05:32:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 108 states have internal predecessors, (133), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2021-11-20 05:32:50,622 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 12 [2021-11-20 05:32:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:50,623 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2021-11-20 05:32:50,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:32:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2021-11-20 05:32:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 05:32:50,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:50,625 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:50,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 05:32:50,626 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -338403669, now seen corresponding path program 1 times [2021-11-20 05:32:50,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232868849] [2021-11-20 05:32:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:50,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:32:50,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:50,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232868849] [2021-11-20 05:32:50,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232868849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:50,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:50,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:32:50,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220291431] [2021-11-20 05:32:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:50,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:32:50,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:32:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:32:50,709 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:50,754 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2021-11-20 05:32:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:32:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-11-20 05:32:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:50,756 INFO L225 Difference]: With dead ends: 202 [2021-11-20 05:32:50,756 INFO L226 Difference]: Without dead ends: 108 [2021-11-20 05:32:50,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:50,759 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:50,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 248 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:32:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-20 05:32:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-11-20 05:32:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 94 states have internal predecessors, (112), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2021-11-20 05:32:50,774 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 19 [2021-11-20 05:32:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:50,774 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2021-11-20 05:32:50,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2021-11-20 05:32:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 05:32:50,776 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:50,776 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:50,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 05:32:50,776 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:50,782 INFO L85 PathProgramCache]: Analyzing trace with hash -104572203, now seen corresponding path program 1 times [2021-11-20 05:32:50,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:50,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432651469] [2021-11-20 05:32:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:50,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:32:50,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432651469] [2021-11-20 05:32:50,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432651469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:50,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:50,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:32:50,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249207684] [2021-11-20 05:32:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:50,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:32:50,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:50,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:32:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:50,843 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:50,931 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2021-11-20 05:32:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:32:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-20 05:32:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:50,933 INFO L225 Difference]: With dead ends: 111 [2021-11-20 05:32:50,934 INFO L226 Difference]: Without dead ends: 108 [2021-11-20 05:32:50,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:32:50,936 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:50,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 300 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:32:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-20 05:32:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-11-20 05:32:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 94 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2021-11-20 05:32:50,949 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 20 [2021-11-20 05:32:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:50,950 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2021-11-20 05:32:50,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2021-11-20 05:32:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-20 05:32:50,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:50,952 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:50,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 05:32:50,952 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1053229104, now seen corresponding path program 1 times [2021-11-20 05:32:50,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208745676] [2021-11-20 05:32:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:50,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:32:51,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:51,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208745676] [2021-11-20 05:32:51,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208745676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:51,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:51,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:32:51,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202543834] [2021-11-20 05:32:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:51,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:32:51,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:51,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:32:51,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:51,035 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:51,112 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2021-11-20 05:32:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:32:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-11-20 05:32:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:51,114 INFO L225 Difference]: With dead ends: 196 [2021-11-20 05:32:51,114 INFO L226 Difference]: Without dead ends: 121 [2021-11-20 05:32:51,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:32:51,116 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:51,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 303 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:32:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-20 05:32:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2021-11-20 05:32:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.411764705882353) internal successors, (120), 104 states have internal predecessors, (120), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2021-11-20 05:32:51,129 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 21 [2021-11-20 05:32:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:51,129 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-11-20 05:32:51,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2021-11-20 05:32:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-20 05:32:51,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:51,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:51,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 05:32:51,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -127840962, now seen corresponding path program 1 times [2021-11-20 05:32:51,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:51,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120053418] [2021-11-20 05:32:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:51,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 05:32:51,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:51,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120053418] [2021-11-20 05:32:51,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120053418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:51,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:51,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 05:32:51,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752497243] [2021-11-20 05:32:51,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:51,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 05:32:51,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 05:32:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:32:51,179 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:51,237 INFO L93 Difference]: Finished difference Result 127 states and 148 transitions. [2021-11-20 05:32:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 05:32:51,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-11-20 05:32:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:51,240 INFO L225 Difference]: With dead ends: 127 [2021-11-20 05:32:51,240 INFO L226 Difference]: Without dead ends: 124 [2021-11-20 05:32:51,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 05:32:51,244 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:51,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 161 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:32:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-20 05:32:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2021-11-20 05:32:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 101 states have internal predecessors, (116), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2021-11-20 05:32:51,269 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 26 [2021-11-20 05:32:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:51,269 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-11-20 05:32:51,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 05:32:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2021-11-20 05:32:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-20 05:32:51,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:51,277 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:51,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 05:32:51,278 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1958605165, now seen corresponding path program 1 times [2021-11-20 05:32:51,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:51,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976018557] [2021-11-20 05:32:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:51,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 05:32:51,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:51,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976018557] [2021-11-20 05:32:51,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976018557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:51,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:51,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:32:51,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102544673] [2021-11-20 05:32:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:51,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:32:51,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:32:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:51,406 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:32:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:51,491 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2021-11-20 05:32:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:32:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2021-11-20 05:32:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:51,493 INFO L225 Difference]: With dead ends: 156 [2021-11-20 05:32:51,493 INFO L226 Difference]: Without dead ends: 153 [2021-11-20 05:32:51,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:32:51,494 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 114 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:51,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 233 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:32:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-20 05:32:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 138. [2021-11-20 05:32:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 129 states have internal predecessors, (157), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2021-11-20 05:32:51,505 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 34 [2021-11-20 05:32:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:51,506 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2021-11-20 05:32:51,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:32:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2021-11-20 05:32:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 05:32:51,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:51,508 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:51,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 05:32:51,508 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1911337813, now seen corresponding path program 1 times [2021-11-20 05:32:51,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:51,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634029430] [2021-11-20 05:32:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:51,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 05:32:51,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634029430] [2021-11-20 05:32:51,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634029430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:51,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:51,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 05:32:51,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205764561] [2021-11-20 05:32:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:51,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:32:51,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:32:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:51,593 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:32:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:51,674 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2021-11-20 05:32:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:32:51,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-11-20 05:32:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:51,677 INFO L225 Difference]: With dead ends: 151 [2021-11-20 05:32:51,677 INFO L226 Difference]: Without dead ends: 148 [2021-11-20 05:32:51,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:32:51,680 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 95 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:51,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 247 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:32:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-20 05:32:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2021-11-20 05:32:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 124 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2021-11-20 05:32:51,699 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2021-11-20 05:32:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:51,700 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2021-11-20 05:32:51,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:32:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2021-11-20 05:32:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-20 05:32:51,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:51,702 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:51,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 05:32:51,704 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -875976532, now seen corresponding path program 1 times [2021-11-20 05:32:51,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:51,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944006220] [2021-11-20 05:32:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:51,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:51,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:51,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944006220] [2021-11-20 05:32:51,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944006220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:32:51,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:32:51,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 05:32:51,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730972079] [2021-11-20 05:32:51,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:32:51,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:32:51,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:32:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:32:51,861 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:32:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:51,937 INFO L93 Difference]: Finished difference Result 310 states and 363 transitions. [2021-11-20 05:32:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:32:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-11-20 05:32:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:51,942 INFO L225 Difference]: With dead ends: 310 [2021-11-20 05:32:51,942 INFO L226 Difference]: Without dead ends: 202 [2021-11-20 05:32:51,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:32:51,944 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:51,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 271 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:32:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-20 05:32:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 133. [2021-11-20 05:32:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 124 states have internal predecessors, (147), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2021-11-20 05:32:51,956 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 37 [2021-11-20 05:32:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:51,957 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2021-11-20 05:32:51,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 05:32:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2021-11-20 05:32:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 05:32:51,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:51,961 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:51,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 05:32:51,962 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:51,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1872710945, now seen corresponding path program 1 times [2021-11-20 05:32:51,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:51,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216309718] [2021-11-20 05:32:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:51,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:52,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216309718] [2021-11-20 05:32:52,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216309718] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:32:52,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20331691] [2021-11-20 05:32:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:52,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:32:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:32:52,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:32:52,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 05:32:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:52,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 05:32:52,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:32:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:52,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:32:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:52,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20331691] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:32:52,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:32:52,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-11-20 05:32:52,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486397864] [2021-11-20 05:32:52,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:32:52,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 05:32:52,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 05:32:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-11-20 05:32:52,703 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 05:32:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:53,030 INFO L93 Difference]: Finished difference Result 514 states and 602 transitions. [2021-11-20 05:32:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 05:32:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2021-11-20 05:32:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:53,034 INFO L225 Difference]: With dead ends: 514 [2021-11-20 05:32:53,034 INFO L226 Difference]: Without dead ends: 408 [2021-11-20 05:32:53,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2021-11-20 05:32:53,037 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 325 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:53,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 246 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 05:32:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-20 05:32:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 153. [2021-11-20 05:32:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 144 states have internal predecessors, (171), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2021-11-20 05:32:53,058 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 39 [2021-11-20 05:32:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:53,060 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2021-11-20 05:32:53,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 05:32:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2021-11-20 05:32:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-20 05:32:53,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:53,062 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:53,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 05:32:53,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:32:53,282 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1837884998, now seen corresponding path program 1 times [2021-11-20 05:32:53,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:53,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203961939] [2021-11-20 05:32:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:53,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:53,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:53,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203961939] [2021-11-20 05:32:53,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203961939] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:32:53,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174001363] [2021-11-20 05:32:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:53,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:32:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:32:53,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:32:53,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 05:32:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:53,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 05:32:53,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:32:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:53,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:32:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:53,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174001363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:32:53,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:32:53,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-20 05:32:53,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970365211] [2021-11-20 05:32:53,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:32:53,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 05:32:53,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 05:32:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-11-20 05:32:53,823 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 05:32:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:54,146 INFO L93 Difference]: Finished difference Result 418 states and 489 transitions. [2021-11-20 05:32:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 05:32:54,147 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-11-20 05:32:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:54,149 INFO L225 Difference]: With dead ends: 418 [2021-11-20 05:32:54,150 INFO L226 Difference]: Without dead ends: 302 [2021-11-20 05:32:54,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2021-11-20 05:32:54,151 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 194 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:54,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 436 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 05:32:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-20 05:32:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 153. [2021-11-20 05:32:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.31496062992126) internal successors, (167), 144 states have internal predecessors, (167), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2021-11-20 05:32:54,169 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 42 [2021-11-20 05:32:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:54,169 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2021-11-20 05:32:54,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 05:32:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2021-11-20 05:32:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-20 05:32:54,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:54,170 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:54,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 05:32:54,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:32:54,394 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash -826675551, now seen corresponding path program 2 times [2021-11-20 05:32:54,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:54,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365559052] [2021-11-20 05:32:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:54,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:54,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:54,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365559052] [2021-11-20 05:32:54,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365559052] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:32:54,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153888410] [2021-11-20 05:32:54,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:32:54,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:32:54,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:32:54,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:32:54,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 05:32:54,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:32:54,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:32:54,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 05:32:54,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:32:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:54,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:32:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:55,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153888410] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:32:55,243 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:32:55,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-11-20 05:32:55,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568264006] [2021-11-20 05:32:55,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:32:55,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-20 05:32:55,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 05:32:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2021-11-20 05:32:55,247 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 05:32:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:32:55,947 INFO L93 Difference]: Finished difference Result 830 states and 978 transitions. [2021-11-20 05:32:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-20 05:32:55,947 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2021-11-20 05:32:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:32:55,952 INFO L225 Difference]: With dead ends: 830 [2021-11-20 05:32:55,952 INFO L226 Difference]: Without dead ends: 724 [2021-11-20 05:32:55,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 05:32:55,955 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 742 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 05:32:55,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 421 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 05:32:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-11-20 05:32:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 193. [2021-11-20 05:32:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 184 states have internal predecessors, (215), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:32:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 223 transitions. [2021-11-20 05:32:55,978 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 223 transitions. Word has length 59 [2021-11-20 05:32:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:32:55,978 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 223 transitions. [2021-11-20 05:32:55,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 05:32:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 223 transitions. [2021-11-20 05:32:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-20 05:32:55,980 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:32:55,980 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:32:56,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 05:32:56,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 05:32:56,206 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:32:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:32:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash -293337030, now seen corresponding path program 2 times [2021-11-20 05:32:56,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:32:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956527271] [2021-11-20 05:32:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:32:56,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:32:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:32:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:32:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:32:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:56,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:32:56,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956527271] [2021-11-20 05:32:56,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956527271] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:32:56,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906229452] [2021-11-20 05:32:56,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 05:32:56,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:32:56,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:32:56,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:32:56,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 05:32:56,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 05:32:56,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:32:56,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-20 05:32:56,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:32:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:56,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:32:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:32:57,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906229452] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:32:57,139 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:32:57,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-11-20 05:32:57,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182700389] [2021-11-20 05:32:57,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:32:57,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-20 05:32:57,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:32:57,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 05:32:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2021-11-20 05:32:57,141 INFO L87 Difference]: Start difference. First operand 193 states and 223 transitions. Second operand has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 05:33:02,633 WARN L227 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 41 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:33:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:33:15,654 INFO L93 Difference]: Finished difference Result 602 states and 709 transitions. [2021-11-20 05:33:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 05:33:15,655 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2021-11-20 05:33:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:33:15,658 INFO L225 Difference]: With dead ends: 602 [2021-11-20 05:33:15,658 INFO L226 Difference]: Without dead ends: 486 [2021-11-20 05:33:15,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=503, Invalid=902, Unknown=1, NotChecked=0, Total=1406 [2021-11-20 05:33:15,660 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 521 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 05:33:15,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 1169 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 05:33:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-11-20 05:33:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 193. [2021-11-20 05:33:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.2395209580838322) internal successors, (207), 184 states have internal predecessors, (207), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:33:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2021-11-20 05:33:15,683 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 62 [2021-11-20 05:33:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:33:15,684 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2021-11-20 05:33:15,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.2) internal successors, (130), 25 states have internal predecessors, (130), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 05:33:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2021-11-20 05:33:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-20 05:33:15,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:33:15,685 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:33:15,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 05:33:15,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-20 05:33:15,913 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:33:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:33:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -470814303, now seen corresponding path program 3 times [2021-11-20 05:33:15,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:33:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383362999] [2021-11-20 05:33:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:33:15,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:33:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:33:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:33:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:33:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:33:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:33:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:33:16,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:33:16,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383362999] [2021-11-20 05:33:16,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383362999] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:33:16,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434878068] [2021-11-20 05:33:16,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:33:16,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:33:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:33:16,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:33:16,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 05:33:16,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-20 05:33:16,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:33:16,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-20 05:33:16,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:33:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:33:16,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:33:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:33:17,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434878068] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:33:17,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:33:17,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2021-11-20 05:33:17,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736516633] [2021-11-20 05:33:17,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:33:17,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-20 05:33:17,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:33:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-20 05:33:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2021-11-20 05:33:17,954 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 05:33:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:33:19,840 INFO L93 Difference]: Finished difference Result 1462 states and 1730 transitions. [2021-11-20 05:33:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-20 05:33:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2021-11-20 05:33:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:33:19,851 INFO L225 Difference]: With dead ends: 1462 [2021-11-20 05:33:19,851 INFO L226 Difference]: Without dead ends: 1356 [2021-11-20 05:33:19,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2021-11-20 05:33:19,858 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 1385 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 05:33:19,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1385 Valid, 775 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 05:33:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2021-11-20 05:33:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 273. [2021-11-20 05:33:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 264 states have internal predecessors, (303), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:33:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 311 transitions. [2021-11-20 05:33:19,913 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 311 transitions. Word has length 99 [2021-11-20 05:33:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:33:19,914 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 311 transitions. [2021-11-20 05:33:19,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-20 05:33:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 311 transitions. [2021-11-20 05:33:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-20 05:33:19,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:33:19,921 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:33:19,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 05:33:20,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 05:33:20,128 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:33:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:33:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1189815610, now seen corresponding path program 3 times [2021-11-20 05:33:20,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:33:20,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688523186] [2021-11-20 05:33:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:33:20,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:33:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:33:20,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:33:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:33:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-20 05:33:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:33:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:33:20,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:33:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688523186] [2021-11-20 05:33:20,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688523186] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:33:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052441936] [2021-11-20 05:33:20,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 05:33:20,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:33:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:33:20,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:33:20,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 05:33:22,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-11-20 05:33:22,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 05:33:22,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-20 05:33:22,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:33:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:33:23,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:33:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 05:33:39,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052441936] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:33:39,075 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:33:39,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 51 [2021-11-20 05:33:39,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688662823] [2021-11-20 05:33:39,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:33:39,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-20 05:33:39,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:33:39,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-20 05:33:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1874, Unknown=3, NotChecked=0, Total=2550 [2021-11-20 05:33:39,078 INFO L87 Difference]: Start difference. First operand 273 states and 311 transitions. Second operand has 51 states, 51 states have (on average 4.901960784313726) internal successors, (250), 51 states have internal predecessors, (250), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 05:34:41,357 WARN L227 SmtUtils]: Spent 56.58s on a formula simplification. DAG size of input: 63 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:34:43,985 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:34:59,542 WARN L227 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 57 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:35:01,557 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:04,748 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:08,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:10,768 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:28,690 WARN L227 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 51 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:35:31,140 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:33,162 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:34,912 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:36,069 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:38,079 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:40,095 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:35:42,231 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:00,586 WARN L227 SmtUtils]: Spent 7.66s on a formula simplification. DAG size of input: 45 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:36:03,425 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:07,225 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:28,437 WARN L227 SmtUtils]: Spent 10.49s on a formula simplification. DAG size of input: 40 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:36:32,110 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:50,668 WARN L227 SmtUtils]: Spent 10.51s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 05:36:52,677 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:54,576 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:56,648 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:36:57,992 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:37:09,580 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:37:11,592 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:37:19,010 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:34,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:37,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:39,338 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:41,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:42,930 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:45,700 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:47,295 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:49,353 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:50,551 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:53,506 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:55,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:57,604 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:38:59,635 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:01,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:04,487 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:06,173 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:09,779 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:11,427 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:13,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:15,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:17,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:19,497 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:21,513 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:23,125 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:26,162 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:29,875 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 05:39:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:39:30,148 INFO L93 Difference]: Finished difference Result 970 states and 1149 transitions. [2021-11-20 05:39:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-20 05:39:30,152 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.901960784313726) internal successors, (250), 51 states have internal predecessors, (250), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 102 [2021-11-20 05:39:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:39:30,158 INFO L225 Difference]: With dead ends: 970 [2021-11-20 05:39:30,158 INFO L226 Difference]: Without dead ends: 854 [2021-11-20 05:39:30,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 248.4s TimeCoverageRelationStatistics Valid=1967, Invalid=4314, Unknown=39, NotChecked=0, Total=6320 [2021-11-20 05:39:30,162 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 1656 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 357 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 115.8s IncrementalHoareTripleChecker+Time [2021-11-20 05:39:30,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 3737 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 2161 Invalid, 31 Unknown, 0 Unchecked, 115.8s Time] [2021-11-20 05:39:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-11-20 05:39:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 273. [2021-11-20 05:39:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.165991902834008) internal successors, (288), 264 states have internal predecessors, (288), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 05:39:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 296 transitions. [2021-11-20 05:39:30,193 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 296 transitions. Word has length 102 [2021-11-20 05:39:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:39:30,194 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 296 transitions. [2021-11-20 05:39:30,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.901960784313726) internal successors, (250), 51 states have internal predecessors, (250), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-20 05:39:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 296 transitions. [2021-11-20 05:39:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-20 05:39:30,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:39:30,196 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:30,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 05:39:30,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-20 05:39:30,401 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2021-11-20 05:39:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2015125126, now seen corresponding path program 4 times [2021-11-20 05:39:30,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:30,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681256484] [2021-11-20 05:39:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:30,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:39:30,437 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:39:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:39:30,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:39:30,520 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 05:39:30,521 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2021-11-20 05:39:30,524 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2021-11-20 05:39:30,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2021-11-20 05:39:30,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2021-11-20 05:39:30,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2021-11-20 05:39:30,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2021-11-20 05:39:30,525 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2021-11-20 05:39:30,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2021-11-20 05:39:30,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2021-11-20 05:39:30,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2021-11-20 05:39:30,526 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2021-11-20 05:39:30,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2021-11-20 05:39:30,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2021-11-20 05:39:30,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2021-11-20 05:39:30,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2021-11-20 05:39:30,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2021-11-20 05:39:30,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2021-11-20 05:39:30,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2021-11-20 05:39:30,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2021-11-20 05:39:30,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2021-11-20 05:39:30,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2021-11-20 05:39:30,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2021-11-20 05:39:30,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-20 05:39:30,533 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:30,537 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 05:39:30,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:39:30 BoogieIcfgContainer [2021-11-20 05:39:30,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 05:39:30,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 05:39:30,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 05:39:30,654 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 05:39:30,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:32:49" (3/4) ... [2021-11-20 05:39:30,658 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 05:39:30,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 05:39:30,659 INFO L158 Benchmark]: Toolchain (without parser) took 401838.88ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 70.3MB in the beginning and 46.7MB in the end (delta: 23.6MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2021-11-20 05:39:30,659 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 113.2MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:39:30,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.83ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 84.2MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 05:39:30,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.42ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:39:30,665 INFO L158 Benchmark]: Boogie Preprocessor took 52.89ms. Allocated memory is still 113.2MB. Free memory was 82.1MB in the beginning and 80.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:39:30,667 INFO L158 Benchmark]: RCFGBuilder took 432.19ms. Allocated memory is still 113.2MB. Free memory was 80.8MB in the beginning and 66.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-20 05:39:30,668 INFO L158 Benchmark]: TraceAbstraction took 400929.17ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 65.3MB in the beginning and 47.8MB in the end (delta: 17.6MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2021-11-20 05:39:30,668 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 144.7MB. Free memory was 47.8MB in the beginning and 46.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:39:30,669 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.26ms. Allocated memory is still 113.2MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.83ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 84.2MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.42ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.89ms. Allocated memory is still 113.2MB. Free memory was 82.1MB in the beginning and 80.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 432.19ms. Allocated memory is still 113.2MB. Free memory was 80.8MB in the beginning and 66.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 400929.17ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 65.3MB in the beginning and 47.8MB in the end (delta: 17.6MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 144.7MB. Free memory was 47.8MB in the beginning and 46.7MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 77, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24] [L77] EXPR (e + 128) << 24U [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=16777217, e=-24, res=16777217] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=16777217, __retres4=16777217, e=-24, res=16777217] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=16777217, ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 95 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 400.7s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 373.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 5311 SdHoareTripleChecker+Valid, 118.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5305 mSDsluCounter, 9130 SdHoareTripleChecker+Invalid, 115.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7681 mSDsCounter, 1348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4181 IncrementalHoareTripleChecker+Invalid, 5560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1348 mSolverCounterUnsat, 1449 mSDtfsCounter, 4181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1127 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4429 ImplicationChecksByTransitivity, 269.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=15, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3039 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1181 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1404 ConstructedInterpolants, 0 QuantifiedInterpolants, 7977 SizeOfPredicates, 6 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 266/3608 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-20 05:39:30,917 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-20 05:39:30,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_313958b9-bb7d-4321-af87-87bf96542c7d/bin/uautomizer-DQz5hQGWxF/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample