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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label09_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 17:18:40,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 17:18:40,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 17:18:40,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 17:18:40,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 17:18:40,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 17:18:40,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 17:18:40,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 17:18:40,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 17:18:40,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 17:18:40,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 17:18:40,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 17:18:40,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 17:18:40,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 17:18:40,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 17:18:40,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 17:18:40,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 17:18:40,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 17:18:40,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 17:18:40,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 17:18:40,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 17:18:40,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 17:18:40,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 17:18:40,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 17:18:40,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 17:18:40,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 17:18:40,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 17:18:40,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 17:18:40,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 17:18:40,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 17:18:40,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 17:18:40,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 17:18:40,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 17:18:40,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 17:18:40,447 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 17:18:40,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 17:18:40,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 17:18:40,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 17:18:40,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 17:18:40,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 17:18:40,470 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 17:18:40,471 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 17:18:40,471 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 17:18:40,471 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 17:18:40,471 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 17:18:40,471 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 17:18:40,472 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 17:18:40,472 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 17:18:40,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 17:18:40,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 17:18:40,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 17:18:40,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 17:18:40,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 17:18:40,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 17:18:40,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 17:18:40,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 17:18:40,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 17:18:40,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 17:18:40,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 17:18:40,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 17:18:40,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:18:40,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 17:18:40,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 17:18:40,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 17:18:40,476 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 17:18:40,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 17:18:40,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 17:18:40,476 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 17:18:40,476 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 17:18:40,476 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 17:18:40,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 17:18:40,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 17:18:40,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 17:18:40,565 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 17:18:40,565 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 17:18:40,566 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label09_true-unreach-call.c [2018-09-14 17:18:40,914 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81bb7034e/109b05a8d852429fad01a0f30d08b61e/FLAGafa9340e2 [2018-09-14 17:18:41,393 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 17:18:41,394 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label09_true-unreach-call.c [2018-09-14 17:18:41,421 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81bb7034e/109b05a8d852429fad01a0f30d08b61e/FLAGafa9340e2 [2018-09-14 17:18:41,437 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81bb7034e/109b05a8d852429fad01a0f30d08b61e [2018-09-14 17:18:41,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 17:18:41,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 17:18:41,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 17:18:41,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 17:18:41,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 17:18:41,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:18:41" (1/1) ... [2018-09-14 17:18:41,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad3ee8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:41, skipping insertion in model container [2018-09-14 17:18:41,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:18:41" (1/1) ... [2018-09-14 17:18:41,483 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 17:18:42,907 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:18:42,927 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 17:18:43,483 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:18:43,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43 WrapperNode [2018-09-14 17:18:43,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 17:18:43,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 17:18:43,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 17:18:43,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 17:18:43,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:43,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:44,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 17:18:44,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 17:18:44,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 17:18:44,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 17:18:44,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:44,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:44,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:44,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:44,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:44,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:45,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (1/1) ... [2018-09-14 17:18:45,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 17:18:45,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 17:18:45,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 17:18:45,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 17:18:45,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (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-09-14 17:18:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 17:18:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 17:18:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-14 17:18:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-14 17:18:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-14 17:18:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-14 17:18:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-14 17:18:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-14 17:18:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 17:18:45,185 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 17:18:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 17:18:45,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 17:18:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 17:18:45,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 17:18:55,350 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 17:18:55,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:18:55 BoogieIcfgContainer [2018-09-14 17:18:55,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 17:18:55,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 17:18:55,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 17:18:55,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 17:18:55,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 05:18:41" (1/3) ... [2018-09-14 17:18:55,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdfa30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:18:55, skipping insertion in model container [2018-09-14 17:18:55,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:18:43" (2/3) ... [2018-09-14 17:18:55,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdfa30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:18:55, skipping insertion in model container [2018-09-14 17:18:55,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:18:55" (3/3) ... [2018-09-14 17:18:55,359 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label09_true-unreach-call.c [2018-09-14 17:18:55,369 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 17:18:55,378 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 17:18:55,444 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 17:18:55,445 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 17:18:55,445 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 17:18:55,445 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 17:18:55,445 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 17:18:55,445 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 17:18:55,446 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 17:18:55,446 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 17:18:55,446 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 17:18:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-09-14 17:18:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-14 17:18:55,505 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:18:55,506 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:18:55,507 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:18:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -539031517, now seen corresponding path program 1 times [2018-09-14 17:18:55,514 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:18:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:18:55,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:18:55,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:18:55,564 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:18:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:18:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:18:56,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:18:56,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:18:56,163 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:18:56,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:18:56,185 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:18:56,185 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:18:56,188 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-09-14 17:19:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:19:04,473 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-09-14 17:19:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:19:04,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-09-14 17:19:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:19:04,508 INFO L225 Difference]: With dead ends: 2446 [2018-09-14 17:19:04,509 INFO L226 Difference]: Without dead ends: 1604 [2018-09-14 17:19:04,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:19:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-09-14 17:19:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-09-14 17:19:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-09-14 17:19:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2969 transitions. [2018-09-14 17:19:04,675 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2969 transitions. Word has length 73 [2018-09-14 17:19:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:19:04,676 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2969 transitions. [2018-09-14 17:19:04,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:19:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2969 transitions. [2018-09-14 17:19:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-14 17:19:04,686 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:19:04,687 INFO L376 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, 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] [2018-09-14 17:19:04,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:19:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1174971868, now seen corresponding path program 1 times [2018-09-14 17:19:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:19:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:04,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:04,691 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:19:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:19:05,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:19:05,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 17:19:05,038 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:19:05,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:19:05,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:19:05,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 17:19:05,041 INFO L87 Difference]: Start difference. First operand 1604 states and 2969 transitions. Second operand 5 states. [2018-09-14 17:19:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:19:16,230 INFO L93 Difference]: Finished difference Result 4038 states and 7427 transitions. [2018-09-14 17:19:16,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:19:16,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-09-14 17:19:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:19:16,250 INFO L225 Difference]: With dead ends: 4038 [2018-09-14 17:19:16,250 INFO L226 Difference]: Without dead ends: 2440 [2018-09-14 17:19:16,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:19:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2018-09-14 17:19:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2413. [2018-09-14 17:19:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-09-14 17:19:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 4141 transitions. [2018-09-14 17:19:16,329 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 4141 transitions. Word has length 147 [2018-09-14 17:19:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:19:16,329 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 4141 transitions. [2018-09-14 17:19:16,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:19:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 4141 transitions. [2018-09-14 17:19:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-14 17:19:16,334 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:19:16,335 INFO L376 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, 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] [2018-09-14 17:19:16,335 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:19:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash 710506752, now seen corresponding path program 1 times [2018-09-14 17:19:16,335 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:19:16,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:16,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:16,337 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:19:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:19:16,513 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:19:16,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:19:16,513 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:19:16,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:19:16,514 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:19:16,514 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:19:16,515 INFO L87 Difference]: Start difference. First operand 2413 states and 4141 transitions. Second operand 4 states. [2018-09-14 17:19:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:19:25,137 INFO L93 Difference]: Finished difference Result 9492 states and 16758 transitions. [2018-09-14 17:19:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:19:25,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-09-14 17:19:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:19:25,191 INFO L225 Difference]: With dead ends: 9492 [2018-09-14 17:19:25,192 INFO L226 Difference]: Without dead ends: 7085 [2018-09-14 17:19:25,205 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-09-14 17:19:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2018-09-14 17:19:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7085. [2018-09-14 17:19:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-09-14 17:19:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 11755 transitions. [2018-09-14 17:19:25,408 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 11755 transitions. Word has length 149 [2018-09-14 17:19:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:19:25,408 INFO L480 AbstractCegarLoop]: Abstraction has 7085 states and 11755 transitions. [2018-09-14 17:19:25,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:19:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 11755 transitions. [2018-09-14 17:19:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-14 17:19:25,415 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:19:25,415 INFO L376 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, 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] [2018-09-14 17:19:25,416 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:19:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2064727429, now seen corresponding path program 1 times [2018-09-14 17:19:25,416 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:19:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:25,417 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:19:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:25,746 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:19:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:19:25,877 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:19:25,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 17:19:25,877 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:19:25,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 17:19:25,878 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 17:19:25,878 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 17:19:25,878 INFO L87 Difference]: Start difference. First operand 7085 states and 11755 transitions. Second operand 6 states. [2018-09-14 17:19:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:19:32,614 INFO L93 Difference]: Finished difference Result 16634 states and 27837 transitions. [2018-09-14 17:19:32,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:19:32,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-09-14 17:19:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:19:32,661 INFO L225 Difference]: With dead ends: 16634 [2018-09-14 17:19:32,661 INFO L226 Difference]: Without dead ends: 9555 [2018-09-14 17:19:32,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:19:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2018-09-14 17:19:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 9513. [2018-09-14 17:19:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9513 states. [2018-09-14 17:19:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 14979 transitions. [2018-09-14 17:19:32,943 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 14979 transitions. Word has length 176 [2018-09-14 17:19:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:19:32,944 INFO L480 AbstractCegarLoop]: Abstraction has 9513 states and 14979 transitions. [2018-09-14 17:19:32,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 17:19:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 14979 transitions. [2018-09-14 17:19:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-14 17:19:32,957 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:19:32,957 INFO L376 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, 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] [2018-09-14 17:19:32,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:19:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash -907554919, now seen corresponding path program 1 times [2018-09-14 17:19:32,958 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:19:32,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:32,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:32,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:32,959 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:19:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:33,223 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:19:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:19:33,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:19:33,617 INFO L197 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-09-14 17:19:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:33,632 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:19:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:33,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:19:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-14 17:19:34,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:19:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:19:35,192 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:19:35,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2018-09-14 17:19:35,193 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:19:35,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:19:35,194 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:19:35,194 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:19:35,194 INFO L87 Difference]: Start difference. First operand 9513 states and 14979 transitions. Second operand 5 states. [2018-09-14 17:19:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:19:49,507 INFO L93 Difference]: Finished difference Result 33378 states and 55685 transitions. [2018-09-14 17:19:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 17:19:49,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2018-09-14 17:19:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:19:49,676 INFO L225 Difference]: With dead ends: 33378 [2018-09-14 17:19:49,676 INFO L226 Difference]: Without dead ends: 23871 [2018-09-14 17:19:49,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 473 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-09-14 17:19:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23871 states. [2018-09-14 17:19:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23871 to 23714. [2018-09-14 17:19:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23714 states. [2018-09-14 17:19:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23714 states to 23714 states and 35236 transitions. [2018-09-14 17:19:50,620 INFO L78 Accepts]: Start accepts. Automaton has 23714 states and 35236 transitions. Word has length 239 [2018-09-14 17:19:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:19:50,620 INFO L480 AbstractCegarLoop]: Abstraction has 23714 states and 35236 transitions. [2018-09-14 17:19:50,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:19:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 23714 states and 35236 transitions. [2018-09-14 17:19:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-14 17:19:50,646 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:19:50,647 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:19:50,647 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:19:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1134182646, now seen corresponding path program 1 times [2018-09-14 17:19:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:19:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:19:50,649 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:19:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:50,979 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:19:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:19:51,439 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:19:51,439 INFO L197 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-09-14 17:19:51,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:19:51,455 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:19:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:19:51,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:19:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-14 17:19:52,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:19:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:19:52,372 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:19:52,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 17:19:52,372 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:19:52,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:19:52,373 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:19:52,374 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:19:52,374 INFO L87 Difference]: Start difference. First operand 23714 states and 35236 transitions. Second operand 5 states. [2018-09-14 17:20:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:20:04,297 INFO L93 Difference]: Finished difference Result 75283 states and 121332 transitions. [2018-09-14 17:20:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 17:20:04,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2018-09-14 17:20:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:20:04,564 INFO L225 Difference]: With dead ends: 75283 [2018-09-14 17:20:04,564 INFO L226 Difference]: Without dead ends: 51575 [2018-09-14 17:20:04,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 539 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-14 17:20:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51575 states. [2018-09-14 17:20:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51575 to 51256. [2018-09-14 17:20:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51256 states. [2018-09-14 17:20:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51256 states to 51256 states and 74763 transitions. [2018-09-14 17:20:06,025 INFO L78 Accepts]: Start accepts. Automaton has 51256 states and 74763 transitions. Word has length 272 [2018-09-14 17:20:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:20:06,025 INFO L480 AbstractCegarLoop]: Abstraction has 51256 states and 74763 transitions. [2018-09-14 17:20:06,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:20:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51256 states and 74763 transitions. [2018-09-14 17:20:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-14 17:20:06,084 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:20:06,084 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:20:06,084 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:20:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1648378950, now seen corresponding path program 1 times [2018-09-14 17:20:06,085 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:20:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:20:06,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:20:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:20:06,086 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:20:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:20:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:20:06,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:20:06,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:20:06,427 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:20:06,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:20:06,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:20:06,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:20:06,429 INFO L87 Difference]: Start difference. First operand 51256 states and 74763 transitions. Second operand 4 states. [2018-09-14 17:20:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:20:19,845 INFO L93 Difference]: Finished difference Result 125806 states and 194150 transitions. [2018-09-14 17:20:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:20:19,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-09-14 17:20:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:20:20,190 INFO L225 Difference]: With dead ends: 125806 [2018-09-14 17:20:20,191 INFO L226 Difference]: Without dead ends: 74556 [2018-09-14 17:20:20,370 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-09-14 17:20:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74556 states. [2018-09-14 17:20:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74556 to 74520. [2018-09-14 17:20:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74520 states. [2018-09-14 17:20:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74520 states to 74520 states and 104403 transitions. [2018-09-14 17:20:22,570 INFO L78 Accepts]: Start accepts. Automaton has 74520 states and 104403 transitions. Word has length 296 [2018-09-14 17:20:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:20:22,570 INFO L480 AbstractCegarLoop]: Abstraction has 74520 states and 104403 transitions. [2018-09-14 17:20:22,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:20:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 74520 states and 104403 transitions. [2018-09-14 17:20:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-09-14 17:20:22,635 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:20:22,635 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:20:22,635 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:20:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1059127263, now seen corresponding path program 1 times [2018-09-14 17:20:22,636 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:20:22,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:20:22,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:20:22,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:20:22,638 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:20:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:20:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 132 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:20:23,068 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:20:23,068 INFO L197 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-09-14 17:20:23,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:20:23,082 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:20:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:20:23,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:20:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-14 17:20:23,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:20:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 132 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:20:24,149 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:20:24,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2018-09-14 17:20:24,150 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:20:24,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:20:24,150 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:20:24,150 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-09-14 17:20:24,151 INFO L87 Difference]: Start difference. First operand 74520 states and 104403 transitions. Second operand 5 states. [2018-09-14 17:20:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:20:33,502 INFO L93 Difference]: Finished difference Result 216980 states and 318886 transitions. [2018-09-14 17:20:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 17:20:33,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 307 [2018-09-14 17:20:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:20:34,174 INFO L225 Difference]: With dead ends: 216980 [2018-09-14 17:20:34,174 INFO L226 Difference]: Without dead ends: 142466 [2018-09-14 17:20:34,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:20:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142466 states. [2018-09-14 17:20:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142466 to 141288. [2018-09-14 17:20:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141288 states. [2018-09-14 17:20:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141288 states to 141288 states and 190062 transitions. [2018-09-14 17:20:38,295 INFO L78 Accepts]: Start accepts. Automaton has 141288 states and 190062 transitions. Word has length 307 [2018-09-14 17:20:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:20:38,296 INFO L480 AbstractCegarLoop]: Abstraction has 141288 states and 190062 transitions. [2018-09-14 17:20:38,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:20:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 141288 states and 190062 transitions. [2018-09-14 17:20:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-14 17:20:38,329 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:20:38,330 INFO L376 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, 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] [2018-09-14 17:20:38,330 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:20:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 927233162, now seen corresponding path program 1 times [2018-09-14 17:20:38,331 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:20:38,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:20:38,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:20:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:20:38,332 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:20:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:20:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:20:38,996 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:20:38,996 INFO L197 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-09-14 17:20:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:20:39,012 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:20:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:20:39,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:20:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:20:39,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:20:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:20:40,049 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:20:40,049 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:20:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:20:40,069 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:20:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:20:40,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:20:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:20:40,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:20:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:20:40,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:20:40,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-09-14 17:20:40,706 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:20:40,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:20:40,707 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:20:40,707 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-14 17:20:40,708 INFO L87 Difference]: Start difference. First operand 141288 states and 190062 transitions. Second operand 9 states. [2018-09-14 17:20:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:20:56,421 INFO L93 Difference]: Finished difference Result 303325 states and 431935 transitions. [2018-09-14 17:20:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 17:20:56,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2018-09-14 17:20:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:20:57,049 INFO L225 Difference]: With dead ends: 303325 [2018-09-14 17:20:57,049 INFO L226 Difference]: Without dead ends: 162043 [2018-09-14 17:20:57,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1359 GetRequests, 1338 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-09-14 17:20:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162043 states. [2018-09-14 17:21:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162043 to 159816. [2018-09-14 17:21:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159816 states. [2018-09-14 17:21:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159816 states to 159816 states and 203537 transitions. [2018-09-14 17:21:01,054 INFO L78 Accepts]: Start accepts. Automaton has 159816 states and 203537 transitions. Word has length 336 [2018-09-14 17:21:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:21:01,055 INFO L480 AbstractCegarLoop]: Abstraction has 159816 states and 203537 transitions. [2018-09-14 17:21:01,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:21:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 159816 states and 203537 transitions. [2018-09-14 17:21:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-09-14 17:21:01,120 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:21:01,121 INFO L376 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, 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, 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] [2018-09-14 17:21:01,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:21:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1867246521, now seen corresponding path program 1 times [2018-09-14 17:21:01,122 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:21:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:21:01,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:21:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:21:01,123 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:21:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:21:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 293 proven. 91 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-09-14 17:21:01,569 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:21:01,569 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:21:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:21:01,576 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:21:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:21:01,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:21:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 427 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-14 17:21:01,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:21:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 293 proven. 91 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-09-14 17:21:06,694 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:21:06,694 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:21:06,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:21:06,717 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:21:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:21:06,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:21:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 427 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-14 17:21:07,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:21:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 293 proven. 91 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-09-14 17:21:07,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:21:07,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-14 17:21:07,393 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:21:07,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:21:07,395 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:21:07,396 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-09-14 17:21:07,397 INFO L87 Difference]: Start difference. First operand 159816 states and 203537 transitions. Second operand 9 states. [2018-09-14 17:21:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:21:36,686 INFO L93 Difference]: Finished difference Result 344463 states and 493778 transitions. [2018-09-14 17:21:36,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-14 17:21:36,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 428 [2018-09-14 17:21:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:21:37,422 INFO L225 Difference]: With dead ends: 344463 [2018-09-14 17:21:37,422 INFO L226 Difference]: Without dead ends: 184658 [2018-09-14 17:21:37,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1798 GetRequests, 1742 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=570, Invalid=2510, Unknown=0, NotChecked=0, Total=3080 [2018-09-14 17:21:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184658 states. [2018-09-14 17:21:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184658 to 177442. [2018-09-14 17:21:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177442 states. [2018-09-14 17:21:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177442 states to 177442 states and 246707 transitions. [2018-09-14 17:21:42,163 INFO L78 Accepts]: Start accepts. Automaton has 177442 states and 246707 transitions. Word has length 428 [2018-09-14 17:21:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:21:42,164 INFO L480 AbstractCegarLoop]: Abstraction has 177442 states and 246707 transitions. [2018-09-14 17:21:42,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:21:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 177442 states and 246707 transitions. [2018-09-14 17:21:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-09-14 17:21:42,270 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:21:42,271 INFO L376 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:21:42,271 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:21:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash -70710774, now seen corresponding path program 1 times [2018-09-14 17:21:42,271 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:21:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:21:42,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:21:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:21:42,273 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:21:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:21:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-09-14 17:21:42,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:21:42,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:21:42,662 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:21:42,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:21:42,663 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:21:42,663 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:21:42,664 INFO L87 Difference]: Start difference. First operand 177442 states and 246707 transitions. Second operand 3 states. [2018-09-14 17:21:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:21:52,738 INFO L93 Difference]: Finished difference Result 375617 states and 537800 transitions. [2018-09-14 17:21:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:21:52,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2018-09-14 17:21:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:21:53,368 INFO L225 Difference]: With dead ends: 375617 [2018-09-14 17:21:53,368 INFO L226 Difference]: Without dead ends: 198186 [2018-09-14 17:21:53,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:21:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198186 states. [2018-09-14 17:21:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198186 to 195791. [2018-09-14 17:21:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195791 states. [2018-09-14 17:21:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195791 states to 195791 states and 264186 transitions. [2018-09-14 17:21:57,982 INFO L78 Accepts]: Start accepts. Automaton has 195791 states and 264186 transitions. Word has length 496 [2018-09-14 17:21:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:21:57,983 INFO L480 AbstractCegarLoop]: Abstraction has 195791 states and 264186 transitions. [2018-09-14 17:21:57,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:21:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 195791 states and 264186 transitions. [2018-09-14 17:21:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2018-09-14 17:21:59,376 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:21:59,377 INFO L376 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 17:21:59,377 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:21:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1007807320, now seen corresponding path program 1 times [2018-09-14 17:21:59,378 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:21:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:21:59,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:21:59,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:21:59,379 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:21:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:22:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 132 proven. 270 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:22:00,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:22:00,765 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:22:00,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:22:00,773 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:22:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:22:00,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:22:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-14 17:22:06,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:22:06,798 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-09-14 17:22:07,110 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-14 17:22:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 132 proven. 270 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:22:09,430 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:22:09,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 17:22:09,431 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:22:09,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:22:09,433 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:22:09,434 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:22:09,434 INFO L87 Difference]: Start difference. First operand 195791 states and 264186 transitions. Second operand 5 states. [2018-09-14 17:22:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:22:21,346 INFO L93 Difference]: Finished difference Result 387545 states and 506066 transitions. [2018-09-14 17:22:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:22:21,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 826 [2018-09-14 17:22:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-09-14 17:22:22,695 INFO L225 Difference]: With dead ends: 387545 [2018-09-14 17:22:22,695 INFO L226 Difference]: Without dead ends: 188926 [2018-09-14 17:22:23,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1661 GetRequests, 1648 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-14 17:22:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188926 states. [2018-09-14 17:22:23,171 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 17:22:23,175 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 17:22:23,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 05:22:23 BoogieIcfgContainer [2018-09-14 17:22:23,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 17:22:23,176 INFO L168 Benchmark]: Toolchain (without parser) took 221726.20 ms. Allocated memory was 1.5 GB in the beginning and 5.4 GB in the end (delta: 3.9 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-14 17:22:23,177 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-09-14 17:22:23,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2309.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-09-14 17:22:23,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 924.75 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 126.9 MB. Max. memory is 7.1 GB. [2018-09-14 17:22:23,179 INFO L168 Benchmark]: Boogie Preprocessor took 416.80 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2018-09-14 17:22:23,180 INFO L168 Benchmark]: RCFGBuilder took 10243.09 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 655.2 MB). Peak memory consumption was 655.2 MB. Max. memory is 7.1 GB. [2018-09-14 17:22:23,181 INFO L168 Benchmark]: TraceAbstraction took 207822.99 ms. Allocated memory was 2.4 GB in the beginning and 5.4 GB in the end (delta: 3.0 GB). Free memory was 1.6 GB in the beginning and 3.9 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-09-14 17:22:23,185 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 2309.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 924.75 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 126.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 416.80 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10243.09 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 655.2 MB). Peak memory consumption was 655.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207822.99 ms. Allocated memory was 2.4 GB in the beginning and 5.4 GB in the end (delta: 3.0 GB). Free memory was 1.6 GB in the beginning and 3.9 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 210]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 210). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 207.7s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 157.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4874 SDtfs, 34637 SDslu, 2490 SDs, 0 SdLazy, 74537 SolverSat, 15896 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 111.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6515 GetRequests, 6366 SyntacticMatches, 13 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195791occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 13597 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 6917 NumberOfCodeBlocks, 6917 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 10061 ConstructedInterpolants, 0 QuantifiedInterpolants, 26673952 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4987 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 6240/7505 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem12_label09_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_17-22-23-204.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem12_label09_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_17-22-23-204.csv Completed graceful shutdown