java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label54_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 07:39:15,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 07:39:15,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 07:39:15,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 07:39:15,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 07:39:15,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 07:39:15,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 07:39:15,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 07:39:15,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 07:39:15,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 07:39:15,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 07:39:15,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 07:39:15,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 07:39:15,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 07:39:15,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 07:39:15,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 07:39:15,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 07:39:15,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 07:39:15,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 07:39:15,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 07:39:15,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 07:39:15,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 07:39:15,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 07:39:15,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 07:39:15,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 07:39:15,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 07:39:15,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 07:39:15,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 07:39:15,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 07:39:15,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 07:39:15,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 07:39:15,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 07:39:15,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 07:39:15,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 07:39:15,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 07:39:15,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 07:39:15,075 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 07:39:15,090 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 07:39:15,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 07:39:15,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 07:39:15,091 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 07:39:15,091 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 07:39:15,091 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 07:39:15,091 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 07:39:15,092 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 07:39:15,092 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 07:39:15,092 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 07:39:15,092 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 07:39:15,092 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 07:39:15,093 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 07:39:15,093 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 07:39:15,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 07:39:15,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 07:39:15,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 07:39:15,094 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 07:39:15,094 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 07:39:15,094 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 07:39:15,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 07:39:15,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 07:39:15,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 07:39:15,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 07:39:15,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 07:39:15,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 07:39:15,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 07:39:15,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 07:39:15,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 07:39:15,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 07:39:15,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 07:39:15,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 07:39:15,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 07:39:15,097 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 07:39:15,097 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 07:39:15,098 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 07:39:15,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 07:39:15,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 07:39:15,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 07:39:15,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 07:39:15,161 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 07:39:15,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label54_true-unreach-call.c [2018-10-27 07:39:15,230 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0557e7486/0b8252217fd84cb4a61772f36534cebd/FLAGa93971b0c [2018-10-27 07:39:15,912 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 07:39:15,913 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label54_true-unreach-call.c [2018-10-27 07:39:15,944 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0557e7486/0b8252217fd84cb4a61772f36534cebd/FLAGa93971b0c [2018-10-27 07:39:15,963 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0557e7486/0b8252217fd84cb4a61772f36534cebd [2018-10-27 07:39:15,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 07:39:15,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 07:39:15,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 07:39:15,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 07:39:15,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 07:39:15,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 07:39:15" (1/1) ... [2018-10-27 07:39:15,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388121bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:15, skipping insertion in model container [2018-10-27 07:39:15,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 07:39:15" (1/1) ... [2018-10-27 07:39:16,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 07:39:16,095 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 07:39:16,737 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 07:39:16,741 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 07:39:16,931 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 07:39:16,949 INFO L193 MainTranslator]: Completed translation [2018-10-27 07:39:16,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16 WrapperNode [2018-10-27 07:39:16,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 07:39:16,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 07:39:16,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 07:39:16,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 07:39:16,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:16,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 07:39:17,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 07:39:17,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 07:39:17,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 07:39:17,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... [2018-10-27 07:39:17,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 07:39:17,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 07:39:17,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 07:39:17,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 07:39:17,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 07:39:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 07:39:17,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 07:39:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 07:39:17,473 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 07:39:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 07:39:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 07:39:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 07:39:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 07:39:22,117 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 07:39:22,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 07:39:22 BoogieIcfgContainer [2018-10-27 07:39:22,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 07:39:22,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 07:39:22,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 07:39:22,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 07:39:22,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 07:39:15" (1/3) ... [2018-10-27 07:39:22,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acb14b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 07:39:22, skipping insertion in model container [2018-10-27 07:39:22,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 07:39:16" (2/3) ... [2018-10-27 07:39:22,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acb14b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 07:39:22, skipping insertion in model container [2018-10-27 07:39:22,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 07:39:22" (3/3) ... [2018-10-27 07:39:22,126 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label54_true-unreach-call.c [2018-10-27 07:39:22,137 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 07:39:22,146 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 07:39:22,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 07:39:22,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 07:39:22,203 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 07:39:22,203 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 07:39:22,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 07:39:22,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 07:39:22,204 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 07:39:22,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 07:39:22,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 07:39:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-10-27 07:39:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 07:39:22,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:39:22,247 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] [2018-10-27 07:39:22,249 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:39:22,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:39:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash -639357604, now seen corresponding path program 1 times [2018-10-27 07:39:22,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:39:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:39:22,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:39:22,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:39:22,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:39:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:39:22,748 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-27 07:39:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 07:39:22,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 07:39:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 07:39:22,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:39:22,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 07:39:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 07:39:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 07:39:22,796 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-10-27 07:39:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:39:26,729 INFO L93 Difference]: Finished difference Result 998 states and 1780 transitions. [2018-10-27 07:39:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 07:39:26,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-27 07:39:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:39:26,755 INFO L225 Difference]: With dead ends: 998 [2018-10-27 07:39:26,756 INFO L226 Difference]: Without dead ends: 699 [2018-10-27 07:39:26,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 07:39:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-27 07:39:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 693. [2018-10-27 07:39:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-10-27 07:39:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1109 transitions. [2018-10-27 07:39:26,899 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1109 transitions. Word has length 44 [2018-10-27 07:39:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:39:26,900 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 1109 transitions. [2018-10-27 07:39:26,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 07:39:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1109 transitions. [2018-10-27 07:39:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-27 07:39:26,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:39:26,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 07:39:26,909 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:39:26,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:39:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash 731087552, now seen corresponding path program 1 times [2018-10-27 07:39:26,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:39:26,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:39:26,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:39:26,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:39:26,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:39:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:39:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 07:39:27,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 07:39:27,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 07:39:27,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:39:27,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 07:39:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 07:39:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 07:39:27,458 INFO L87 Difference]: Start difference. First operand 693 states and 1109 transitions. Second operand 7 states. [2018-10-27 07:39:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:39:35,152 INFO L93 Difference]: Finished difference Result 2550 states and 4242 transitions. [2018-10-27 07:39:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 07:39:35,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-10-27 07:39:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:39:35,165 INFO L225 Difference]: With dead ends: 2550 [2018-10-27 07:39:35,165 INFO L226 Difference]: Without dead ends: 1863 [2018-10-27 07:39:35,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-27 07:39:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2018-10-27 07:39:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1435. [2018-10-27 07:39:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-10-27 07:39:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2153 transitions. [2018-10-27 07:39:35,258 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2153 transitions. Word has length 118 [2018-10-27 07:39:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:39:35,259 INFO L481 AbstractCegarLoop]: Abstraction has 1435 states and 2153 transitions. [2018-10-27 07:39:35,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 07:39:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2153 transitions. [2018-10-27 07:39:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-27 07:39:35,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:39:35,275 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 07:39:35,275 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:39:35,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:39:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash 162053839, now seen corresponding path program 1 times [2018-10-27 07:39:35,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:39:35,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:39:35,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:39:35,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:39:35,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:39:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:39:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 74 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 07:39:35,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:39:35,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:39:35,554 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-10-27 07:39:35,556 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:39:35,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:39:35,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:39:36,444 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 07:39:36,446 INFO L272 AbstractInterpreter]: Visited 79 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-10-27 07:39:36,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:39:36,496 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 07:39:37,534 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 73.51% of their original sizes. [2018-10-27 07:39:37,534 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 07:39:37,780 INFO L415 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-10-27 07:39:37,780 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 07:39:37,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 07:39:37,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-27 07:39:37,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:39:37,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 07:39:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 07:39:37,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 07:39:37,784 INFO L87 Difference]: Start difference. First operand 1435 states and 2153 transitions. Second operand 6 states. [2018-10-27 07:40:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:40:19,718 INFO L93 Difference]: Finished difference Result 3056 states and 4512 transitions. [2018-10-27 07:40:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 07:40:19,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2018-10-27 07:40:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:40:19,727 INFO L225 Difference]: With dead ends: 3056 [2018-10-27 07:40:19,728 INFO L226 Difference]: Without dead ends: 1627 [2018-10-27 07:40:19,732 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 07:40:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-10-27 07:40:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1625. [2018-10-27 07:40:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-27 07:40:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2352 transitions. [2018-10-27 07:40:19,779 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2352 transitions. Word has length 191 [2018-10-27 07:40:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:40:19,780 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 2352 transitions. [2018-10-27 07:40:19,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 07:40:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2352 transitions. [2018-10-27 07:40:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-27 07:40:19,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:40:19,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 07:40:19,784 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:40:19,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:40:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash -875818686, now seen corresponding path program 1 times [2018-10-27 07:40:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:40:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:40:19,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:40:19,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:40:19,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:40:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:40:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 07:40:20,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:40:20,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:40:20,083 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-10-27 07:40:20,084 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:40:20,092 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:40:20,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:40:20,340 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 07:40:20,340 INFO L272 AbstractInterpreter]: Visited 155 different actions 304 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-10-27 07:40:20,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:40:20,379 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 07:40:20,629 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 75.38% of their original sizes. [2018-10-27 07:40:20,629 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 07:40:20,938 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-10-27 07:40:20,939 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 07:40:20,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 07:40:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-27 07:40:20,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:40:20,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 07:40:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 07:40:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 07:40:20,941 INFO L87 Difference]: Start difference. First operand 1625 states and 2352 transitions. Second operand 10 states. [2018-10-27 07:42:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:42:23,985 INFO L93 Difference]: Finished difference Result 4216 states and 6440 transitions. [2018-10-27 07:42:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 07:42:23,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 192 [2018-10-27 07:42:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:42:23,999 INFO L225 Difference]: With dead ends: 4216 [2018-10-27 07:42:24,000 INFO L226 Difference]: Without dead ends: 2787 [2018-10-27 07:42:24,007 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-27 07:42:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2018-10-27 07:42:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2776. [2018-10-27 07:42:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2776 states. [2018-10-27 07:42:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3704 transitions. [2018-10-27 07:42:24,076 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3704 transitions. Word has length 192 [2018-10-27 07:42:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:42:24,077 INFO L481 AbstractCegarLoop]: Abstraction has 2776 states and 3704 transitions. [2018-10-27 07:42:24,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 07:42:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3704 transitions. [2018-10-27 07:42:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-27 07:42:24,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:42:24,083 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 07:42:24,083 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:42:24,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1021024169, now seen corresponding path program 1 times [2018-10-27 07:42:24,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:42:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:24,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:24,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:24,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:42:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 07:42:24,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:24,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:42:24,494 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-10-27 07:42:24,495 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:42:24,500 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:42:24,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:42:25,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 07:42:25,047 INFO L272 AbstractInterpreter]: Visited 126 different actions 375 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-10-27 07:42:25,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:25,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 07:42:25,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:25,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 07:42:25,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:25,068 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 07:42:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:25,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 07:42:27,479 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (and (not (= 0 (mod (+ .cse0 30) 90))) (<= 0 (+ .cse0 58979)) (< (+ .cse0 58980) 0) (<= c_~a23~0 (+ (mod (+ .cse0 29) 90) 48)) (= (mod .cse1 10) 0) (<= |c_old(~a23~0)| v_prenex_4))))) (exists ((v_prenex_15 Int)) (let ((.cse4 (* 9 v_prenex_15))) (let ((.cse3 (div .cse4 10))) (let ((.cse2 (mod (+ .cse3 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_15) (= .cse2 0) (= 0 (mod (+ .cse3 30) 90)) (<= c_~a23~0 (+ .cse2 48)) (= (mod .cse4 10) 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse5 (* 9 v_prenex_1))) (let ((.cse6 (div .cse5 10))) (let ((.cse7 (mod (+ .cse6 29) 90))) (and (<= 0 .cse5) (< (+ .cse6 58979) 0) (<= (+ c_~a23~0 42) .cse7) (<= 0 (+ .cse6 58980)) (not (= .cse7 0)) (<= |c_old(~a23~0)| v_prenex_1)))))) (exists ((v_prenex_23 Int)) (let ((.cse9 (* 9 v_prenex_23))) (let ((.cse8 (div .cse9 10))) (and (<= |c_old(~a23~0)| v_prenex_23) (<= c_~a23~0 (+ (mod (+ .cse8 30) 90) 48)) (< .cse9 0) (not (= (mod .cse9 10) 0)) (= (mod (+ .cse8 29) 90) 0) (<= 0 (+ .cse8 58980)))))) (exists ((v_prenex_8 Int)) (let ((.cse10 (* 9 v_prenex_8))) (let ((.cse11 (div .cse10 10))) (and (<= 0 .cse10) (<= 0 (+ .cse11 58979)) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ (mod (+ .cse11 29) 90) 48)) (= 0 (mod (+ .cse11 30) 90)))))) (exists ((v_prenex_16 Int)) (let ((.cse14 (* 9 v_prenex_16))) (let ((.cse13 (div .cse14 10))) (let ((.cse12 (mod (+ .cse13 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_16) (<= (+ c_~a23~0 42) .cse12) (< (+ .cse13 58979) 0) (not (= .cse12 0)) (= 0 (mod (+ .cse13 30) 90)) (<= 0 .cse14)))))) (exists ((v_prenex_14 Int)) (let ((.cse17 (* 9 v_prenex_14))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod (+ .cse16 29) 90))) (and (= .cse15 0) (<= |c_old(~a23~0)| v_prenex_14) (<= c_~a23~0 (+ .cse15 48)) (< (+ .cse16 58980) 0) (not (= 0 (mod (+ .cse16 30) 90))) (<= 0 .cse17)))))) (exists ((v_prenex_7 Int)) (let ((.cse18 (* 9 v_prenex_7))) (let ((.cse19 (div .cse18 10))) (and (<= 0 .cse18) (<= 0 (+ .cse19 58979)) (<= c_~a23~0 (+ (mod (+ .cse19 29) 90) 48)) (<= |c_old(~a23~0)| v_prenex_7) (not (= 0 (mod (+ .cse19 30) 90))) (< (+ .cse19 58980) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse20 (* 9 v_prenex_3))) (let ((.cse22 (div .cse20 10))) (let ((.cse21 (mod (+ .cse22 29) 90))) (and (= (mod .cse20 10) 0) (<= (+ c_~a23~0 42) .cse21) (not (= .cse21 0)) (<= |c_old(~a23~0)| v_prenex_3) (= 0 (mod (+ .cse22 30) 90)) (< (+ .cse22 58979) 0)))))) (exists ((v_prenex_24 Int)) (let ((.cse24 (* 9 v_prenex_24))) (let ((.cse23 (div .cse24 10))) (let ((.cse25 (mod (+ .cse23 30) 90))) (and (not (= (mod (+ .cse23 29) 90) 0)) (<= |c_old(~a23~0)| v_prenex_24) (not (= (mod .cse24 10) 0)) (< (+ .cse23 58979) 0) (< (+ .cse23 58980) 0) (<= (+ c_~a23~0 42) .cse25) (< .cse24 0) (not (= 0 .cse25))))))) (exists ((v_prenex_2 Int)) (let ((.cse27 (* 9 v_prenex_2))) (let ((.cse28 (div .cse27 10))) (let ((.cse26 (mod (+ .cse28 29) 90))) (and (<= c_~a23~0 (+ .cse26 48)) (<= |c_old(~a23~0)| v_prenex_2) (<= 0 .cse27) (= .cse26 0) (= 0 (mod (+ .cse28 30) 90))))))) (exists ((v_prenex_6 Int)) (let ((.cse30 (* 9 v_prenex_6))) (let ((.cse29 (div .cse30 10))) (let ((.cse31 (mod (+ .cse29 30) 90))) (and (< (+ .cse29 58979) 0) (not (= (mod (+ .cse29 29) 90) 0)) (< .cse30 0) (not (= (mod .cse30 10) 0)) (= 0 .cse31) (<= c_~a23~0 (+ .cse31 48)) (<= |c_old(~a23~0)| v_prenex_6)))))) (exists ((v_prenex_17 Int)) (let ((.cse32 (* 9 v_prenex_17))) (let ((.cse34 (div .cse32 10))) (let ((.cse33 (mod (+ .cse34 30) 90))) (and (< .cse32 0) (= 0 .cse33) (<= |c_old(~a23~0)| v_prenex_17) (<= c_~a23~0 (+ .cse33 48)) (= (mod (+ .cse34 29) 90) 0) (not (= (mod .cse32 10) 0))))))) (exists ((v_prenex_20 Int)) (let ((.cse35 (* 9 v_prenex_20))) (let ((.cse36 (div .cse35 10))) (and (not (= (mod .cse35 10) 0)) (<= c_~a23~0 (+ (mod (+ .cse36 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_20) (<= 0 (+ .cse36 58979)) (<= 0 (+ .cse36 58980)) (< .cse35 0))))) (exists ((v_prenex_22 Int)) (let ((.cse39 (* 9 v_prenex_22))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (mod (+ .cse38 29) 90))) (and (<= (+ c_~a23~0 42) .cse37) (<= |c_old(~a23~0)| v_prenex_22) (not (= 0 (mod (+ .cse38 30) 90))) (< (+ .cse38 58980) 0) (not (= .cse37 0)) (= (mod .cse39 10) 0) (< (+ .cse38 58979) 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse40 (* 9 v_prenex_10))) (let ((.cse41 (div .cse40 10))) (and (< .cse40 0) (not (= (mod (+ .cse41 29) 90) 0)) (not (= (mod .cse40 10) 0)) (< (+ .cse41 58979) 0) (<= c_~a23~0 (+ (mod (+ .cse41 30) 90) 48)) (<= 0 (+ .cse41 58980)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_26 Int)) (let ((.cse43 (* 9 v_prenex_26))) (let ((.cse42 (div .cse43 10))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse42 58980)) (<= 0 (+ .cse42 58979)) (<= c_~a23~0 (+ (mod (+ .cse42 29) 90) 48)) (<= 0 .cse43))))) (exists ((v_prenex_19 Int)) (let ((.cse46 (* 9 v_prenex_19))) (let ((.cse44 (div .cse46 10))) (let ((.cse45 (mod (+ .cse44 29) 90))) (and (<= 0 (+ .cse44 58980)) (< (+ .cse44 58979) 0) (<= (+ c_~a23~0 42) .cse45) (= (mod .cse46 10) 0) (not (= .cse45 0)) (<= |c_old(~a23~0)| v_prenex_19)))))) (exists ((v_prenex_13 Int)) (let ((.cse49 (* 9 v_prenex_13))) (let ((.cse48 (div .cse49 10))) (let ((.cse47 (mod (+ .cse48 29) 90))) (and (= .cse47 0) (<= c_~a23~0 (+ .cse47 48)) (<= |c_old(~a23~0)| v_prenex_13) (<= 0 (+ .cse48 58980)) (<= 0 .cse49)))))) (exists ((v_prenex_9 Int)) (let ((.cse51 (* 9 v_prenex_9))) (let ((.cse50 (div .cse51 10))) (and (<= |c_old(~a23~0)| v_prenex_9) (= 0 (mod (+ .cse50 30) 90)) (<= c_~a23~0 (+ (mod (+ .cse50 29) 90) 48)) (<= 0 (+ .cse50 58979)) (= (mod .cse51 10) 0))))) (exists ((v_prenex_25 Int)) (let ((.cse53 (* 9 v_prenex_25))) (let ((.cse54 (div .cse53 10))) (let ((.cse52 (mod (+ .cse54 29) 90))) (and (= .cse52 0) (= (mod .cse53 10) 0) (<= |c_old(~a23~0)| v_prenex_25) (<= c_~a23~0 (+ .cse52 48)) (not (= 0 (mod (+ .cse54 30) 90))) (< (+ .cse54 58980) 0)))))) (exists ((v_prenex_12 Int)) (let ((.cse56 (* 9 v_prenex_12))) (let ((.cse55 (div .cse56 10))) (and (<= |c_old(~a23~0)| v_prenex_12) (<= 0 (+ .cse55 58980)) (<= c_~a23~0 (+ (mod (+ .cse55 29) 90) 48)) (<= 0 (+ .cse55 58979)) (= (mod .cse56 10) 0))))) (exists ((v_prenex_18 Int)) (let ((.cse57 (* 9 v_prenex_18))) (let ((.cse59 (div .cse57 10))) (let ((.cse58 (mod (+ .cse59 29) 90))) (and (<= 0 .cse57) (not (= .cse58 0)) (< (+ .cse59 58979) 0) (< (+ .cse59 58980) 0) (not (= 0 (mod (+ .cse59 30) 90))) (<= |c_old(~a23~0)| v_prenex_18) (<= (+ c_~a23~0 42) .cse58)))))) (exists ((v_~a23~0_478 Int)) (let ((.cse60 (* 9 v_~a23~0_478))) (let ((.cse62 (div .cse60 10))) (let ((.cse61 (mod (+ .cse62 30) 90))) (and (not (= (mod .cse60 10) 0)) (<= (+ c_~a23~0 42) .cse61) (not (= 0 .cse61)) (< (+ .cse62 58980) 0) (<= 0 (+ .cse62 58979)) (< .cse60 0) (<= |c_old(~a23~0)| v_~a23~0_478)))))) (exists ((v_prenex_21 Int)) (let ((.cse64 (* 9 v_prenex_21))) (let ((.cse65 (div .cse64 10))) (let ((.cse63 (mod (+ .cse65 29) 90))) (and (= .cse63 0) (<= |c_old(~a23~0)| v_prenex_21) (= (mod .cse64 10) 0) (<= c_~a23~0 (+ .cse63 48)) (<= 0 (+ .cse65 58980))))))) (exists ((v_prenex_11 Int)) (let ((.cse68 (* 9 v_prenex_11))) (let ((.cse66 (div .cse68 10))) (let ((.cse67 (mod (+ .cse66 30) 90))) (and (<= 0 (+ .cse66 58979)) (<= c_~a23~0 (+ .cse67 48)) (<= |c_old(~a23~0)| v_prenex_11) (< .cse68 0) (= 0 .cse67) (not (= (mod .cse68 10) 0))))))) (exists ((v_prenex_5 Int)) (let ((.cse71 (* 9 v_prenex_5))) (let ((.cse69 (div .cse71 10))) (let ((.cse70 (mod (+ .cse69 30) 90))) (and (= (mod (+ .cse69 29) 90) 0) (not (= 0 .cse70)) (< (+ .cse69 58980) 0) (<= (+ c_~a23~0 42) .cse70) (not (= (mod .cse71 10) 0)) (<= |c_old(~a23~0)| v_prenex_5) (< .cse71 0))))))) is different from true [2018-10-27 07:42:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 71 trivial. 2 not checked. [2018-10-27 07:42:28,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 07:42:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 07:42:28,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 07:42:28,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-10-27 07:42:28,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:42:28,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 07:42:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 07:42:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-10-27 07:42:28,576 INFO L87 Difference]: Start difference. First operand 2776 states and 3704 transitions. Second operand 3 states. [2018-10-27 07:42:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:42:31,081 INFO L93 Difference]: Finished difference Result 5121 states and 7514 transitions. [2018-10-27 07:42:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 07:42:31,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-10-27 07:42:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:42:31,101 INFO L225 Difference]: With dead ends: 5121 [2018-10-27 07:42:31,101 INFO L226 Difference]: Without dead ends: 3692 [2018-10-27 07:42:31,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 468 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-10-27 07:42:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2018-10-27 07:42:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3671. [2018-10-27 07:42:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2018-10-27 07:42:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5080 transitions. [2018-10-27 07:42:31,202 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5080 transitions. Word has length 235 [2018-10-27 07:42:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:42:31,203 INFO L481 AbstractCegarLoop]: Abstraction has 3671 states and 5080 transitions. [2018-10-27 07:42:31,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 07:42:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5080 transitions. [2018-10-27 07:42:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-27 07:42:31,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:42:31,211 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 07:42:31,211 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:42:31,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:31,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1641054639, now seen corresponding path program 1 times [2018-10-27 07:42:31,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:42:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:31,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:31,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:42:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-27 07:42:31,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 07:42:31,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 07:42:31,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:42:31,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 07:42:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 07:42:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 07:42:31,494 INFO L87 Difference]: Start difference. First operand 3671 states and 5080 transitions. Second operand 4 states. [2018-10-27 07:42:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:42:34,428 INFO L93 Difference]: Finished difference Result 11208 states and 16853 transitions. [2018-10-27 07:42:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 07:42:34,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-10-27 07:42:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:42:34,476 INFO L225 Difference]: With dead ends: 11208 [2018-10-27 07:42:34,477 INFO L226 Difference]: Without dead ends: 7732 [2018-10-27 07:42:34,507 INFO L605 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-10-27 07:42:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2018-10-27 07:42:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7606. [2018-10-27 07:42:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2018-10-27 07:42:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 10715 transitions. [2018-10-27 07:42:34,699 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 10715 transitions. Word has length 263 [2018-10-27 07:42:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:42:34,700 INFO L481 AbstractCegarLoop]: Abstraction has 7606 states and 10715 transitions. [2018-10-27 07:42:34,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 07:42:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 10715 transitions. [2018-10-27 07:42:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-27 07:42:34,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:42:34,717 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-27 07:42:34,717 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:42:34,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:34,717 INFO L82 PathProgramCache]: Analyzing trace with hash 396379969, now seen corresponding path program 1 times [2018-10-27 07:42:34,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:42:34,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:34,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:34,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:42:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:35,556 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-27 07:42:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-27 07:42:35,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:35,641 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:42:35,641 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-10-27 07:42:35,642 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [661], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:42:35,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:42:35,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:42:36,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 07:42:36,393 INFO L272 AbstractInterpreter]: Visited 126 different actions 375 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-10-27 07:42:36,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:36,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 07:42:36,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:36,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 07:42:36,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:36,451 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 07:42:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:36,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 07:42:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-27 07:42:39,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 07:42:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-27 07:42:39,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 07:42:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-10-27 07:42:39,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:42:39,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 07:42:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 07:42:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2018-10-27 07:42:39,368 INFO L87 Difference]: Start difference. First operand 7606 states and 10715 transitions. Second operand 3 states. [2018-10-27 07:42:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:42:40,621 INFO L93 Difference]: Finished difference Result 15202 states and 22542 transitions. [2018-10-27 07:42:40,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 07:42:40,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-10-27 07:42:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:42:40,674 INFO L225 Difference]: With dead ends: 15202 [2018-10-27 07:42:40,674 INFO L226 Difference]: Without dead ends: 9133 [2018-10-27 07:42:40,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 541 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2018-10-27 07:42:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9133 states. [2018-10-27 07:42:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9133 to 9127. [2018-10-27 07:42:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9127 states. [2018-10-27 07:42:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9127 states to 9127 states and 12717 transitions. [2018-10-27 07:42:40,967 INFO L78 Accepts]: Start accepts. Automaton has 9127 states and 12717 transitions. Word has length 271 [2018-10-27 07:42:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:42:40,968 INFO L481 AbstractCegarLoop]: Abstraction has 9127 states and 12717 transitions. [2018-10-27 07:42:40,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 07:42:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9127 states and 12717 transitions. [2018-10-27 07:42:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-27 07:42:41,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:42:41,008 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 07:42:41,009 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:42:41,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1994193760, now seen corresponding path program 1 times [2018-10-27 07:42:41,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:42:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:41,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:42:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-27 07:42:41,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:41,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:42:41,898 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-10-27 07:42:41,898 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [850], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:42:41,903 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:42:41,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:42:42,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 07:42:42,302 INFO L272 AbstractInterpreter]: Visited 157 different actions 618 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-10-27 07:42:42,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:42,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 07:42:42,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:42,311 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 07:42:42,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:42,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 07:42:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:42,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 07:42:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-27 07:42:42,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 07:42:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-27 07:42:43,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 07:42:43,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-10-27 07:42:43,029 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 07:42:43,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 07:42:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 07:42:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-27 07:42:43,030 INFO L87 Difference]: Start difference. First operand 9127 states and 12717 transitions. Second operand 6 states. [2018-10-27 07:42:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:42:45,875 INFO L93 Difference]: Finished difference Result 19789 states and 28778 transitions. [2018-10-27 07:42:45,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 07:42:45,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2018-10-27 07:42:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:42:45,951 INFO L225 Difference]: With dead ends: 19789 [2018-10-27 07:42:45,952 INFO L226 Difference]: Without dead ends: 12199 [2018-10-27 07:42:45,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 673 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-27 07:42:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12199 states. [2018-10-27 07:42:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12199 to 12199. [2018-10-27 07:42:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12199 states. [2018-10-27 07:42:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12199 states to 12199 states and 17553 transitions. [2018-10-27 07:42:46,594 INFO L78 Accepts]: Start accepts. Automaton has 12199 states and 17553 transitions. Word has length 337 [2018-10-27 07:42:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:42:46,594 INFO L481 AbstractCegarLoop]: Abstraction has 12199 states and 17553 transitions. [2018-10-27 07:42:46,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 07:42:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12199 states and 17553 transitions. [2018-10-27 07:42:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-27 07:42:46,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:42:46,652 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 07:42:46,652 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:42:46,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:46,653 INFO L82 PathProgramCache]: Analyzing trace with hash 435985322, now seen corresponding path program 1 times [2018-10-27 07:42:46,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:42:46,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:46,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:46,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:46,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:42:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 07:42:47,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:47,405 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:42:47,405 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 401 with the following transitions: [2018-10-27 07:42:47,406 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [951], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:42:47,411 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:42:47,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:42:48,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 07:42:48,136 INFO L272 AbstractInterpreter]: Visited 175 different actions 522 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-10-27 07:42:48,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:48,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 07:42:48,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:48,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 07:42:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:48,150 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 07:42:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:48,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 07:42:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 07:42:48,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 07:42:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 07:42:48,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 07:42:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 07:42:48,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 07:42:48,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 07:42:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 07:42:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 07:42:48,680 INFO L87 Difference]: Start difference. First operand 12199 states and 17553 transitions. Second operand 9 states. [2018-10-27 07:42:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:42:53,737 INFO L93 Difference]: Finished difference Result 26993 states and 43671 transitions. [2018-10-27 07:42:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 07:42:53,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 400 [2018-10-27 07:42:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:42:53,868 INFO L225 Difference]: With dead ends: 26993 [2018-10-27 07:42:53,868 INFO L226 Difference]: Without dead ends: 15178 [2018-10-27 07:42:53,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 801 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-10-27 07:42:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2018-10-27 07:42:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 14957. [2018-10-27 07:42:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14957 states. [2018-10-27 07:42:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14957 states to 14957 states and 22735 transitions. [2018-10-27 07:42:54,441 INFO L78 Accepts]: Start accepts. Automaton has 14957 states and 22735 transitions. Word has length 400 [2018-10-27 07:42:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:42:54,442 INFO L481 AbstractCegarLoop]: Abstraction has 14957 states and 22735 transitions. [2018-10-27 07:42:54,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 07:42:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 14957 states and 22735 transitions. [2018-10-27 07:42:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-27 07:42:54,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:42:54,525 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 07:42:54,525 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:42:54,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash -730130007, now seen corresponding path program 1 times [2018-10-27 07:42:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:42:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:54,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:42:54,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:42:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 07:42:55,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:55,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:42:55,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2018-10-27 07:42:55,504 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [951], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:42:55,510 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:42:55,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:42:56,203 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 07:42:56,204 INFO L272 AbstractInterpreter]: Visited 175 different actions 691 times. Merged at 7 different actions 26 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-10-27 07:42:56,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:42:56,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 07:42:56,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:42:56,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 07:42:56,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:42:56,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 07:42:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:42:56,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 07:42:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 07:42:56,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 07:42:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 07:42:56,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 07:42:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 07:42:56,981 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 07:42:56,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 07:42:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 07:42:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 07:42:56,983 INFO L87 Difference]: Start difference. First operand 14957 states and 22735 transitions. Second operand 9 states. [2018-10-27 07:43:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:43:02,339 INFO L93 Difference]: Finished difference Result 39083 states and 77471 transitions. [2018-10-27 07:43:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 07:43:02,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 411 [2018-10-27 07:43:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:43:02,590 INFO L225 Difference]: With dead ends: 39083 [2018-10-27 07:43:02,591 INFO L226 Difference]: Without dead ends: 24512 [2018-10-27 07:43:02,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 825 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-10-27 07:43:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24512 states. [2018-10-27 07:43:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24512 to 24091. [2018-10-27 07:43:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24091 states. [2018-10-27 07:43:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24091 states to 24091 states and 41902 transitions. [2018-10-27 07:43:03,889 INFO L78 Accepts]: Start accepts. Automaton has 24091 states and 41902 transitions. Word has length 411 [2018-10-27 07:43:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:43:03,890 INFO L481 AbstractCegarLoop]: Abstraction has 24091 states and 41902 transitions. [2018-10-27 07:43:03,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 07:43:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 24091 states and 41902 transitions. [2018-10-27 07:43:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-27 07:43:03,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:43:03,988 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 07:43:03,989 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:43:03,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:43:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1258701310, now seen corresponding path program 1 times [2018-10-27 07:43:03,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:43:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:43:03,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:43:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:43:03,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:43:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:43:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 326 proven. 99 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 07:43:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:43:04,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 07:43:04,848 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 429 with the following transitions: [2018-10-27 07:43:04,848 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [629], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [951], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-27 07:43:04,852 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 07:43:04,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 07:43:05,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 07:43:05,641 INFO L272 AbstractInterpreter]: Visited 175 different actions 522 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-10-27 07:43:05,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:43:05,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 07:43:05,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 07:43:05,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 07:43:05,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:43:05,674 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 07:43:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 07:43:05,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 07:43:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-27 07:43:05,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 07:43:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-27 07:43:06,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 07:43:06,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-10-27 07:43:06,213 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 07:43:06,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 07:43:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 07:43:06,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 07:43:06,215 INFO L87 Difference]: Start difference. First operand 24091 states and 41902 transitions. Second operand 6 states. [2018-10-27 07:43:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 07:43:09,537 INFO L93 Difference]: Finished difference Result 50300 states and 101440 transitions. [2018-10-27 07:43:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 07:43:09,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 428 [2018-10-27 07:43:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 07:43:09,723 INFO L225 Difference]: With dead ends: 50300 [2018-10-27 07:43:09,723 INFO L226 Difference]: Without dead ends: 28092 [2018-10-27 07:43:09,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 857 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 07:43:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28092 states. [2018-10-27 07:43:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28092 to 25979. [2018-10-27 07:43:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25979 states. [2018-10-27 07:43:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25979 states to 25979 states and 40453 transitions. [2018-10-27 07:43:11,360 INFO L78 Accepts]: Start accepts. Automaton has 25979 states and 40453 transitions. Word has length 428 [2018-10-27 07:43:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 07:43:11,361 INFO L481 AbstractCegarLoop]: Abstraction has 25979 states and 40453 transitions. [2018-10-27 07:43:11,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 07:43:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states and 40453 transitions. [2018-10-27 07:43:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-27 07:43:11,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 07:43:11,474 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-27 07:43:11,475 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 07:43:11,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 07:43:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash -114462136, now seen corresponding path program 1 times [2018-10-27 07:43:11,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 07:43:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:43:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 07:43:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 07:43:11,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 07:43:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-27 07:43:11,714 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-10-27 07:43:11,715 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 07:43:11,724 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 07:43:11,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 07:43:11 BoogieIcfgContainer [2018-10-27 07:43:11,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 07:43:11,725 INFO L168 Benchmark]: Toolchain (without parser) took 235748.36 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 885.0 MB. Max. memory is 7.1 GB. [2018-10-27 07:43:11,726 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-10-27 07:43:11,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 970.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2018-10-27 07:43:11,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 292.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-10-27 07:43:11,730 INFO L168 Benchmark]: Boogie Preprocessor took 154.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 07:43:11,730 INFO L168 Benchmark]: RCFGBuilder took 4719.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 185.8 MB). Peak memory consumption was 185.8 MB. Max. memory is 7.1 GB. [2018-10-27 07:43:11,731 INFO L168 Benchmark]: TraceAbstraction took 229605.33 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 727.2 MB. Max. memory is 7.1 GB. [2018-10-27 07:43:11,737 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 970.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 292.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4719.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 185.8 MB). Peak memory consumption was 185.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229605.33 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 727.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 117). Cancelled while BasicCegarLoop was analyzing trace of length 539 with TraceHistMax 5,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 229.5s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 201.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2380 SDtfs, 8152 SDslu, 2630 SDs, 0 SdLazy, 17411 SolverSat, 4001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 172.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 4660 GetRequests, 4544 SyntacticMatches, 17 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25979occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9976912104214397 AbsIntWeakeningRatio, 0.13123359580052493 AbsIntAvgWeakeningVarsNumRemoved, 17.69291338582677 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 3355 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 4972 NumberOfCodeBlocks, 4972 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7031 ConstructedInterpolants, 4 QuantifiedInterpolants, 8135897 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3435 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 5028/5668 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown