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/float-newlib/float_req_bl_1252a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:45:11,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:45:11,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:45:11,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:45:11,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:45:11,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:45:11,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:45:11,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:45:11,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:45:11,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:45:11,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:45:11,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:45:11,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:45:11,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:45:11,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:45:11,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:45:11,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:45:11,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:45:11,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:45:11,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:45:11,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:45:11,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:45:11,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:45:11,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:45:11,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:45:11,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:45:11,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:45:11,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:45:11,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:45:11,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:45:11,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:45:11,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:45:11,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:45:11,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:45:11,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:45:11,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:45:11,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:45:11,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:45:11,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:45:11,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:45:11,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:45:11,511 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-10 01:45:11,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:45:11,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:45:11,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:45:11,525 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:45:11,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:45:11,526 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:45:11,526 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:45:11,527 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:45:11,527 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:45:11,527 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:45:11,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:45:11,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:45:11,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:45:11,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:45:11,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:45:11,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:45:11,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:45:11,529 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:45:11,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:45:11,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:45:11,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:45:11,530 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:45:11,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:45:11,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:45:11,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:45:11,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:45:11,531 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:45:11,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:45:11,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:45:11,531 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:45:11,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:45:11,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:45:11,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:45:11,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:45:11,577 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:45:11,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1252a.c [2019-09-10 01:45:11,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43be2d7ad/1f8313f072c743cdb03ebf4b613dc5b7/FLAG70cc40e24 [2019-09-10 01:45:12,110 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:45:12,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1252a.c [2019-09-10 01:45:12,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43be2d7ad/1f8313f072c743cdb03ebf4b613dc5b7/FLAG70cc40e24 [2019-09-10 01:45:12,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43be2d7ad/1f8313f072c743cdb03ebf4b613dc5b7 [2019-09-10 01:45:12,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:45:12,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:45:12,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:45:12,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:45:12,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:45:12,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da1fec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12, skipping insertion in model container [2019-09-10 01:45:12,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,503 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:45:12,523 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:45:12,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:45:12,735 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:45:12,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:45:12,866 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:45:12,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12 WrapperNode [2019-09-10 01:45:12,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:45:12,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:45:12,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:45:12,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:45:12,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (1/1) ... [2019-09-10 01:45:12,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:45:12,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:45:12,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:45:12,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:45:12,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (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-10 01:45:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:45:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:45:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2019-09-10 01:45:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2019-09-10 01:45:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2019-09-10 01:45:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:45:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:45:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2019-09-10 01:45:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 01:45:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-09-10 01:45:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 01:45:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:45:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2019-09-10 01:45:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2019-09-10 01:45:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:45:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:45:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:45:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-09-10 01:45:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 01:45:13,364 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:45:13,365 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 01:45:13,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:45:13 BoogieIcfgContainer [2019-09-10 01:45:13,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:45:13,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:45:13,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:45:13,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:45:13,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:45:12" (1/3) ... [2019-09-10 01:45:13,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cced180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:45:13, skipping insertion in model container [2019-09-10 01:45:13,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:45:12" (2/3) ... [2019-09-10 01:45:13,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cced180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:45:13, skipping insertion in model container [2019-09-10 01:45:13,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:45:13" (3/3) ... [2019-09-10 01:45:13,373 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252a.c [2019-09-10 01:45:13,383 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:45:13,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:45:13,410 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:45:13,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:45:13,439 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:45:13,440 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:45:13,440 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:45:13,440 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:45:13,440 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:45:13,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:45:13,440 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:45:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-10 01:45:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:45:13,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:13,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:45:13,467 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash 654235306, now seen corresponding path program 1 times [2019-09-10 01:45:13,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:13,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:13,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:45:13,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:13,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:45:13,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:13,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:45:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:45:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:45:13,641 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-09-10 01:45:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:13,668 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-09-10 01:45:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:45:13,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-09-10 01:45:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:13,685 INFO L225 Difference]: With dead ends: 42 [2019-09-10 01:45:13,685 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:45:13,688 INFO L628 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 [2019-09-10 01:45:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:45:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 01:45:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:45:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-09-10 01:45:13,766 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 22 [2019-09-10 01:45:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:13,767 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-09-10 01:45:13,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:45:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-09-10 01:45:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:45:13,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:13,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:45:13,773 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash 234058304, now seen corresponding path program 1 times [2019-09-10 01:45:13,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:13,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:13,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:45:13,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:13,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:45:13,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:13,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:45:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:45:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:45:13,939 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2019-09-10 01:45:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:13,997 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-10 01:45:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:45:13,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 01:45:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:14,001 INFO L225 Difference]: With dead ends: 42 [2019-09-10 01:45:14,002 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 01:45:14,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:45:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 01:45:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 01:45:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:45:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-10 01:45:14,013 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 22 [2019-09-10 01:45:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:14,014 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-10 01:45:14,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:45:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-10 01:45:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:45:14,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:14,016 INFO L399 BasicCegarLoop]: trace histogram [1, 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-10 01:45:14,017 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash 194551587, now seen corresponding path program 1 times [2019-09-10 01:45:14,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:14,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:14,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:45:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:45:14,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:14,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:45:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:45:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:45:14,111 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 4 states. [2019-09-10 01:45:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:14,153 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-10 01:45:14,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:45:14,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-09-10 01:45:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:14,156 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:45:14,157 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:45:14,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:45:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:45:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-09-10 01:45:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:45:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-10 01:45:14,174 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2019-09-10 01:45:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:14,176 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-10 01:45:14,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:45:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-10 01:45:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:45:14,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:14,179 INFO L399 BasicCegarLoop]: trace histogram [1, 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-10 01:45:14,179 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1602399772, now seen corresponding path program 1 times [2019-09-10 01:45:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:45:14,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:14,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:45:14,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:14,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:45:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:45:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:45:14,337 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 7 states. [2019-09-10 01:45:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:14,482 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-09-10 01:45:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:45:14,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 01:45:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:14,484 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:45:14,484 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:45:14,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:45:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:45:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 01:45:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 01:45:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-09-10 01:45:14,492 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 25 [2019-09-10 01:45:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:14,493 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-09-10 01:45:14,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:45:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-09-10 01:45:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:45:14,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:14,495 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 01:45:14,495 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -300079725, now seen corresponding path program 1 times [2019-09-10 01:45:14,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:45:14,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:14,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:45:14,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:14,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:45:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:45:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:45:14,550 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 4 states. [2019-09-10 01:45:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:14,575 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-09-10 01:45:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:45:14,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-09-10 01:45:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:14,577 INFO L225 Difference]: With dead ends: 50 [2019-09-10 01:45:14,577 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 01:45:14,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:45:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 01:45:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-10 01:45:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:45:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-09-10 01:45:14,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 30 [2019-09-10 01:45:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:14,586 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-09-10 01:45:14,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:45:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-09-10 01:45:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:45:14,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:14,588 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 01:45:14,588 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1371244232, now seen corresponding path program 1 times [2019-09-10 01:45:14,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:45:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:14,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:45:14,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:14,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:45:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:45:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:45:14,677 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 5 states. [2019-09-10 01:45:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:14,722 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-09-10 01:45:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:45:14,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-10 01:45:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:14,724 INFO L225 Difference]: With dead ends: 53 [2019-09-10 01:45:14,724 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 01:45:14,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:45:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 01:45:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-10 01:45:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:45:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-09-10 01:45:14,731 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2019-09-10 01:45:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:14,732 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-09-10 01:45:14,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:45:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-09-10 01:45:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:45:14,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:14,733 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 01:45:14,734 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2114376438, now seen corresponding path program 1 times [2019-09-10 01:45:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:45:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:45:14,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:45:14,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:45:14,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:45:14,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:45:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:45:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:45:14,845 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 8 states. [2019-09-10 01:45:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:45:14,971 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-10 01:45:14,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:45:14,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-10 01:45:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:45:14,973 INFO L225 Difference]: With dead ends: 54 [2019-09-10 01:45:14,973 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 01:45:14,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:45:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 01:45:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-10 01:45:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:45:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-09-10 01:45:14,980 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2019-09-10 01:45:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:45:14,981 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-09-10 01:45:14,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:45:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-09-10 01:45:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:45:14,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:45:14,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-10 01:45:14,983 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:45:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:45:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash -609924853, now seen corresponding path program 1 times [2019-09-10 01:45:14,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:45:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:45:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:45:14,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:45:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:45:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:45:15,062 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:45:15,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:45:15 BoogieIcfgContainer [2019-09-10 01:45:15,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:45:15,126 INFO L168 Benchmark]: Toolchain (without parser) took 2637.36 ms. Allocated memory was 133.2 MB in the beginning and 224.4 MB in the end (delta: 91.2 MB). Free memory was 88.1 MB in the beginning and 147.8 MB in the end (delta: -59.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:45:15,127 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:45:15,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.91 ms. Allocated memory was 133.2 MB in the beginning and 199.2 MB in the end (delta: 66.1 MB). Free memory was 87.9 MB in the beginning and 175.1 MB in the end (delta: -87.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:45:15,131 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 ms. Allocated memory is still 199.2 MB. Free memory was 175.1 MB in the beginning and 172.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:45:15,133 INFO L168 Benchmark]: RCFGBuilder took 456.71 ms. Allocated memory is still 199.2 MB. Free memory was 172.9 MB in the beginning and 153.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:45:15,135 INFO L168 Benchmark]: TraceAbstraction took 1755.57 ms. Allocated memory was 199.2 MB in the beginning and 224.4 MB in the end (delta: 25.2 MB). Free memory was 153.2 MB in the beginning and 147.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:45:15,144 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.91 ms. Allocated memory was 133.2 MB in the beginning and 199.2 MB in the end (delta: 66.1 MB). Free memory was 87.9 MB in the beginning and 175.1 MB in the end (delta: -87.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.51 ms. Allocated memory is still 199.2 MB. Free memory was 175.1 MB in the beginning and 172.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 456.71 ms. Allocated memory is still 199.2 MB. Free memory was 172.9 MB in the beginning and 153.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1755.57 ms. Allocated memory was 199.2 MB in the beginning and 224.4 MB in the end (delta: 25.2 MB). Free memory was 153.2 MB in the beginning and 147.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 79]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 62. Possible FailurePath: [L72] float x = -0.0f; [L73] float y = 0.0f; VAL [x=0, y=0] [L75] CALL, EXPR fmax_float(x, y) VAL [\old(x)=0, \old(y)=0] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L20] __uint32_t w; VAL [\old(x)=0, x=0] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=2139095041, x=0] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=2139095041, x=0] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=2139095041, x=0] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=0, \result=0, w=2139095041, x=0] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=0, \old(y)=0, __fpclassify_float(x)=0, x=0, y=0] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=0, \old(y)=0, \result=0, x=0, y=0] [L75] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=0, x=0, y=0] [L75] float res = fmax_float(x, y); [L78] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0, res == 0.0f && __signbit_float(res) == 0=1, x=0, y=0] [L78] CALL, EXPR __signbit_float(res) VAL [\old(x)=0] [L54] __uint32_t w; VAL [\old(x)=0, x=0] [L57] ieee_float_shape_type gf_u; [L58] gf_u.value = (x) [L59] EXPR gf_u.word [L59] (w) = gf_u.word [L62] return (w & 0x80000000) != 0; VAL [\old(x)=0, \result=1, w=2139095044, x=0] [L78] RET, EXPR __signbit_float(res) VAL [__signbit_float(res)=1, res=0, res == 0.0f && __signbit_float(res) == 0=1, x=0, y=0] [L78] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [__signbit_float(res)=1, res=0, res == 0.0f && __signbit_float(res) == 0=0, x=0, y=0] [L78] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L79] __VERIFIER_error() VAL [res=0, x=0, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 1.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 303 SDtfs, 44 SDslu, 726 SDs, 0 SdLazy, 128 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 10179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 15/15 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...