java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:38:50,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:38:50,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:38:50,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:38:50,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:38:50,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:38:50,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:38:50,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:38:50,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:38:50,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:38:50,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:38:50,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:38:50,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:38:50,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:38:50,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:38:50,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:38:50,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:38:50,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:38:50,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:38:50,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:38:50,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:38:50,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:38:50,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:38:50,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:38:50,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:38:50,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:38:50,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:38:50,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:38:50,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:38:50,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:38:50,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:38:50,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:38:50,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:38:50,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:38:50,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:38:50,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:38:50,062 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 18:38:50,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:38:50,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:38:50,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:38:50,089 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:38:50,089 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:38:50,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:38:50,090 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:38:50,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:38:50,090 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:38:50,090 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:38:50,090 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:38:50,091 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:38:50,091 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:38:50,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:38:50,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:38:50,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:38:50,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:38:50,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:38:50,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:38:50,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:38:50,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:38:50,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:38:50,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:38:50,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:38:50,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:38:50,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:38:50,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:38:50,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:38:50,094 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:38:50,095 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:38:50,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:38:50,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:38:50,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:38:50,095 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:38:50,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:38:50,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:38:50,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:38:50,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:38:50,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:38:50,189 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:38:50,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label27_true-unreach-call.c [2018-11-12 18:38:50,253 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad5fb8fa/03d4823977164427b4d3cd10b19d91db/FLAGe9446cccc [2018-11-12 18:38:50,913 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:38:50,914 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label27_true-unreach-call.c [2018-11-12 18:38:50,931 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad5fb8fa/03d4823977164427b4d3cd10b19d91db/FLAGe9446cccc [2018-11-12 18:38:50,948 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad5fb8fa/03d4823977164427b4d3cd10b19d91db [2018-11-12 18:38:50,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:38:50,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:38:50,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:38:50,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:38:50,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:38:50,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:38:50" (1/1) ... [2018-11-12 18:38:50,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498900af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:50, skipping insertion in model container [2018-11-12 18:38:50,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:38:50" (1/1) ... [2018-11-12 18:38:50,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:38:51,074 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:38:51,818 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:38:51,823 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:38:52,040 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:38:52,061 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:38:52,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52 WrapperNode [2018-11-12 18:38:52,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:38:52,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:38:52,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:38:52,063 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:38:52,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:38:52,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:38:52,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:38:52,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:38:52,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... [2018-11-12 18:38:52,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:38:52,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:38:52,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:38:52,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:38:52,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:38:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:38:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:38:52,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:38:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:38:52,468 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:38:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:38:52,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:38:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:38:52,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:38:57,731 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:38:57,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:57 BoogieIcfgContainer [2018-11-12 18:38:57,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:38:57,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:38:57,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:38:57,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:38:57,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:38:50" (1/3) ... [2018-11-12 18:38:57,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b331db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:38:57, skipping insertion in model container [2018-11-12 18:38:57,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:38:52" (2/3) ... [2018-11-12 18:38:57,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b331db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:38:57, skipping insertion in model container [2018-11-12 18:38:57,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:38:57" (3/3) ... [2018-11-12 18:38:57,743 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label27_true-unreach-call.c [2018-11-12 18:38:57,754 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:38:57,764 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:38:57,785 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:38:57,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:38:57,837 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:38:57,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:38:57,837 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:38:57,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:38:57,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:38:57,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:38:57,838 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:38:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-12 18:38:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 18:38:57,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:38:57,899 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:38:57,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:38:57,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:38:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash 266493369, now seen corresponding path program 1 times [2018-11-12 18:38:57,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:38:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:38:57,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:38:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:38:57,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:38:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:38:58,481 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-12 18:38:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:38:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:38:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:38:58,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:38:58,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:38:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:38:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:38:58,525 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-11-12 18:39:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:01,963 INFO L93 Difference]: Finished difference Result 996 states and 1776 transitions. [2018-11-12 18:39:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:39:01,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-12 18:39:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:01,989 INFO L225 Difference]: With dead ends: 996 [2018-11-12 18:39:01,989 INFO L226 Difference]: Without dead ends: 697 [2018-11-12 18:39:01,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:39:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-12 18:39:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 481. [2018-11-12 18:39:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-11-12 18:39:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 742 transitions. [2018-11-12 18:39:02,087 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 742 transitions. Word has length 49 [2018-11-12 18:39:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:02,088 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 742 transitions. [2018-11-12 18:39:02,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:39:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 742 transitions. [2018-11-12 18:39:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-12 18:39:02,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:02,096 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:02,096 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:02,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1615287979, now seen corresponding path program 1 times [2018-11-12 18:39:02,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:02,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:02,482 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:39:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:02,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:39:02,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:39:02,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:02,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:39:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:39:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:39:02,642 INFO L87 Difference]: Start difference. First operand 481 states and 742 transitions. Second operand 6 states. [2018-11-12 18:39:06,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:06,366 INFO L93 Difference]: Finished difference Result 1725 states and 2777 transitions. [2018-11-12 18:39:06,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:39:06,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-11-12 18:39:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:06,378 INFO L225 Difference]: With dead ends: 1725 [2018-11-12 18:39:06,378 INFO L226 Difference]: Without dead ends: 1250 [2018-11-12 18:39:06,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:39:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-11-12 18:39:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1231. [2018-11-12 18:39:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-11-12 18:39:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1812 transitions. [2018-11-12 18:39:06,479 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1812 transitions. Word has length 122 [2018-11-12 18:39:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:06,480 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1812 transitions. [2018-11-12 18:39:06,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:39:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1812 transitions. [2018-11-12 18:39:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-12 18:39:06,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:06,490 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:06,491 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:06,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1254054036, now seen corresponding path program 1 times [2018-11-12 18:39:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:06,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:06,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:06,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:06,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:39:06,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:39:06,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:06,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:39:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:39:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:39:06,748 INFO L87 Difference]: Start difference. First operand 1231 states and 1812 transitions. Second operand 4 states. [2018-11-12 18:39:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:09,551 INFO L93 Difference]: Finished difference Result 3241 states and 4920 transitions. [2018-11-12 18:39:09,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:39:09,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-12 18:39:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:09,571 INFO L225 Difference]: With dead ends: 3241 [2018-11-12 18:39:09,571 INFO L226 Difference]: Without dead ends: 2016 [2018-11-12 18:39:09,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:39:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-11-12 18:39:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 2001. [2018-11-12 18:39:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-11-12 18:39:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2887 transitions. [2018-11-12 18:39:09,652 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2887 transitions. Word has length 123 [2018-11-12 18:39:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:09,653 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 2887 transitions. [2018-11-12 18:39:09,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:39:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2887 transitions. [2018-11-12 18:39:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 18:39:09,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:09,662 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:09,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1858238712, now seen corresponding path program 1 times [2018-11-12 18:39:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:09,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:39:09,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 18:39:09,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 18:39:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 18:39:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 18:39:09,895 INFO L87 Difference]: Start difference. First operand 2001 states and 2887 transitions. Second operand 5 states. [2018-11-12 18:39:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:14,764 INFO L93 Difference]: Finished difference Result 6976 states and 10596 transitions. [2018-11-12 18:39:14,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 18:39:14,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-11-12 18:39:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:14,798 INFO L225 Difference]: With dead ends: 6976 [2018-11-12 18:39:14,798 INFO L226 Difference]: Without dead ends: 4981 [2018-11-12 18:39:14,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:39:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4981 states. [2018-11-12 18:39:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4981 to 4688. [2018-11-12 18:39:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4688 states. [2018-11-12 18:39:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 6352 transitions. [2018-11-12 18:39:14,969 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 6352 transitions. Word has length 125 [2018-11-12 18:39:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:14,969 INFO L480 AbstractCegarLoop]: Abstraction has 4688 states and 6352 transitions. [2018-11-12 18:39:14,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 18:39:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 6352 transitions. [2018-11-12 18:39:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-12 18:39:14,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:14,977 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:14,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:14,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1707184253, now seen corresponding path program 1 times [2018-11-12 18:39:14,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:14,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:14,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:14,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:15,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:39:15,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:39:15,383 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-12 18:39:15,385 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 18:39:15,451 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:39:15,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:39:16,203 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:39:17,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:39:17,356 INFO L272 AbstractInterpreter]: Visited 140 different actions 406 times. Merged at 5 different actions 9 times. Never widened. Performed 6198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 18:39:17,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:17,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:39:17,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:39:17,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:39:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:17,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:39:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:17,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:39:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:17,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:39:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:39:17,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-11-12 18:39:17,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:17,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:39:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:39:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:39:17,916 INFO L87 Difference]: Start difference. First operand 4688 states and 6352 transitions. Second operand 3 states. [2018-11-12 18:39:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:20,490 INFO L93 Difference]: Finished difference Result 10738 states and 15063 transitions. [2018-11-12 18:39:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:39:20,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-11-12 18:39:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:20,522 INFO L225 Difference]: With dead ends: 10738 [2018-11-12 18:39:20,523 INFO L226 Difference]: Without dead ends: 6056 [2018-11-12 18:39:20,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 362 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:39:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2018-11-12 18:39:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5860. [2018-11-12 18:39:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5860 states. [2018-11-12 18:39:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5860 states to 5860 states and 7955 transitions. [2018-11-12 18:39:20,709 INFO L78 Accepts]: Start accepts. Automaton has 5860 states and 7955 transitions. Word has length 181 [2018-11-12 18:39:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:20,710 INFO L480 AbstractCegarLoop]: Abstraction has 5860 states and 7955 transitions. [2018-11-12 18:39:20,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:39:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5860 states and 7955 transitions. [2018-11-12 18:39:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-12 18:39:20,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:20,720 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:20,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:20,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1205214562, now seen corresponding path program 1 times [2018-11-12 18:39:20,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:20,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:20,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:39:21,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:39:21,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:39:21,275 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-11-12 18:39:21,277 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [514], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 18:39:21,283 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:39:21,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:39:21,415 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:39:21,415 INFO L272 AbstractInterpreter]: Visited 89 different actions 89 times. Never merged. Never widened. Performed 939 root evaluator evaluations with a maximum evaluation depth of 6. Performed 939 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 28 variables. [2018-11-12 18:39:21,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:21,453 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:39:21,847 INFO L227 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.53% of their original sizes. [2018-11-12 18:39:21,847 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:39:22,194 INFO L415 sIntCurrentIteration]: We unified 207 AI predicates to 207 [2018-11-12 18:39:22,195 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:39:22,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:39:22,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-12 18:39:22,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:22,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 18:39:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 18:39:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:39:22,197 INFO L87 Difference]: Start difference. First operand 5860 states and 7955 transitions. Second operand 7 states. [2018-11-12 18:39:24,889 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:39:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:35,885 INFO L93 Difference]: Finished difference Result 11906 states and 16123 transitions. [2018-11-12 18:39:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:39:35,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2018-11-12 18:39:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:35,912 INFO L225 Difference]: With dead ends: 11906 [2018-11-12 18:39:35,912 INFO L226 Difference]: Without dead ends: 6052 [2018-11-12 18:39:35,930 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:39:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2018-11-12 18:39:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 6050. [2018-11-12 18:39:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6050 states. [2018-11-12 18:39:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6050 states to 6050 states and 8156 transitions. [2018-11-12 18:39:36,074 INFO L78 Accepts]: Start accepts. Automaton has 6050 states and 8156 transitions. Word has length 208 [2018-11-12 18:39:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:36,075 INFO L480 AbstractCegarLoop]: Abstraction has 6050 states and 8156 transitions. [2018-11-12 18:39:36,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 18:39:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6050 states and 8156 transitions. [2018-11-12 18:39:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-11-12 18:39:36,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:36,094 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:36,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:36,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1377061562, now seen corresponding path program 1 times [2018-11-12 18:39:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:36,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:36,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-12 18:39:36,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:39:36,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:39:36,769 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 326 with the following transitions: [2018-11-12 18:39:36,770 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [514], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [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-11-12 18:39:36,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:39:36,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:39:37,265 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:39:37,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:39:37,432 INFO L272 AbstractInterpreter]: Visited 126 different actions 246 times. Merged at 5 different actions 5 times. Never widened. Performed 3018 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3018 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 18:39:37,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:37,458 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:39:37,980 INFO L227 lantSequenceWeakener]: Weakened 322 states. On average, predicates are now at 73.42% of their original sizes. [2018-11-12 18:39:37,981 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:39:38,674 INFO L415 sIntCurrentIteration]: We unified 324 AI predicates to 324 [2018-11-12 18:39:38,675 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:39:38,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:39:38,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 18:39:38,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:38,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:39:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:39:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 18:39:38,677 INFO L87 Difference]: Start difference. First operand 6050 states and 8156 transitions. Second operand 11 states. [2018-11-12 18:39:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:39:56,544 INFO L93 Difference]: Finished difference Result 12099 states and 16368 transitions. [2018-11-12 18:39:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 18:39:56,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 325 [2018-11-12 18:39:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:39:56,571 INFO L225 Difference]: With dead ends: 12099 [2018-11-12 18:39:56,572 INFO L226 Difference]: Without dead ends: 6245 [2018-11-12 18:39:56,583 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 333 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 18:39:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6245 states. [2018-11-12 18:39:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6245 to 6241. [2018-11-12 18:39:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2018-11-12 18:39:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 8368 transitions. [2018-11-12 18:39:56,713 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 8368 transitions. Word has length 325 [2018-11-12 18:39:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:39:56,714 INFO L480 AbstractCegarLoop]: Abstraction has 6241 states and 8368 transitions. [2018-11-12 18:39:56,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:39:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 8368 transitions. [2018-11-12 18:39:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-12 18:39:56,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:39:56,744 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:39:56,744 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:39:56,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2026903558, now seen corresponding path program 1 times [2018-11-12 18:39:56,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:39:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:56,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:39:56,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:39:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 291 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 18:39:57,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:39:57,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:39:57,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-11-12 18:39:57,443 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [550], [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], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 18:39:57,447 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:39:57,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:39:57,550 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:39:58,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:39:58,222 INFO L272 AbstractInterpreter]: Visited 127 different actions 622 times. Merged at 7 different actions 33 times. Widened at 1 different actions 1 times. Performed 8743 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8743 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-12 18:39:58,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:39:58,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:39:58,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:39:58,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:39:58,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:39:58,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:39:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:39:58,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:39:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-12 18:39:59,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:39:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-12 18:39:59,740 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:39:59,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-12 18:39:59,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:39:59,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:39:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:39:59,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:39:59,745 INFO L87 Difference]: Start difference. First operand 6241 states and 8368 transitions. Second operand 3 states. [2018-11-12 18:40:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:40:01,311 INFO L93 Difference]: Finished difference Result 15771 states and 22055 transitions. [2018-11-12 18:40:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:40:01,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2018-11-12 18:40:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:40:01,343 INFO L225 Difference]: With dead ends: 15771 [2018-11-12 18:40:01,343 INFO L226 Difference]: Without dead ends: 9917 [2018-11-12 18:40:01,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 670 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:40:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2018-11-12 18:40:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 9916. [2018-11-12 18:40:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9916 states. [2018-11-12 18:40:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9916 states to 9916 states and 13034 transitions. [2018-11-12 18:40:01,555 INFO L78 Accepts]: Start accepts. Automaton has 9916 states and 13034 transitions. Word has length 335 [2018-11-12 18:40:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:40:01,556 INFO L480 AbstractCegarLoop]: Abstraction has 9916 states and 13034 transitions. [2018-11-12 18:40:01,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:40:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9916 states and 13034 transitions. [2018-11-12 18:40:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-12 18:40:01,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:40:01,586 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:40:01,586 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:40:01,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1802172478, now seen corresponding path program 1 times [2018-11-12 18:40:01,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:40:01,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:01,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:01,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:01,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:40:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-12 18:40:01,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:40:01,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:40:01,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:40:01,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:40:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:40:01,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:40:01,918 INFO L87 Difference]: Start difference. First operand 9916 states and 13034 transitions. Second operand 3 states. [2018-11-12 18:40:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:40:03,610 INFO L93 Difference]: Finished difference Result 23259 states and 31982 transitions. [2018-11-12 18:40:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:40:03,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-11-12 18:40:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:40:03,664 INFO L225 Difference]: With dead ends: 23259 [2018-11-12 18:40:03,664 INFO L226 Difference]: Without dead ends: 13730 [2018-11-12 18:40:03,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:40:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13730 states. [2018-11-12 18:40:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13730 to 13529. [2018-11-12 18:40:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13529 states. [2018-11-12 18:40:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 17757 transitions. [2018-11-12 18:40:03,952 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 17757 transitions. Word has length 339 [2018-11-12 18:40:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:40:03,953 INFO L480 AbstractCegarLoop]: Abstraction has 13529 states and 17757 transitions. [2018-11-12 18:40:03,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:40:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 17757 transitions. [2018-11-12 18:40:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-12 18:40:03,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:40:03,989 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:40:03,989 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:40:03,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1167364297, now seen corresponding path program 1 times [2018-11-12 18:40:03,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:40:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:03,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:40:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:40:05,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:40:05,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:40:05,238 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2018-11-12 18:40:05,239 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [750], [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], [952], [956], [959], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 18:40:05,243 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:40:05,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:40:05,406 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:40:06,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:40:06,424 INFO L272 AbstractInterpreter]: Visited 175 different actions 512 times. Merged at 5 different actions 9 times. Never widened. Performed 8992 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8992 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 18:40:06,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:06,433 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:40:06,994 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 75.45% of their original sizes. [2018-11-12 18:40:06,994 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:40:07,391 INFO L415 sIntCurrentIteration]: We unified 342 AI predicates to 342 [2018-11-12 18:40:07,391 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:40:07,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:40:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-12 18:40:07,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:40:07,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:40:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:40:07,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:40:07,393 INFO L87 Difference]: Start difference. First operand 13529 states and 17757 transitions. Second operand 21 states. [2018-11-12 18:40:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:40:26,630 INFO L93 Difference]: Finished difference Result 27445 states and 36028 transitions. [2018-11-12 18:40:26,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 18:40:26,631 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 343 [2018-11-12 18:40:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:40:26,680 INFO L225 Difference]: With dead ends: 27445 [2018-11-12 18:40:26,681 INFO L226 Difference]: Without dead ends: 14303 [2018-11-12 18:40:26,708 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 367 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 18:40:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2018-11-12 18:40:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 14102. [2018-11-12 18:40:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14102 states. [2018-11-12 18:40:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 18374 transitions. [2018-11-12 18:40:26,949 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 18374 transitions. Word has length 343 [2018-11-12 18:40:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:40:26,950 INFO L480 AbstractCegarLoop]: Abstraction has 14102 states and 18374 transitions. [2018-11-12 18:40:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:40:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 18374 transitions. [2018-11-12 18:40:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-12 18:40:26,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:40:26,995 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:40:26,996 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:40:26,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1795217206, now seen corresponding path program 1 times [2018-11-12 18:40:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:40:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:26,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:40:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 5 proven. 86 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-12 18:40:28,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:40:28,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:40:28,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 365 with the following transitions: [2018-11-12 18:40:28,668 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [959], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 18:40:28,672 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:40:28,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:40:28,808 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:40:30,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:40:30,012 INFO L272 AbstractInterpreter]: Visited 176 different actions 864 times. Merged at 7 different actions 31 times. Never widened. Performed 15970 root evaluator evaluations with a maximum evaluation depth of 6. Performed 15970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-12 18:40:30,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:30,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:40:30,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:40:30,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:40:30,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:30,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:40:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:30,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:40:32,035 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_527 Int)) (let ((.cse1 (+ v_~a29~0_527 69157))) (let ((.cse0 (mod .cse1 299861))) (and (<= c_~a29~0 (+ .cse0 277)) (<= |c_old(~a29~0)| v_~a29~0_527) (< .cse1 0) (not (= 0 .cse0)))))) (exists ((v_prenex_2 Int)) (let ((.cse2 (mod (+ v_prenex_2 69157) 299861))) (and (= 0 .cse2) (<= |c_old(~a29~0)| v_prenex_2) (<= c_~a29~0 (+ .cse2 300138))))) (exists ((v_prenex_1 Int)) (let ((.cse3 (+ v_prenex_1 69157))) (and (<= 0 .cse3) (<= |c_old(~a29~0)| v_prenex_1) (<= c_~a29~0 (+ (mod .cse3 299861) 300138)))))) is different from true [2018-11-12 18:40:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 5 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-12 18:40:32,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:40:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:40:33,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:40:33,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 15 [2018-11-12 18:40:33,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:40:33,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 18:40:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 18:40:33,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=135, Unknown=1, NotChecked=24, Total=210 [2018-11-12 18:40:33,151 INFO L87 Difference]: Start difference. First operand 14102 states and 18374 transitions. Second operand 12 states. [2018-11-12 18:40:37,367 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 43 DAG size of output: 8 [2018-11-12 18:40:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:40:44,703 INFO L93 Difference]: Finished difference Result 45976 states and 65272 transitions. [2018-11-12 18:40:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 18:40:44,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 364 [2018-11-12 18:40:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:40:44,859 INFO L225 Difference]: With dead ends: 45976 [2018-11-12 18:40:44,860 INFO L226 Difference]: Without dead ends: 32834 [2018-11-12 18:40:44,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 722 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=268, Invalid=725, Unknown=3, NotChecked=60, Total=1056 [2018-11-12 18:40:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32834 states. [2018-11-12 18:40:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32834 to 31381. [2018-11-12 18:40:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31381 states. [2018-11-12 18:40:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31381 states to 31381 states and 42977 transitions. [2018-11-12 18:40:45,725 INFO L78 Accepts]: Start accepts. Automaton has 31381 states and 42977 transitions. Word has length 364 [2018-11-12 18:40:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:40:45,726 INFO L480 AbstractCegarLoop]: Abstraction has 31381 states and 42977 transitions. [2018-11-12 18:40:45,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 18:40:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 31381 states and 42977 transitions. [2018-11-12 18:40:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-11-12 18:40:45,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:40:45,823 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:40:45,823 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:40:45,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1838988999, now seen corresponding path program 1 times [2018-11-12 18:40:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:40:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:45,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:40:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-12 18:40:46,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:40:46,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:40:46,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:40:46,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:40:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:40:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:40:46,133 INFO L87 Difference]: Start difference. First operand 31381 states and 42977 transitions. Second operand 4 states. [2018-11-12 18:40:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:40:48,357 INFO L93 Difference]: Finished difference Result 70601 states and 102792 transitions. [2018-11-12 18:40:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:40:48,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2018-11-12 18:40:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:40:48,475 INFO L225 Difference]: With dead ends: 70601 [2018-11-12 18:40:48,475 INFO L226 Difference]: Without dead ends: 39993 [2018-11-12 18:40:48,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:40:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39993 states. [2018-11-12 18:40:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39993 to 39993. [2018-11-12 18:40:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39993 states. [2018-11-12 18:40:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39993 states to 39993 states and 53631 transitions. [2018-11-12 18:40:49,902 INFO L78 Accepts]: Start accepts. Automaton has 39993 states and 53631 transitions. Word has length 369 [2018-11-12 18:40:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:40:49,903 INFO L480 AbstractCegarLoop]: Abstraction has 39993 states and 53631 transitions. [2018-11-12 18:40:49,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:40:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 39993 states and 53631 transitions. [2018-11-12 18:40:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-12 18:40:49,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:40:49,975 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:40:49,976 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:40:49,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1396109095, now seen corresponding path program 1 times [2018-11-12 18:40:49,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:40:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:40:49,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:40:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 362 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 18:40:50,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:40:50,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:40:50,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 417 with the following transitions: [2018-11-12 18:40:50,435 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [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], [665], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [738], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 18:40:50,437 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:40:50,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:40:50,547 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:40:50,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:40:50,940 INFO L272 AbstractInterpreter]: Visited 142 different actions 412 times. Merged at 5 different actions 9 times. Never widened. Performed 7730 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7730 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 18:40:50,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:40:50,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:40:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:40:50,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:40:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:40:50,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:40:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:40:51,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:40:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 362 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 18:40:51,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:40:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 362 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 18:40:52,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:40:52,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-12 18:40:52,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:40:52,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 18:40:52,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 18:40:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:40:52,433 INFO L87 Difference]: Start difference. First operand 39993 states and 53631 transitions. Second operand 7 states. [2018-11-12 18:40:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:40:54,950 INFO L93 Difference]: Finished difference Result 73871 states and 102981 transitions. [2018-11-12 18:40:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:40:54,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 416 [2018-11-12 18:40:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:40:54,951 INFO L225 Difference]: With dead ends: 73871 [2018-11-12 18:40:54,951 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:40:55,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 832 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:40:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:40:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:40:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:40:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:40:55,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 416 [2018-11-12 18:40:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:40:55,106 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:40:55,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 18:40:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:40:55,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:40:55,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:40:55,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,535 WARN L179 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 556 DAG size of output: 98 [2018-11-12 18:40:56,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:56,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:40:57,157 WARN L179 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 562 DAG size of output: 194 [2018-11-12 18:40:57,903 WARN L179 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-11-12 18:40:58,553 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2018-11-12 18:41:01,347 WARN L179 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 520 DAG size of output: 54 [2018-11-12 18:41:01,758 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 83 [2018-11-12 18:41:02,414 WARN L179 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 83 [2018-11-12 18:41:02,416 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:41:02,417 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= |old(~a25~0)| ~a25~0) (= ~a4~0 |old(~a4~0)|)) [2018-11-12 18:41:02,417 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:41:02,417 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-12 18:41:02,417 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-12 18:41:02,417 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-12 18:41:02,417 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,417 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-12 18:41:02,418 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,419 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,420 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-12 18:41:02,421 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,422 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,423 INFO L425 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,424 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-12 18:41:02,425 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,426 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-12 18:41:02,427 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,428 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse7 (= ~a29~0 |old(~a29~0)|)) (.cse8 (= ~a23~0 |old(~a23~0)|)) (.cse9 (= |old(~a25~0)| ~a25~0)) (.cse6 (= ~a4~0 |old(~a4~0)|))) (let ((.cse1 (not (= 1 |old(~a4~0)|))) (.cse2 (< 0 (+ |old(~a23~0)| 43))) (.cse3 (< 0 (+ |old(~a29~0)| 22))) (.cse4 (< 599998 |old(~a29~0)|)) (.cse0 (and .cse7 .cse8 .cse9 .cse6)) (.cse5 (< 0 |old(~a4~0)|))) (and (or .cse0 (= 12 |old(~a25~0)|) .cse1) (or .cse0 .cse2 (< 140 |old(~a29~0)|) .cse1) (or .cse3 .cse0 .cse1) (or (<= |old(~a23~0)| 138) .cse1 .cse0) (or .cse4 .cse2 .cse0 (< |old(~a29~0)| 246) .cse5) (or (or .cse3 .cse5) (and .cse6 (and .cse7 .cse8 .cse9))) (or .cse4 .cse0 (= 13 |old(~a25~0)|) .cse5)))) [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-12 18:41:02,429 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,430 INFO L425 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,431 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,432 INFO L425 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-12 18:41:02,433 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 132) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,434 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,435 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,436 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,437 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,438 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-12 18:41:02,439 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,440 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,441 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,442 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-11-12 18:41:02,443 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:41:02,444 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a8~0 15) (= ~inputD~0 4) (= 1 ~a4~0) (<= 130 ~a29~0) (= ~a25~0 10) (= ~a23~0 312) (= ~inputB~0 2) (= ~inputE~0 5) (<= ~a29~0 130) (= ~a3~0 1)) [2018-11-12 18:41:02,444 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:41:02,444 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:41:02,444 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (and (= ~a25~0 10) (= ~a29~0 130) (= ~a23~0 |old(~a23~0)|) (= 1 ~a4~0)) (not (= 130 |old(~a29~0)|)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= |old(~a25~0)| 10)) (not (= ~a3~0 1)) (not (= 1 |old(~a4~0)|)) (not (= ~a8~0 15)) (not (= ~inputF~0 6))) [2018-11-12 18:41:02,444 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-11-12 18:41:02,444 INFO L421 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse4 (<= (+ ~a23~0 43) 0)) (.cse1 (= 1 ~a4~0)) (.cse0 (<= (+ ~a29~0 22) 0)) (.cse2 (<= ~a4~0 0)) (.cse3 (<= ~a29~0 599998))) (or (and .cse0 .cse1) (and .cse2 (<= 246 ~a29~0) .cse3 .cse4) (and (not (= 12 ~a25~0)) .cse1) (and (<= ~a29~0 140) .cse1 .cse4) (and .cse1 (< 138 ~a23~0)) (and .cse2 .cse0) (and .cse2 .cse3 (not (= ~a25~0 13))) (not (= |old(~a25~0)| 10)) (< 130 |old(~a29~0)|) (not (= ~inputF~0 6)) (< |old(~a29~0)| 130) (not (= 1 ~inputA~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= ~a3~0 1)) (not (= 1 |old(~a4~0)|)) (not (= ~a8~0 15)))) [2018-11-12 18:41:02,445 INFO L425 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-11-12 18:41:02,445 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-12 18:41:02,445 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-12 18:41:02,445 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (<= (+ ~a23~0 43) 0)) (.cse1 (= 1 ~a4~0)) (.cse0 (<= (+ ~a29~0 22) 0)) (.cse2 (<= ~a4~0 0)) (.cse3 (<= ~a29~0 599998))) (or (and .cse0 .cse1) (and .cse2 (<= 246 ~a29~0) .cse3 .cse4) (and (not (= 12 ~a25~0)) .cse1) (and (<= ~a29~0 140) .cse1 .cse4) (and .cse1 (< 138 ~a23~0)) (and .cse2 .cse0) (and .cse2 .cse3 (not (= ~a25~0 13))) (not (= |old(~a25~0)| 10)) (< 130 |old(~a29~0)|) (not (= ~inputF~0 6)) (< |old(~a29~0)| 130) (not (= 1 ~inputA~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= ~a3~0 1)) (not (= 1 |old(~a4~0)|)) (not (= ~a8~0 15)))) [2018-11-12 18:41:02,445 INFO L425 ceAbstractionStarter]: For program point L1034-4(lines 1028 1044) no Hoare annotation was computed. [2018-11-12 18:41:02,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:41:02 BoogieIcfgContainer [2018-11-12 18:41:02,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:41:02,464 INFO L168 Benchmark]: Toolchain (without parser) took 131504.95 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -288.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-12 18:41:02,469 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:41:02,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1100.28 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-12 18:41:02,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 173.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-12 18:41:02,472 INFO L168 Benchmark]: Boogie Preprocessor took 133.17 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-11-12 18:41:02,472 INFO L168 Benchmark]: RCFGBuilder took 5362.38 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: 171.7 MB). Peak memory consumption was 171.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:41:02,474 INFO L168 Benchmark]: TraceAbstraction took 124729.78 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 328.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-12 18:41:02,482 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.26 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 1100.28 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 173.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.17 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 5362.38 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: 171.7 MB). Peak memory consumption was 171.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124729.78 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 328.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 132]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: (((((((((((((((((((a29 + 22 <= 0 && 1 == a4) || (((a4 <= 0 && 246 <= a29) && a29 <= 599998) && a23 + 43 <= 0)) || (!(12 == a25) && 1 == a4)) || ((a29 <= 140 && 1 == a4) && a23 + 43 <= 0)) || (1 == a4 && 138 < a23)) || (a4 <= 0 && a29 + 22 <= 0)) || ((a4 <= 0 && a29 <= 599998) && !(a25 == 13))) || !(\old(a25) == 10)) || 130 < \old(a29)) || !(inputF == 6)) || \old(a29) < 130) || !(1 == inputA)) || !(4 == inputD)) || !(inputE == 5)) || !(3 == inputC)) || !(\old(a23) == 312)) || !(2 == inputB)) || !(a3 == 1)) || !(1 == \old(a4))) || !(a8 == 15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. SAFE Result, 124.6s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 88.8s AutomataDifference, 0.0s DeadEndRemovalTime, 7.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3508 SDtfs, 12393 SDslu, 3020 SDs, 0 SdLazy, 19778 SolverSat, 3833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 3595 GetRequests, 3444 SyntacticMatches, 12 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39993occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.7s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.9977795563648942 AbsIntWeakeningRatio, 0.10309278350515463 AbsIntAvgWeakeningVarsNumRemoved, 23.09163802978236 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2601 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 755 PreInvPairs, 1257 NumberOfFragments, 543 HoareAnnotationTreeSize, 755 FomulaSimplifications, 30619 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12215 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 4595 NumberOfCodeBlocks, 4595 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5870 ConstructedInterpolants, 2 QuantifiedInterpolants, 6455999 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2166 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 4586/5000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...