java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label40_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:11:43,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:11:43,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:11:43,372 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:11:43,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:11:43,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:11:43,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:11:43,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:11:43,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:11:43,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:11:43,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:11:43,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:11:43,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:11:43,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:11:43,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:11:43,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:11:43,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:11:43,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:11:43,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:11:43,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:11:43,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:11:43,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:11:43,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:11:43,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:11:43,415 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:11:43,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:11:43,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:11:43,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:11:43,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:11:43,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:11:43,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:11:43,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:11:43,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:11:43,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:11:43,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:11:43,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:11:43,422 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:11:43,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:11:43,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:11:43,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:11:43,439 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:11:43,439 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:11:43,439 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:11:43,439 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:11:43,439 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:11:43,442 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:11:43,443 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:11:43,443 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:11:43,443 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:11:43,443 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:11:43,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:11:43,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:11:43,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:11:43,445 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:11:43,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:11:43,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:11:43,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:11:43,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:11:43,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:11:43,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:11:43,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:11:43,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:11:43,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:11:43,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:11:43,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:11:43,449 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:11:43,449 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:11:43,449 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:11:43,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:11:43,450 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:11:43,450 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:11:43,451 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:11:43,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:11:43,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:11:43,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:11:43,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:11:43,544 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:11:43,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label40_true-unreach-call.c [2018-11-07 20:11:43,618 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923b1016f/e146818eb20a4d3fa05ba8cdc278986f/FLAG2a4a5fe31 [2018-11-07 20:11:44,256 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:11:44,257 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label40_true-unreach-call.c [2018-11-07 20:11:44,287 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923b1016f/e146818eb20a4d3fa05ba8cdc278986f/FLAG2a4a5fe31 [2018-11-07 20:11:44,307 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923b1016f/e146818eb20a4d3fa05ba8cdc278986f [2018-11-07 20:11:44,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:11:44,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:11:44,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:11:44,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:11:44,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:11:44,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:11:44" (1/1) ... [2018-11-07 20:11:44,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d010140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:44, skipping insertion in model container [2018-11-07 20:11:44,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:11:44" (1/1) ... [2018-11-07 20:11:44,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:11:44,427 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:11:45,049 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:11:45,053 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:11:45,265 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:11:45,288 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:11:45,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45 WrapperNode [2018-11-07 20:11:45,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:11:45,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:11:45,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:11:45,290 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:11:45,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:11:45,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:11:45,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:11:45,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:11:45,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (1/1) ... [2018-11-07 20:11:45,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:11:45,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:11:45,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:11:45,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:11:45,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (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 [2018-11-07 20:11:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:11:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:11:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:11:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:11:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:11:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:11:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:11:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:11:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:11:49,874 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:11:49,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:49 BoogieIcfgContainer [2018-11-07 20:11:49,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:11:49,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:11:49,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:11:49,881 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:11:49,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:11:44" (1/3) ... [2018-11-07 20:11:49,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ec86c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:11:49, skipping insertion in model container [2018-11-07 20:11:49,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:45" (2/3) ... [2018-11-07 20:11:49,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ec86c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:11:49, skipping insertion in model container [2018-11-07 20:11:49,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:49" (3/3) ... [2018-11-07 20:11:49,885 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label40_true-unreach-call.c [2018-11-07 20:11:49,896 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:11:49,905 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:11:49,924 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:11:49,967 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:11:49,967 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:11:49,967 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:11:49,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:11:49,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:11:49,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:11:49,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:11:49,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:11:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-07 20:11:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 20:11:50,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:11:50,011 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:11:50,013 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:11:50,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:11:50,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1597771487, now seen corresponding path program 1 times [2018-11-07 20:11:50,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:11:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:11:50,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:11:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:11:50,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:11:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:11:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:11:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:11:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:11:50,539 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:11:50,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:11:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:11:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:11:50,569 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-11-07 20:11:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:11:53,635 INFO L93 Difference]: Finished difference Result 979 states and 1754 transitions. [2018-11-07 20:11:53,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:11:53,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-07 20:11:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:11:53,661 INFO L225 Difference]: With dead ends: 979 [2018-11-07 20:11:53,661 INFO L226 Difference]: Without dead ends: 680 [2018-11-07 20:11:53,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:11:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-11-07 20:11:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 484. [2018-11-07 20:11:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-07 20:11:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 730 transitions. [2018-11-07 20:11:53,773 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 730 transitions. Word has length 51 [2018-11-07 20:11:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:11:53,774 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 730 transitions. [2018-11-07 20:11:53,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:11:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 730 transitions. [2018-11-07 20:11:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 20:11:53,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:11:53,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:11:53,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:11:53,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:11:53,782 INFO L82 PathProgramCache]: Analyzing trace with hash 686344627, now seen corresponding path program 1 times [2018-11-07 20:11:53,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:11:53,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:11:53,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:11:53,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:11:53,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:11:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:11:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:11:54,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:11:54,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:11:54,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:11:54,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:11:54,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:11:54,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:11:54,091 INFO L87 Difference]: Start difference. First operand 484 states and 730 transitions. Second operand 6 states. [2018-11-07 20:11:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:11:58,083 INFO L93 Difference]: Finished difference Result 1555 states and 2493 transitions. [2018-11-07 20:11:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:11:58,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-07 20:11:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:11:58,093 INFO L225 Difference]: With dead ends: 1555 [2018-11-07 20:11:58,093 INFO L226 Difference]: Without dead ends: 1077 [2018-11-07 20:11:58,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:11:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-11-07 20:11:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1063. [2018-11-07 20:11:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-11-07 20:11:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1592 transitions. [2018-11-07 20:11:58,152 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1592 transitions. Word has length 124 [2018-11-07 20:11:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:11:58,152 INFO L480 AbstractCegarLoop]: Abstraction has 1063 states and 1592 transitions. [2018-11-07 20:11:58,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:11:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1592 transitions. [2018-11-07 20:11:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 20:11:58,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:11:58,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:11:58,161 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:11:58,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:11:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2122174748, now seen corresponding path program 1 times [2018-11-07 20:11:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:11:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:11:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:11:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:11:58,165 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:11:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:11:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:11:58,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:11:58,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:11:58,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:11:58,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:11:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:11:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:11:58,394 INFO L87 Difference]: Start difference. First operand 1063 states and 1592 transitions. Second operand 4 states. [2018-11-07 20:12:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:12:01,161 INFO L93 Difference]: Finished difference Result 2907 states and 4465 transitions. [2018-11-07 20:12:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:12:01,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-07 20:12:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:12:01,175 INFO L225 Difference]: With dead ends: 2907 [2018-11-07 20:12:01,175 INFO L226 Difference]: Without dead ends: 1850 [2018-11-07 20:12:01,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:12:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-11-07 20:12:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1646. [2018-11-07 20:12:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2018-11-07 20:12:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2436 transitions. [2018-11-07 20:12:01,243 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2436 transitions. Word has length 125 [2018-11-07 20:12:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:12:01,244 INFO L480 AbstractCegarLoop]: Abstraction has 1646 states and 2436 transitions. [2018-11-07 20:12:01,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:12:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2436 transitions. [2018-11-07 20:12:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 20:12:01,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:12:01,251 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:12:01,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:12:01,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash -777131457, now seen corresponding path program 1 times [2018-11-07 20:12:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:12:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:12:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:01,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:12:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:12:01,910 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:12:02,363 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-07 20:12:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:12:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:12:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 20:12:02,470 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:12:02,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:12:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:12:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:12:02,472 INFO L87 Difference]: Start difference. First operand 1646 states and 2436 transitions. Second operand 7 states. [2018-11-07 20:12:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:12:06,278 INFO L93 Difference]: Finished difference Result 4743 states and 7334 transitions. [2018-11-07 20:12:06,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 20:12:06,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-11-07 20:12:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:12:06,300 INFO L225 Difference]: With dead ends: 4743 [2018-11-07 20:12:06,300 INFO L226 Difference]: Without dead ends: 2908 [2018-11-07 20:12:06,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-07 20:12:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2018-11-07 20:12:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2759. [2018-11-07 20:12:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2018-11-07 20:12:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3978 transitions. [2018-11-07 20:12:06,411 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3978 transitions. Word has length 146 [2018-11-07 20:12:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:12:06,412 INFO L480 AbstractCegarLoop]: Abstraction has 2759 states and 3978 transitions. [2018-11-07 20:12:06,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:12:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3978 transitions. [2018-11-07 20:12:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 20:12:06,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:12:06,420 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:12:06,420 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:12:06,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1721682631, now seen corresponding path program 1 times [2018-11-07 20:12:06,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:12:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:06,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:12:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:06,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:12:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:12:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:12:07,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:12:07,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:12:07,043 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-07 20:12:07,046 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:12:07,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:12:07,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:12:07,663 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:12:08,070 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:12:08,073 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:12:08,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:08,122 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:12:08,919 INFO L227 lantSequenceWeakener]: Weakened 260 states. On average, predicates are now at 73.49% of their original sizes. [2018-11-07 20:12:08,920 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:12:09,580 INFO L415 sIntCurrentIteration]: We unified 262 AI predicates to 262 [2018-11-07 20:12:09,580 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:12:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:12:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-07 20:12:09,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:12:09,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:12:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:12:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:12:09,583 INFO L87 Difference]: Start difference. First operand 2759 states and 3978 transitions. Second operand 11 states. [2018-11-07 20:12:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:12:32,664 INFO L93 Difference]: Finished difference Result 5897 states and 8409 transitions. [2018-11-07 20:12:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 20:12:32,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-11-07 20:12:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:12:32,680 INFO L225 Difference]: With dead ends: 5897 [2018-11-07 20:12:32,680 INFO L226 Difference]: Without dead ends: 3144 [2018-11-07 20:12:32,690 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:12:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2018-11-07 20:12:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 3140. [2018-11-07 20:12:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-11-07 20:12:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4390 transitions. [2018-11-07 20:12:32,773 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4390 transitions. Word has length 263 [2018-11-07 20:12:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:12:32,774 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 4390 transitions. [2018-11-07 20:12:32,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:12:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4390 transitions. [2018-11-07 20:12:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-07 20:12:32,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:12:32,784 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:12:32,784 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:12:32,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 84419219, now seen corresponding path program 1 times [2018-11-07 20:12:32,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:12:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:32,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:12:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:32,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:12:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:12:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:12:33,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:12:33,177 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:12:33,177 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 274 with the following transitions: [2018-11-07 20:12:33,177 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:12:33,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:12:33,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:12:33,333 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:12:33,659 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:12:33,660 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:12:33,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:33,670 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:12:34,094 INFO L227 lantSequenceWeakener]: Weakened 270 states. On average, predicates are now at 73.48% of their original sizes. [2018-11-07 20:12:34,094 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:12:34,222 INFO L415 sIntCurrentIteration]: We unified 272 AI predicates to 272 [2018-11-07 20:12:34,222 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:12:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:12:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-07 20:12:34,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:12:34,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:12:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:12:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:12:34,224 INFO L87 Difference]: Start difference. First operand 3140 states and 4390 transitions. Second operand 11 states. [2018-11-07 20:12:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:12:48,433 INFO L93 Difference]: Finished difference Result 6288 states and 8885 transitions. [2018-11-07 20:12:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:12:48,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 273 [2018-11-07 20:12:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:12:48,450 INFO L225 Difference]: With dead ends: 6288 [2018-11-07 20:12:48,450 INFO L226 Difference]: Without dead ends: 3535 [2018-11-07 20:12:48,460 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 282 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:12:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2018-11-07 20:12:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3525. [2018-11-07 20:12:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3525 states. [2018-11-07 20:12:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 4839 transitions. [2018-11-07 20:12:48,546 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 4839 transitions. Word has length 273 [2018-11-07 20:12:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:12:48,547 INFO L480 AbstractCegarLoop]: Abstraction has 3525 states and 4839 transitions. [2018-11-07 20:12:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:12:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 4839 transitions. [2018-11-07 20:12:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 20:12:48,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:12:48,556 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-11-07 20:12:48,556 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:12:48,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1969010500, now seen corresponding path program 1 times [2018-11-07 20:12:48,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:12:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:48,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:12:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:48,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:12:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:12:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-07 20:12:48,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:12:48,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:12:48,901 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:12:48,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:12:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:12:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:12:48,902 INFO L87 Difference]: Start difference. First operand 3525 states and 4839 transitions. Second operand 4 states. [2018-11-07 20:12:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:12:51,916 INFO L93 Difference]: Finished difference Result 9221 states and 14138 transitions. [2018-11-07 20:12:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:12:51,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-11-07 20:12:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:12:51,951 INFO L225 Difference]: With dead ends: 9221 [2018-11-07 20:12:51,951 INFO L226 Difference]: Without dead ends: 6468 [2018-11-07 20:12:51,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:12:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2018-11-07 20:12:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 5931. [2018-11-07 20:12:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2018-11-07 20:12:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 8381 transitions. [2018-11-07 20:12:52,163 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 8381 transitions. Word has length 275 [2018-11-07 20:12:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:12:52,164 INFO L480 AbstractCegarLoop]: Abstraction has 5931 states and 8381 transitions. [2018-11-07 20:12:52,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:12:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 8381 transitions. [2018-11-07 20:12:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-07 20:12:52,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:12:52,181 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-11-07 20:12:52,181 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:12:52,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1914481691, now seen corresponding path program 1 times [2018-11-07 20:12:52,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:12:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:12:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:12:52,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:12:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:12:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 95 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:12:53,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:12:53,559 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:12:53,559 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-11-07 20:12:53,559 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:12:53,564 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:12:53,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:12:53,685 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:12:54,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:12:54,144 INFO L272 AbstractInterpreter]: Visited 141 different actions 409 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:12:54,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:12:54,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:12:54,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:12:54,179 INFO L194 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 [2018-11-07 20:12:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:12:54,189 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:12:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:12:54,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:12:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:12:55,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:12:55,712 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-07 20:12:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 89 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:12:56,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:12:56,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-11-07 20:12:56,767 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:12:56,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 20:12:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 20:12:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:12:56,769 INFO L87 Difference]: Start difference. First operand 5931 states and 8381 transitions. Second operand 16 states. [2018-11-07 20:13:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:13:10,807 INFO L93 Difference]: Finished difference Result 16339 states and 33226 transitions. [2018-11-07 20:13:10,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 20:13:10,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 278 [2018-11-07 20:13:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:13:10,973 INFO L225 Difference]: With dead ends: 16339 [2018-11-07 20:13:10,973 INFO L226 Difference]: Without dead ends: 11180 [2018-11-07 20:13:11,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 547 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=944, Invalid=3478, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 20:13:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11180 states. [2018-11-07 20:13:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11180 to 10315. [2018-11-07 20:13:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10315 states. [2018-11-07 20:13:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10315 states to 10315 states and 14918 transitions. [2018-11-07 20:13:11,784 INFO L78 Accepts]: Start accepts. Automaton has 10315 states and 14918 transitions. Word has length 278 [2018-11-07 20:13:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:13:11,785 INFO L480 AbstractCegarLoop]: Abstraction has 10315 states and 14918 transitions. [2018-11-07 20:13:11,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 20:13:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10315 states and 14918 transitions. [2018-11-07 20:13:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-07 20:13:11,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:13:11,808 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:13:11,808 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:13:11,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:13:11,808 INFO L82 PathProgramCache]: Analyzing trace with hash -527889754, now seen corresponding path program 1 times [2018-11-07 20:13:11,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:13:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:13:11,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:13:11,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:13:11,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:13:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:13:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:13:12,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:13:12,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:13:12,817 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-11-07 20:13:12,817 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:13:12,823 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:13:12,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:13:12,932 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:13:13,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:13:13,823 INFO L272 AbstractInterpreter]: Visited 156 different actions 455 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:13:13,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:13:13,848 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:13:14,681 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 75.07% of their original sizes. [2018-11-07 20:13:14,681 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:13:15,789 INFO L415 sIntCurrentIteration]: We unified 293 AI predicates to 293 [2018-11-07 20:13:15,790 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:13:15,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:13:15,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 26 [2018-11-07 20:13:15,790 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:13:15,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:13:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:13:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:13:15,792 INFO L87 Difference]: Start difference. First operand 10315 states and 14918 transitions. Second operand 21 states. [2018-11-07 20:13:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:13:49,299 INFO L93 Difference]: Finished difference Result 21168 states and 30608 transitions. [2018-11-07 20:13:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 20:13:49,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 294 [2018-11-07 20:13:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:13:49,342 INFO L225 Difference]: With dead ends: 21168 [2018-11-07 20:13:49,342 INFO L226 Difference]: Without dead ends: 11430 [2018-11-07 20:13:49,366 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 312 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 20:13:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11430 states. [2018-11-07 20:13:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11430 to 11410. [2018-11-07 20:13:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2018-11-07 20:13:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 16154 transitions. [2018-11-07 20:13:49,624 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 16154 transitions. Word has length 294 [2018-11-07 20:13:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:13:49,625 INFO L480 AbstractCegarLoop]: Abstraction has 11410 states and 16154 transitions. [2018-11-07 20:13:49,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:13:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 16154 transitions. [2018-11-07 20:13:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-07 20:13:49,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:13:49,641 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:13:49,641 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:13:49,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:13:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 454493284, now seen corresponding path program 1 times [2018-11-07 20:13:49,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:13:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:13:49,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:13:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:13:49,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:13:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:13:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 83 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:13:51,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:13:51,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:13:51,156 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 301 with the following transitions: [2018-11-07 20:13:51,156 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [784], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:13:51,160 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:13:51,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:13:51,241 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:13:51,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:13:51,881 INFO L272 AbstractInterpreter]: Visited 141 different actions 693 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:13:51,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:13:51,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:13:51,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:13:51,888 INFO L194 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:13:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:13:51,897 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:13:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:13:51,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:13:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 20:13:52,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:13:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 20:13:52,177 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:13:52,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-11-07 20:13:52,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:13:52,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:13:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:13:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:13:52,178 INFO L87 Difference]: Start difference. First operand 11410 states and 16154 transitions. Second operand 3 states. [2018-11-07 20:13:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:13:53,568 INFO L93 Difference]: Finished difference Result 23665 states and 35561 transitions. [2018-11-07 20:13:53,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:13:53,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-11-07 20:13:53,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:13:53,620 INFO L225 Difference]: With dead ends: 23665 [2018-11-07 20:13:53,621 INFO L226 Difference]: Without dead ends: 14315 [2018-11-07 20:13:53,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 602 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:13:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14315 states. [2018-11-07 20:13:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14315 to 13740. [2018-11-07 20:13:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-11-07 20:13:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 19527 transitions. [2018-11-07 20:13:53,968 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 19527 transitions. Word has length 300 [2018-11-07 20:13:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:13:53,969 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 19527 transitions. [2018-11-07 20:13:53,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:13:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 19527 transitions. [2018-11-07 20:13:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-07 20:13:53,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:13:54,000 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-07 20:13:54,000 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:13:54,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:13:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash -463132084, now seen corresponding path program 1 times [2018-11-07 20:13:54,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:13:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:13:54,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:13:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:13:54,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:13:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:13:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 237 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:13:55,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:13:55,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:13:55,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-11-07 20:13:55,212 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:13:55,214 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:13:55,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:13:55,316 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:13:56,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:13:56,949 INFO L272 AbstractInterpreter]: Visited 127 different actions 754 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 10 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:13:56,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:13:56,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:13:56,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:13:56,954 INFO L194 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 [2018-11-07 20:13:56,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:13:56,964 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:13:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:13:57,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:13:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 20:13:57,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:13:57,850 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-07 20:13:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 20:13:58,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:13:58,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 24 [2018-11-07 20:13:58,446 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:13:58,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 20:13:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 20:13:58,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-11-07 20:13:58,448 INFO L87 Difference]: Start difference. First operand 13740 states and 19527 transitions. Second operand 22 states. [2018-11-07 20:13:59,949 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-11-07 20:14:01,062 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-11-07 20:14:02,774 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-11-07 20:14:03,140 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2018-11-07 20:14:04,880 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-11-07 20:14:05,153 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-07 20:14:05,493 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-07 20:14:07,328 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-07 20:14:09,333 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-11-07 20:14:14,340 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2018-11-07 20:14:15,561 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-07 20:14:17,607 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-07 20:14:19,219 WARN L179 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-07 20:14:29,891 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-11-07 20:14:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:14:30,255 INFO L93 Difference]: Finished difference Result 39500 states and 67401 transitions. [2018-11-07 20:14:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-11-07 20:14:30,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 353 [2018-11-07 20:14:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:14:30,350 INFO L225 Difference]: With dead ends: 39500 [2018-11-07 20:14:30,350 INFO L226 Difference]: Without dead ends: 22076 [2018-11-07 20:14:30,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 791 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7676 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3515, Invalid=17365, Unknown=0, NotChecked=0, Total=20880 [2018-11-07 20:14:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22076 states. [2018-11-07 20:14:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22076 to 20595. [2018-11-07 20:14:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20595 states. [2018-11-07 20:14:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20595 states to 20595 states and 25069 transitions. [2018-11-07 20:14:31,031 INFO L78 Accepts]: Start accepts. Automaton has 20595 states and 25069 transitions. Word has length 353 [2018-11-07 20:14:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:14:31,032 INFO L480 AbstractCegarLoop]: Abstraction has 20595 states and 25069 transitions. [2018-11-07 20:14:31,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 20:14:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20595 states and 25069 transitions. [2018-11-07 20:14:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-11-07 20:14:31,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:14:31,056 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:14:31,056 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:14:31,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:14:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1486716189, now seen corresponding path program 1 times [2018-11-07 20:14:31,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:14:31,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:14:31,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:14:31,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:14:31,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:14:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:14:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 145 proven. 253 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 20:14:31,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:14:31,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:14:31,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 361 with the following transitions: [2018-11-07 20:14:31,711 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:14:31,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:14:31,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:14:31,798 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:14:32,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:14:32,663 INFO L272 AbstractInterpreter]: Visited 137 different actions 679 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:14:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:14:32,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:14:32,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:14:32,672 INFO L194 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 [2018-11-07 20:14:32,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:14:32,682 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:14:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:14:32,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:14:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 315 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 20:14:33,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:14:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 315 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 20:14:33,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:14:33,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-11-07 20:14:33,747 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:14:33,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 20:14:33,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 20:14:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:14:33,749 INFO L87 Difference]: Start difference. First operand 20595 states and 25069 transitions. Second operand 16 states. [2018-11-07 20:14:41,647 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-07 20:14:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:14:49,365 INFO L93 Difference]: Finished difference Result 55062 states and 75786 transitions. [2018-11-07 20:14:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-07 20:14:49,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 360 [2018-11-07 20:14:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:14:49,536 INFO L225 Difference]: With dead ends: 55062 [2018-11-07 20:14:49,536 INFO L226 Difference]: Without dead ends: 36011 [2018-11-07 20:14:49,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 782 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1356, Invalid=7016, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 20:14:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36011 states. [2018-11-07 20:14:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36011 to 33849. [2018-11-07 20:14:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33849 states. [2018-11-07 20:14:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33849 states to 33849 states and 41520 transitions. [2018-11-07 20:14:50,605 INFO L78 Accepts]: Start accepts. Automaton has 33849 states and 41520 transitions. Word has length 360 [2018-11-07 20:14:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:14:50,606 INFO L480 AbstractCegarLoop]: Abstraction has 33849 states and 41520 transitions. [2018-11-07 20:14:50,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 20:14:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 33849 states and 41520 transitions. [2018-11-07 20:14:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-11-07 20:14:50,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:14:50,629 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:14:50,630 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:14:50,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:14:50,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1040560352, now seen corresponding path program 1 times [2018-11-07 20:14:50,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:14:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:14:50,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:14:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:14:50,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:14:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:14:51,039 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:14:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 146 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:14:52,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:14:52,068 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:14:52,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-11-07 20:14:52,069 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [629], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:14:52,071 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:14:52,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:14:52,117 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:14:52,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:14:52,667 INFO L272 AbstractInterpreter]: Visited 137 different actions 678 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:14:52,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:14:52,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:14:52,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:14:52,676 INFO L194 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:14:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:14:52,686 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:14:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:14:52,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:15:01,940 WARN L179 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 508 DAG size of output: 26 [2018-11-07 20:15:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 134 proven. 191 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-07 20:15:03,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:15:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 323 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-07 20:15:04,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:15:04,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 5] total 26 [2018-11-07 20:15:04,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:15:04,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 20:15:04,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 20:15:04,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=550, Unknown=2, NotChecked=0, Total=650 [2018-11-07 20:15:04,692 INFO L87 Difference]: Start difference. First operand 33849 states and 41520 transitions. Second operand 24 states. [2018-11-07 20:15:11,294 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-11-07 20:15:13,180 WARN L179 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-07 20:15:13,415 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 Received shutdown request... [2018-11-07 20:15:25,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 20:15:25,645 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:15:25,650 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:15:25,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:15:25 BoogieIcfgContainer [2018-11-07 20:15:25,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:15:25,651 INFO L168 Benchmark]: Toolchain (without parser) took 221329.14 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 486.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:15:25,652 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:15:25,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 962.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:15:25,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -835.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:15:25,655 INFO L168 Benchmark]: Boogie Preprocessor took 145.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-11-07 20:15:25,655 INFO L168 Benchmark]: RCFGBuilder took 4263.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 178.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:15:25,657 INFO L168 Benchmark]: TraceAbstraction took 215773.74 ms. Allocated memory was 2.2 GB in the beginning and 4.4 GB in the end (delta: 2.2 GB). Free memory was 2.0 GB in the beginning and 3.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 358.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:15:25,662 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 962.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 175.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -835.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4263.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 178.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215773.74 ms. Allocated memory was 2.2 GB in the beginning and 4.4 GB in the end (delta: 2.2 GB). Free memory was 2.0 GB in the beginning and 3.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 358.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 138). Cancelled while BasicCegarLoop was constructing difference of abstraction (33849states) and FLOYD_HOARE automaton (currently 33 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (1478 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 215.6s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 172.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3314 SDtfs, 33223 SDslu, 5838 SDs, 0 SdLazy, 51210 SolverSat, 10782 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 85.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 4733 GetRequests, 4269 SyntacticMatches, 11 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12924 ImplicationChecksByTransitivity, 42.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33849occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.2s AbstIntTime, 8 AbstIntIterations, 3 AbstIntStrong, 0.9977599499788133 AbsIntWeakeningRatio, 0.10157194679564692 AbsIntAvgWeakeningVarsNumRemoved, 20.429262394195888 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 6217 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 4883 NumberOfCodeBlocks, 4883 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6526 ConstructedInterpolants, 14 QuantifiedInterpolants, 15195388 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2822 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 4240/5721 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown