java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:24:03,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:24:03,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:24:03,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:24:03,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:24:03,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:24:03,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:24:03,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:24:03,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:24:03,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:24:03,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:24:03,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:24:03,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:24:03,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:24:03,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:24:03,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:24:03,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:24:03,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:24:03,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:24:03,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:24:03,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:24:03,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:24:03,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:24:03,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:24:03,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:24:03,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:24:03,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:24:03,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:24:03,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:24:03,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:24:03,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:24:03,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:24:03,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:24:03,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:24:03,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:24:03,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:24:03,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:24:03,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:24:03,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:24:03,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:24:03,464 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:24:03,465 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:24:03,466 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:24:03,466 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:24:03,466 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:24:03,466 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:24:03,466 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:24:03,467 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:24:03,467 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:24:03,467 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:24:03,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:24:03,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:24:03,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:24:03,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:24:03,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:24:03,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:24:03,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:24:03,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:24:03,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:24:03,470 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:24:03,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:24:03,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:24:03,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:24:03,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:24:03,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:24:03,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:24:03,473 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:24:03,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:24:03,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:24:03,474 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:24:03,474 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:24:03,474 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:24:03,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:24:03,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:24:03,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:24:03,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:24:03,552 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:24:03,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label59_true-unreach-call.c [2018-11-07 20:24:03,619 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9d85d56/3f8fdaee92894cc5ab57d3e652268f30/FLAG0c424a061 [2018-11-07 20:24:04,403 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:24:04,404 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label59_true-unreach-call.c [2018-11-07 20:24:04,436 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9d85d56/3f8fdaee92894cc5ab57d3e652268f30/FLAG0c424a061 [2018-11-07 20:24:04,453 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9d85d56/3f8fdaee92894cc5ab57d3e652268f30 [2018-11-07 20:24:04,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:24:04,468 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:24:04,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:24:04,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:24:04,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:24:04,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:04" (1/1) ... [2018-11-07 20:24:04,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a12b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04, skipping insertion in model container [2018-11-07 20:24:04,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:04" (1/1) ... [2018-11-07 20:24:04,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:24:04,672 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:24:05,893 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:24:05,900 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:24:06,505 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:24:06,541 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:24:06,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06 WrapperNode [2018-11-07 20:24:06,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:24:06,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:24:06,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:24:06,543 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:24:06,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:06,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:06,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:24:06,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:24:06,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:24:06,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:24:06,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:06,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:06,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:06,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:07,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:07,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:07,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... [2018-11-07 20:24:07,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:24:07,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:24:07,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:24:07,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:24:07,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:24:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:24:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:24:07,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:24:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 20:24:07,188 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 20:24:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 20:24:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 20:24:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:24:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:24:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:24:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:24:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:24:07,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:24:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:24:07,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:24:16,004 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:24:16,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:16 BoogieIcfgContainer [2018-11-07 20:24:16,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:24:16,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:24:16,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:24:16,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:24:16,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:24:04" (1/3) ... [2018-11-07 20:24:16,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1027fac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:16, skipping insertion in model container [2018-11-07 20:24:16,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:06" (2/3) ... [2018-11-07 20:24:16,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1027fac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:16, skipping insertion in model container [2018-11-07 20:24:16,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:16" (3/3) ... [2018-11-07 20:24:16,013 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label59_true-unreach-call.c [2018-11-07 20:24:16,024 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:24:16,033 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:24:16,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:24:16,100 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:24:16,100 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:24:16,101 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:24:16,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:24:16,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:24:16,101 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:24:16,101 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:24:16,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:24:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-11-07 20:24:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 20:24:16,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:24:16,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:24:16,172 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:24:16,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash -320389013, now seen corresponding path program 1 times [2018-11-07 20:24:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:24:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:16,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:16,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:24:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:24:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:24:16,842 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:24:16,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:24:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:24:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:24:16,870 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-11-07 20:24:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:24:24,858 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-11-07 20:24:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:24:24,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-07 20:24:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:24:24,895 INFO L225 Difference]: With dead ends: 2446 [2018-11-07 20:24:24,896 INFO L226 Difference]: Without dead ends: 1604 [2018-11-07 20:24:24,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-07 20:24:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-11-07 20:24:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-11-07 20:24:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-07 20:24:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3014 transitions. [2018-11-07 20:24:25,088 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3014 transitions. Word has length 51 [2018-11-07 20:24:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:24:25,089 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 3014 transitions. [2018-11-07 20:24:25,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:24:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3014 transitions. [2018-11-07 20:24:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 20:24:25,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:24:25,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:24:25,104 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:24:25,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -66311172, now seen corresponding path program 1 times [2018-11-07 20:24:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:24:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:25,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:25,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:24:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:25,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:24:25,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:24:25,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:24:25,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:24:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:24:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:24:25,429 INFO L87 Difference]: Start difference. First operand 1604 states and 3014 transitions. Second operand 5 states. [2018-11-07 20:24:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:24:36,823 INFO L93 Difference]: Finished difference Result 4873 states and 9168 transitions. [2018-11-07 20:24:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 20:24:36,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-07 20:24:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:24:36,855 INFO L225 Difference]: With dead ends: 4873 [2018-11-07 20:24:36,856 INFO L226 Difference]: Without dead ends: 3275 [2018-11-07 20:24:36,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:24:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-11-07 20:24:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-11-07 20:24:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-11-07 20:24:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5443 transitions. [2018-11-07 20:24:36,993 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5443 transitions. Word has length 121 [2018-11-07 20:24:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:24:36,993 INFO L480 AbstractCegarLoop]: Abstraction has 3241 states and 5443 transitions. [2018-11-07 20:24:36,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:24:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5443 transitions. [2018-11-07 20:24:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 20:24:36,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:24:36,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:24:36,998 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:24:36,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:36,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1119739496, now seen corresponding path program 1 times [2018-11-07 20:24:36,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:24:36,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:36,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:37,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:24:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:37,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:24:37,305 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:24:37,306 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-11-07 20:24:37,308 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2175], [2177], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:24:37,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:24:37,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:24:38,125 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:24:38,127 INFO L272 AbstractInterpreter]: Visited 84 different actions 160 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:24:38,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:38,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:24:38,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:24:38,176 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:24:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:38,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:24:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:38,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:24:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:38,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:24:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:38,894 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:24:38,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-07 20:24:38,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:24:38,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:24:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:24:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:24:38,897 INFO L87 Difference]: Start difference. First operand 3241 states and 5443 transitions. Second operand 3 states. [2018-11-07 20:24:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:24:45,359 INFO L93 Difference]: Finished difference Result 9583 states and 16414 transitions. [2018-11-07 20:24:45,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:24:45,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-11-07 20:24:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:24:45,415 INFO L225 Difference]: With dead ends: 9583 [2018-11-07 20:24:45,415 INFO L226 Difference]: Without dead ends: 6348 [2018-11-07 20:24:45,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:24:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6348 states. [2018-11-07 20:24:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6348 to 6348. [2018-11-07 20:24:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6348 states. [2018-11-07 20:24:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6348 states to 6348 states and 9511 transitions. [2018-11-07 20:24:45,629 INFO L78 Accepts]: Start accepts. Automaton has 6348 states and 9511 transitions. Word has length 127 [2018-11-07 20:24:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:24:45,630 INFO L480 AbstractCegarLoop]: Abstraction has 6348 states and 9511 transitions. [2018-11-07 20:24:45,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:24:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6348 states and 9511 transitions. [2018-11-07 20:24:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 20:24:45,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:24:45,634 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:24:45,636 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:24:45,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1996073879, now seen corresponding path program 1 times [2018-11-07 20:24:45,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:24:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:45,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:24:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:45,931 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:24:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:46,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:24:46,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:24:46,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:24:46,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:24:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:24:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:24:46,341 INFO L87 Difference]: Start difference. First operand 6348 states and 9511 transitions. Second operand 6 states. [2018-11-07 20:24:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:24:55,282 INFO L93 Difference]: Finished difference Result 15974 states and 23466 transitions. [2018-11-07 20:24:55,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:24:55,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-11-07 20:24:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:24:55,327 INFO L225 Difference]: With dead ends: 15974 [2018-11-07 20:24:55,327 INFO L226 Difference]: Without dead ends: 9632 [2018-11-07 20:24:55,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:24:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2018-11-07 20:24:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 9612. [2018-11-07 20:24:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9612 states. [2018-11-07 20:24:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9612 states to 9612 states and 13079 transitions. [2018-11-07 20:24:55,603 INFO L78 Accepts]: Start accepts. Automaton has 9612 states and 13079 transitions. Word has length 136 [2018-11-07 20:24:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:24:55,603 INFO L480 AbstractCegarLoop]: Abstraction has 9612 states and 13079 transitions. [2018-11-07 20:24:55,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:24:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 9612 states and 13079 transitions. [2018-11-07 20:24:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 20:24:55,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:24:55,607 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:24:55,607 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:24:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:24:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 977865397, now seen corresponding path program 1 times [2018-11-07 20:24:55,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:24:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:55,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:24:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:24:55,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:24:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:24:55,872 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:24:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:24:56,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:24:56,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:24:56,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:24:56,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:24:56,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:24:56,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:24:56,193 INFO L87 Difference]: Start difference. First operand 9612 states and 13079 transitions. Second operand 6 states. [2018-11-07 20:25:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:25:06,160 INFO L93 Difference]: Finished difference Result 26236 states and 36786 transitions. [2018-11-07 20:25:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:25:06,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-07 20:25:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:25:06,224 INFO L225 Difference]: With dead ends: 26236 [2018-11-07 20:25:06,224 INFO L226 Difference]: Without dead ends: 16630 [2018-11-07 20:25:06,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:25:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16630 states. [2018-11-07 20:25:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16630 to 16385. [2018-11-07 20:25:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16385 states. [2018-11-07 20:25:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16385 states to 16385 states and 21996 transitions. [2018-11-07 20:25:06,765 INFO L78 Accepts]: Start accepts. Automaton has 16385 states and 21996 transitions. Word has length 158 [2018-11-07 20:25:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:25:06,766 INFO L480 AbstractCegarLoop]: Abstraction has 16385 states and 21996 transitions. [2018-11-07 20:25:06,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:25:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16385 states and 21996 transitions. [2018-11-07 20:25:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 20:25:06,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:25:06,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:25:06,773 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:25:06,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:25:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1902407537, now seen corresponding path program 1 times [2018-11-07 20:25:06,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:25:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:06,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:25:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:06,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:25:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:25:07,080 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:25:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:25:07,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:25:07,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:25:07,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:25:07,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:25:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:25:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:25:07,205 INFO L87 Difference]: Start difference. First operand 16385 states and 21996 transitions. Second operand 6 states. [2018-11-07 20:25:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:25:17,198 INFO L93 Difference]: Finished difference Result 43155 states and 61960 transitions. [2018-11-07 20:25:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:25:17,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-07 20:25:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:25:17,561 INFO L225 Difference]: With dead ends: 43155 [2018-11-07 20:25:17,561 INFO L226 Difference]: Without dead ends: 26776 [2018-11-07 20:25:17,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:25:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2018-11-07 20:25:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 26469. [2018-11-07 20:25:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26469 states. [2018-11-07 20:25:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26469 states to 26469 states and 35507 transitions. [2018-11-07 20:25:18,150 INFO L78 Accepts]: Start accepts. Automaton has 26469 states and 35507 transitions. Word has length 172 [2018-11-07 20:25:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:25:18,150 INFO L480 AbstractCegarLoop]: Abstraction has 26469 states and 35507 transitions. [2018-11-07 20:25:18,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:25:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26469 states and 35507 transitions. [2018-11-07 20:25:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 20:25:18,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:25:18,156 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:25:18,156 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:25:18,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:25:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1379065187, now seen corresponding path program 1 times [2018-11-07 20:25:18,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:25:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:18,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:25:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:18,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:25:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:25:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:25:18,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:25:18,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:25:18,708 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:25:18,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:25:18,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:25:18,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:25:18,709 INFO L87 Difference]: Start difference. First operand 26469 states and 35507 transitions. Second operand 6 states. [2018-11-07 20:25:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:25:30,870 INFO L93 Difference]: Finished difference Result 103824 states and 153822 transitions. [2018-11-07 20:25:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:25:30,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-07 20:25:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:25:31,193 INFO L225 Difference]: With dead ends: 103824 [2018-11-07 20:25:31,193 INFO L226 Difference]: Without dead ends: 77361 [2018-11-07 20:25:31,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:25:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77361 states. [2018-11-07 20:25:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77361 to 77210. [2018-11-07 20:25:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77210 states. [2018-11-07 20:25:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77210 states to 77210 states and 105839 transitions. [2018-11-07 20:25:32,908 INFO L78 Accepts]: Start accepts. Automaton has 77210 states and 105839 transitions. Word has length 178 [2018-11-07 20:25:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:25:32,909 INFO L480 AbstractCegarLoop]: Abstraction has 77210 states and 105839 transitions. [2018-11-07 20:25:32,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:25:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 77210 states and 105839 transitions. [2018-11-07 20:25:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 20:25:32,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:25:32,913 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:25:32,913 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:25:32,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:25:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 73089436, now seen corresponding path program 1 times [2018-11-07 20:25:32,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:25:32,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:32,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:25:32,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:32,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:25:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:25:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:25:33,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:25:33,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:25:33,169 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-07 20:25:33,169 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2175], [2177], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2680], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:25:33,180 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:25:33,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:25:33,499 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:25:34,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:25:34,833 INFO L272 AbstractInterpreter]: Visited 158 different actions 309 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:25:34,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:25:34,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:25:34,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:25:34,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:25:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:25:34,885 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:25:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:25:34,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:25:36,026 WARN L179 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 22 [2018-11-07 20:25:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:25:36,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:25:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:25:36,725 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:25:36,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-07 20:25:36,726 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:25:36,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:25:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:25:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:25:36,729 INFO L87 Difference]: Start difference. First operand 77210 states and 105839 transitions. Second operand 3 states. [2018-11-07 20:25:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:25:46,215 INFO L93 Difference]: Finished difference Result 182483 states and 255618 transitions. [2018-11-07 20:25:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:25:46,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-11-07 20:25:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:25:46,554 INFO L225 Difference]: With dead ends: 182483 [2018-11-07 20:25:46,554 INFO L226 Difference]: Without dead ends: 105279 [2018-11-07 20:25:47,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:25:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105279 states. [2018-11-07 20:25:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105279 to 105183. [2018-11-07 20:25:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105183 states. [2018-11-07 20:25:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105183 states to 105183 states and 141337 transitions. [2018-11-07 20:25:49,058 INFO L78 Accepts]: Start accepts. Automaton has 105183 states and 141337 transitions. Word has length 201 [2018-11-07 20:25:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:25:49,059 INFO L480 AbstractCegarLoop]: Abstraction has 105183 states and 141337 transitions. [2018-11-07 20:25:49,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:25:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 105183 states and 141337 transitions. [2018-11-07 20:25:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 20:25:49,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:25:49,066 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:25:49,067 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:25:49,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:25:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash 733180128, now seen corresponding path program 1 times [2018-11-07 20:25:49,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:25:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:49,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:25:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:25:49,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:25:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:25:49,339 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:25:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:25:49,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:25:49,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:25:49,530 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:25:49,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:25:49,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:25:49,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:25:49,532 INFO L87 Difference]: Start difference. First operand 105183 states and 141337 transitions. Second operand 6 states. [2018-11-07 20:25:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:25:58,225 INFO L93 Difference]: Finished difference Result 254877 states and 367625 transitions. [2018-11-07 20:25:58,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:25:58,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-11-07 20:25:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:25:58,917 INFO L225 Difference]: With dead ends: 254877 [2018-11-07 20:25:58,917 INFO L226 Difference]: Without dead ends: 149700 [2018-11-07 20:25:59,142 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-11-07 20:25:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149700 states. [2018-11-07 20:26:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149700 to 149283. [2018-11-07 20:26:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149283 states. [2018-11-07 20:26:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149283 states to 149283 states and 205485 transitions. [2018-11-07 20:26:03,018 INFO L78 Accepts]: Start accepts. Automaton has 149283 states and 205485 transitions. Word has length 219 [2018-11-07 20:26:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:26:03,018 INFO L480 AbstractCegarLoop]: Abstraction has 149283 states and 205485 transitions. [2018-11-07 20:26:03,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:26:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 149283 states and 205485 transitions. [2018-11-07 20:26:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 20:26:03,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:26:03,025 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:26:03,025 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:26:03,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:26:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -88101080, now seen corresponding path program 1 times [2018-11-07 20:26:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:26:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:26:03,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:26:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:26:03,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:26:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:26:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:26:03,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:26:03,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:26:03,553 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-07 20:26:03,554 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2175], [2177], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2540], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:26:03,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:26:03,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:26:03,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:26:03,956 INFO L272 AbstractInterpreter]: Visited 124 different actions 240 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:26:03,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:26:03,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:26:03,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:26:03,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:26:04,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:26:04,007 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:26:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:26:04,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:26:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:26:04,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:26:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:26:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:26:04,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 20:26:04,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:26:04,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 20:26:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 20:26:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:26:04,399 INFO L87 Difference]: Start difference. First operand 149283 states and 205485 transitions. Second operand 9 states. [2018-11-07 20:26:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:26:27,398 INFO L93 Difference]: Finished difference Result 440195 states and 823829 transitions. [2018-11-07 20:26:27,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 20:26:27,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2018-11-07 20:26:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:26:36,033 INFO L225 Difference]: With dead ends: 440195 [2018-11-07 20:26:36,034 INFO L226 Difference]: Without dead ends: 239666 [2018-11-07 20:26:36,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 489 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2018-11-07 20:26:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239666 states. [2018-11-07 20:26:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239666 to 231846. [2018-11-07 20:26:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231846 states. [2018-11-07 20:26:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231846 states to 231846 states and 337000 transitions. [2018-11-07 20:26:43,569 INFO L78 Accepts]: Start accepts. Automaton has 231846 states and 337000 transitions. Word has length 242 [2018-11-07 20:26:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:26:43,570 INFO L480 AbstractCegarLoop]: Abstraction has 231846 states and 337000 transitions. [2018-11-07 20:26:43,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 20:26:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 231846 states and 337000 transitions. [2018-11-07 20:26:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-07 20:26:43,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:26:43,575 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:26:43,575 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:26:43,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:26:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1044267349, now seen corresponding path program 1 times [2018-11-07 20:26:43,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:26:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:26:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:26:43,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:26:43,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:26:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:26:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:26:43,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:26:43,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:26:43,865 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-11-07 20:26:43,866 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2175], [2177], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2420], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2676], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:26:43,871 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:26:43,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:26:44,043 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:26:44,044 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:26:44,044 INFO L272 AbstractInterpreter]: Visited 154 different actions 154 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 20:26:44,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:26:44,082 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:26:44,566 INFO L227 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 75.43% of their original sizes. [2018-11-07 20:26:44,567 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:26:44,774 INFO L415 sIntCurrentIteration]: We unified 284 AI predicates to 284 [2018-11-07 20:26:44,774 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:26:44,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:26:44,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-07 20:26:44,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:26:44,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 20:26:44,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 20:26:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:26:44,777 INFO L87 Difference]: Start difference. First operand 231846 states and 337000 transitions. Second operand 9 states. Received shutdown request... [2018-11-07 20:27:33,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 20:27:33,156 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:27:33,162 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:27:33,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:27:33 BoogieIcfgContainer [2018-11-07 20:27:33,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:27:33,163 INFO L168 Benchmark]: Toolchain (without parser) took 208696.26 ms. Allocated memory was 1.5 GB in the beginning and 5.3 GB in the end (delta: 3.7 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 20:27:33,164 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:27:33,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2072.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:27:33,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 348.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:27:33,166 INFO L168 Benchmark]: Boogie Preprocessor took 228.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:27:33,167 INFO L168 Benchmark]: RCFGBuilder took 8885.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 661.5 MB). Peak memory consumption was 661.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:27:33,168 INFO L168 Benchmark]: TraceAbstraction took 197155.97 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 2.9 GB). Free memory was 1.6 GB in the beginning and 2.1 GB in the end (delta: -540.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:27:33,174 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2072.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 348.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 228.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8885.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 661.5 MB). Peak memory consumption was 661.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197155.97 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 2.9 GB). Free memory was 1.6 GB in the beginning and 2.1 GB in the end (delta: -540.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 144). Cancelled while BasicCegarLoop was constructing difference of abstraction (231846states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (181326 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 197.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 168.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4907 SDtfs, 30526 SDslu, 2118 SDs, 0 SdLazy, 60957 SolverSat, 11726 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 96.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1531 GetRequests, 1441 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231846occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.99818782590139 AbsIntWeakeningRatio, 0.09507042253521127 AbsIntAvgWeakeningVarsNumRemoved, 19.573943661971832 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 9090 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2460 NumberOfCodeBlocks, 2460 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3013 ConstructedInterpolants, 47 QuantifiedInterpolants, 2274784 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1111 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 1125/1193 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown