java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_1-3.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:57,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:57,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:57,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:57,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:57,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:57,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:57,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:57,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:57,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:57,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:57,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:57,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:57,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:57,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:57,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:57,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:57,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:57,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:57,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:57,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:57,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:57,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:57,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:57,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:57,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:57,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:57,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:57,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:57,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:57,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:57,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:57,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:57,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:57,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:57,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:57,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:57,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:57,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:57,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:57,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:57,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:44:57,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:57,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:57,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:57,580 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:57,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:57,581 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:57,581 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:57,581 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:57,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:57,581 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:57,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:57,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:57,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:57,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:57,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:57,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:57,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:57,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:57,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:57,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:57,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:57,586 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:57,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:57,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:57,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:57,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:57,587 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:57,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:57,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:57,588 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:57,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:57,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:57,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:57,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:57,640 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:57,642 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_1-3.c.cil.c [2019-09-09 05:44:57,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c586f03/2da8e3b1fff642639af593c90fbb9af5/FLAGcf5e014b0 [2019-09-09 05:44:58,202 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:58,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-3.c.cil.c [2019-09-09 05:44:58,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c586f03/2da8e3b1fff642639af593c90fbb9af5/FLAGcf5e014b0 [2019-09-09 05:44:58,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c586f03/2da8e3b1fff642639af593c90fbb9af5 [2019-09-09 05:44:58,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:58,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:58,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:58,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:58,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:58,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:58" (1/1) ... [2019-09-09 05:44:58,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6436ddd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:58, skipping insertion in model container [2019-09-09 05:44:58,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:58" (1/1) ... [2019-09-09 05:44:58,564 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:58,594 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:58,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:58,933 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:58,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:59,001 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:59,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59 WrapperNode [2019-09-09 05:44:59,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:59,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:59,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:59,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:59,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... [2019-09-09 05:44:59,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:59,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:59,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:59,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:59,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:59,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:59,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:59,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:44:59,103 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2019-09-09 05:44:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2019-09-09 05:44:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2019-09-09 05:44:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:44:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:44:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:44:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2019-09-09 05:44:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2019-09-09 05:44:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2019-09-09 05:44:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:59,616 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:59,617 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:44:59,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:59 BoogieIcfgContainer [2019-09-09 05:44:59,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:59,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:59,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:59,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:59,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:58" (1/3) ... [2019-09-09 05:44:59,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7ae19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:59, skipping insertion in model container [2019-09-09 05:44:59,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:59" (2/3) ... [2019-09-09 05:44:59,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c7ae19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:59, skipping insertion in model container [2019-09-09 05:44:59,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:59" (3/3) ... [2019-09-09 05:44:59,630 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2019-09-09 05:44:59,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:59,647 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:59,664 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:59,689 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:59,689 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:59,689 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:59,689 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:59,689 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:59,690 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:59,690 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:59,690 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-09-09 05:44:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 05:44:59,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:59,717 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:59,719 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 931229349, now seen corresponding path program 1 times [2019-09-09 05:44:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:59,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:59,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:59,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:59,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:00,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:00,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:00,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2019-09-09 05:45:00,127 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [111], [113], [115], [117], [120], [133], [238], [241], [243], [249], [252], [260], [290], [291], [292], [294], [295], [296], [297], [298], [299], [300], [308] [2019-09-09 05:45:00,163 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:00,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:00,231 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:00,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:00,266 INFO L272 AbstractInterpreter]: Visited 28 different actions 36 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 6. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 29 variables. [2019-09-09 05:45:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:00,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:00,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:00,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:00,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:00,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:00,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-09 05:45:00,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 05:45:00,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:00,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:00,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2019-09-09 05:45:00,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:00,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:45:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:45:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:45:00,766 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 12 states. [2019-09-09 05:45:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:01,492 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2019-09-09 05:45:01,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-09 05:45:01,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-09-09 05:45:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:01,513 INFO L225 Difference]: With dead ends: 153 [2019-09-09 05:45:01,513 INFO L226 Difference]: Without dead ends: 145 [2019-09-09 05:45:01,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-09-09 05:45:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-09 05:45:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 122. [2019-09-09 05:45:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-09 05:45:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2019-09-09 05:45:01,621 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 36 [2019-09-09 05:45:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:01,622 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2019-09-09 05:45:01,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:45:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2019-09-09 05:45:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 05:45:01,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:01,625 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:01,625 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 988487651, now seen corresponding path program 1 times [2019-09-09 05:45:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:01,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:01,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:01,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:01,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:45:01,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:01,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:01,826 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand 8 states. [2019-09-09 05:45:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:02,017 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2019-09-09 05:45:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:02,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-09 05:45:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:02,022 INFO L225 Difference]: With dead ends: 186 [2019-09-09 05:45:02,022 INFO L226 Difference]: Without dead ends: 186 [2019-09-09 05:45:02,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:45:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-09 05:45:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2019-09-09 05:45:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-09 05:45:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 263 transitions. [2019-09-09 05:45:02,061 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 263 transitions. Word has length 36 [2019-09-09 05:45:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:02,062 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 263 transitions. [2019-09-09 05:45:02,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 263 transitions. [2019-09-09 05:45:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:45:02,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:02,064 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:02,065 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1417086124, now seen corresponding path program 1 times [2019-09-09 05:45:02,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:02,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:45:02,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:02,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:45:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:45:02,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:45:02,269 INFO L87 Difference]: Start difference. First operand 182 states and 263 transitions. Second operand 7 states. [2019-09-09 05:45:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:02,383 INFO L93 Difference]: Finished difference Result 237 states and 347 transitions. [2019-09-09 05:45:02,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:45:02,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-09-09 05:45:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:02,387 INFO L225 Difference]: With dead ends: 237 [2019-09-09 05:45:02,388 INFO L226 Difference]: Without dead ends: 237 [2019-09-09 05:45:02,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:45:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-09 05:45:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2019-09-09 05:45:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-09 05:45:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2019-09-09 05:45:02,415 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 40 [2019-09-09 05:45:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:02,415 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2019-09-09 05:45:02,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:45:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2019-09-09 05:45:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:45:02,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:02,418 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:02,419 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1982778216, now seen corresponding path program 1 times [2019-09-09 05:45:02,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:02,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:02,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:02,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:02,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:02,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2019-09-09 05:45:02,530 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [50], [60], [62], [63], [111], [113], [115], [117], [120], [133], [238], [241], [243], [249], [254], [260], [290], [291], [292], [294], [295], [296], [297], [298], [299], [300], [308] [2019-09-09 05:45:02,536 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:02,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:02,543 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:02,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:02,732 INFO L272 AbstractInterpreter]: Visited 33 different actions 175 times. Merged at 11 different actions 49 times. Never widened. Performed 353 root evaluator evaluations with a maximum evaluation depth of 6. Performed 353 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 1 different actions. Largest state had 29 variables. [2019-09-09 05:45:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:02,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:02,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:02,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:02,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:02,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:02,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-09 05:45:02,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-09 05:45:02,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:03,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:03,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2019-09-09 05:45:03,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:03,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:45:03,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:45:03,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:45:03,010 INFO L87 Difference]: Start difference. First operand 234 states and 343 transitions. Second operand 9 states. [2019-09-09 05:45:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:03,190 INFO L93 Difference]: Finished difference Result 246 states and 352 transitions. [2019-09-09 05:45:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:45:03,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-09 05:45:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:03,195 INFO L225 Difference]: With dead ends: 246 [2019-09-09 05:45:03,196 INFO L226 Difference]: Without dead ends: 246 [2019-09-09 05:45:03,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:45:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-09 05:45:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 234. [2019-09-09 05:45:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-09 05:45:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 333 transitions. [2019-09-09 05:45:03,232 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 333 transitions. Word has length 40 [2019-09-09 05:45:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:03,233 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 333 transitions. [2019-09-09 05:45:03,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:45:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 333 transitions. [2019-09-09 05:45:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-09 05:45:03,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:03,244 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:03,244 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1309831926, now seen corresponding path program 1 times [2019-09-09 05:45:03,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:03,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:03,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:03,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:03,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:03,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2019-09-09 05:45:03,432 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [111], [113], [115], [117], [122], [127], [129], [135], [138], [142], [238], [241], [243], [249], [254], [260], [290], [291], [292], [294], [295], [296], [297], [298], [299], [300], [308] [2019-09-09 05:45:03,434 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:03,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:03,437 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:03,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:03,487 INFO L272 AbstractInterpreter]: Visited 37 different actions 121 times. Merged at 13 different actions 35 times. Never widened. Performed 245 root evaluator evaluations with a maximum evaluation depth of 6. Performed 245 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 29 variables. [2019-09-09 05:45:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:03,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:03,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:03,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:03,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:03,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:03,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-09 05:45:03,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 05:45:03,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:45:03,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:03,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2019-09-09 05:45:03,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:03,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:45:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:45:03,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:45:03,953 INFO L87 Difference]: Start difference. First operand 234 states and 333 transitions. Second operand 13 states. [2019-09-09 05:45:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,530 INFO L93 Difference]: Finished difference Result 260 states and 371 transitions. [2019-09-09 05:45:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-09 05:45:04,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-09 05:45:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,533 INFO L225 Difference]: With dead ends: 260 [2019-09-09 05:45:04,533 INFO L226 Difference]: Without dead ends: 260 [2019-09-09 05:45:04,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-09 05:45:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-09 05:45:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2019-09-09 05:45:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-09 05:45:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2019-09-09 05:45:04,545 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 44 [2019-09-09 05:45:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:04,546 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2019-09-09 05:45:04,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:45:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2019-09-09 05:45:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:04,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:04,548 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:04,549 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -440320475, now seen corresponding path program 1 times [2019-09-09 05:45:04,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:04,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:04,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:04,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2019-09-09 05:45:04,726 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [111], [113], [115], [117], [122], [125], [129], [135], [138], [142], [238], [241], [243], [249], [252], [260], [290], [291], [292], [294], [295], [296], [297], [298], [299], [300], [308] [2019-09-09 05:45:04,730 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:04,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:04,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:04,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:04,772 INFO L272 AbstractInterpreter]: Visited 37 different actions 106 times. Merged at 13 different actions 27 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2019-09-09 05:45:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:04,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:04,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:04,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-09 05:45:04,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:04,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:05,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:45:05,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 10] total 20 [2019-09-09 05:45:05,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:05,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 05:45:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 05:45:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-09 05:45:05,120 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand 10 states. [2019-09-09 05:45:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:05,522 INFO L93 Difference]: Finished difference Result 327 states and 469 transitions. [2019-09-09 05:45:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:45:05,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-09-09 05:45:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:05,526 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:45:05,527 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:45:05,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-09-09 05:45:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:45:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 310. [2019-09-09 05:45:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-09 05:45:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2019-09-09 05:45:05,543 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 48 [2019-09-09 05:45:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:05,543 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2019-09-09 05:45:05,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 05:45:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2019-09-09 05:45:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:05,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:05,546 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:05,546 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:05,547 INFO L82 PathProgramCache]: Analyzing trace with hash -383062173, now seen corresponding path program 1 times [2019-09-09 05:45:05,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-09 05:45:05,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:05,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-09 05:45:05,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:05,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:45:05,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:45:05,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:45:05,811 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand 13 states. [2019-09-09 05:45:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:06,432 INFO L93 Difference]: Finished difference Result 331 states and 472 transitions. [2019-09-09 05:45:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:45:06,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-09 05:45:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:06,435 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:45:06,436 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:45:06,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:45:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:45:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 314. [2019-09-09 05:45:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-09 05:45:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 447 transitions. [2019-09-09 05:45:06,449 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 447 transitions. Word has length 48 [2019-09-09 05:45:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:06,450 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 447 transitions. [2019-09-09 05:45:06,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:45:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 447 transitions. [2019-09-09 05:45:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:06,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:06,454 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:06,454 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:06,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2029832855, now seen corresponding path program 1 times [2019-09-09 05:45:06,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:06,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:06,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:06,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2019-09-09 05:45:06,557 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [50], [54], [60], [62], [63], [111], [113], [115], [117], [122], [125], [129], [135], [138], [142], [238], [241], [243], [249], [252], [260], [290], [291], [292], [294], [295], [296], [297], [298], [299], [300], [308] [2019-09-09 05:45:06,559 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:06,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:06,561 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:06,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:06,641 INFO L272 AbstractInterpreter]: Visited 39 different actions 296 times. Merged at 16 different actions 119 times. Never widened. Performed 617 root evaluator evaluations with a maximum evaluation depth of 6. Performed 617 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 29 variables. [2019-09-09 05:45:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:06,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:45:06,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:45:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-09 05:45:06,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:06,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:07,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod c_main_~a~0 4294967296))) is different from false [2019-09-09 05:45:07,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod |c_main_#t~ret5| 4294967296))) is different from false [2019-09-09 05:45:07,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod |c_base2flt_#res| 4294967296))) is different from false [2019-09-09 05:45:07,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod c_base2flt_~__retres4~0 4294967296))) is different from false [2019-09-09 05:45:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:45:07,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:07,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-09 05:45:07,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:07,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:45:07,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:45:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=75, Unknown=4, NotChecked=76, Total=182 [2019-09-09 05:45:07,950 INFO L87 Difference]: Start difference. First operand 314 states and 447 transitions. Second operand 8 states. [2019-09-09 05:45:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:08,125 INFO L93 Difference]: Finished difference Result 349 states and 494 transitions. [2019-09-09 05:45:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:45:08,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-09-09 05:45:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:08,129 INFO L225 Difference]: With dead ends: 349 [2019-09-09 05:45:08,129 INFO L226 Difference]: Without dead ends: 349 [2019-09-09 05:45:08,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=107, Unknown=4, NotChecked=92, Total=240 [2019-09-09 05:45:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-09 05:45:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2019-09-09 05:45:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-09 05:45:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 473 transitions. [2019-09-09 05:45:08,143 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 473 transitions. Word has length 48 [2019-09-09 05:45:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:08,143 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 473 transitions. [2019-09-09 05:45:08,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:45:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 473 transitions. [2019-09-09 05:45:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:45:08,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:08,145 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:08,145 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1972574553, now seen corresponding path program 1 times [2019-09-09 05:45:08,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:08,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:08,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:45:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:45:08,201 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:45:08,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:45:08 BoogieIcfgContainer [2019-09-09 05:45:08,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:45:08,266 INFO L168 Benchmark]: Toolchain (without parser) took 9718.74 ms. Allocated memory was 142.1 MB in the beginning and 296.2 MB in the end (delta: 154.1 MB). Free memory was 87.7 MB in the beginning and 131.2 MB in the end (delta: -43.5 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:08,268 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 142.1 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:45:08,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.48 ms. Allocated memory was 142.1 MB in the beginning and 201.3 MB in the end (delta: 59.2 MB). Free memory was 87.7 MB in the beginning and 175.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:08,270 INFO L168 Benchmark]: Boogie Preprocessor took 47.29 ms. Allocated memory is still 201.3 MB. Free memory was 175.9 MB in the beginning and 174.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:08,272 INFO L168 Benchmark]: RCFGBuilder took 568.47 ms. Allocated memory is still 201.3 MB. Free memory was 174.3 MB in the beginning and 145.5 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:08,277 INFO L168 Benchmark]: TraceAbstraction took 8643.35 ms. Allocated memory was 201.3 MB in the beginning and 296.2 MB in the end (delta: 94.9 MB). Free memory was 145.5 MB in the beginning and 131.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:08,284 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 142.1 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 455.48 ms. Allocated memory was 142.1 MB in the beginning and 201.3 MB in the end (delta: 59.2 MB). Free memory was 87.7 MB in the beginning and 175.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.29 ms. Allocated memory is still 201.3 MB. Free memory was 175.9 MB in the beginning and 174.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 568.47 ms. Allocated memory is still 201.3 MB. Free memory was 174.3 MB in the beginning and 145.5 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8643.35 ms. Allocated memory was 201.3 MB in the beginning and 296.2 MB in the end (delta: 94.9 MB). Free memory was 145.5 MB in the beginning and 131.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=1, e=0, res=1] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=4294967297, __retres4=1, e=0, res=1] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967297, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L248] COND TRUE a > zero [L249] tmp = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L253] sa = tmp VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L255] COND FALSE !(b < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L258] COND TRUE b > zero [L259] tmp___0 = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L263] sb = tmp___0 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L266] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=1] [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127, eb=128] [L104] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 93 locations, 1 error locations. UNSAFE Result, 8.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 604 SDslu, 6660 SDs, 0 SdLazy, 1851 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 392 SyntacticMatches, 10 SemanticMatches, 131 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 126 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 754 ConstructedInterpolants, 38 QuantifiedInterpolants, 106715 SizeOfPredicates, 24 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 226/295 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...