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/Problem01_label25_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:40:20,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:40:20,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:40:20,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:40:20,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:40:20,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:40:20,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:40:20,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:40:20,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:40:20,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:40:20,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:40:20,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:40:20,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:40:20,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:40:20,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:40:20,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:40:20,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:40:20,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:40:20,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:40:20,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:40:20,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:40:20,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:40:20,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:40:20,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:40:20,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:40:20,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:40:20,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:40:20,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:40:20,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:40:20,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:40:20,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:40:20,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:40:20,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:40:20,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:40:20,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:40:20,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:40:20,925 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 18:40:20,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:40:20,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:40:20,942 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:40:20,942 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:40:20,942 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:40:20,943 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:40:20,943 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:40:20,943 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:40:20,943 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:40:20,944 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:40:20,944 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:40:20,944 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:40:20,944 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:40:20,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:40:20,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:40:20,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:40:20,946 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:40:20,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:40:20,946 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:40:20,946 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:40:20,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:40:20,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:40:20,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:40:20,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:40:20,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:40:20,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:40:20,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:40:20,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:40:20,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:40:20,948 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:40:20,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:40:20,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:40:20,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:40:20,949 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:40:20,949 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:40:20,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:40:21,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:40:21,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:40:21,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:40:21,015 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:40:21,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-11-07 18:40:21,073 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c1ff071/032a0fe2ceea42d5a078659dc8e3556a/FLAGa10507c0d [2018-11-07 18:40:21,641 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:40:21,642 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-11-07 18:40:21,655 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c1ff071/032a0fe2ceea42d5a078659dc8e3556a/FLAGa10507c0d [2018-11-07 18:40:21,670 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c1ff071/032a0fe2ceea42d5a078659dc8e3556a [2018-11-07 18:40:21,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:40:21,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:40:21,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:21,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:40:21,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:40:21,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:21" (1/1) ... [2018-11-07 18:40:21,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe0a250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:21, skipping insertion in model container [2018-11-07 18:40:21,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:21" (1/1) ... [2018-11-07 18:40:21,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:40:21,758 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:40:22,276 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:22,281 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:40:22,380 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:22,406 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:40:22,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22 WrapperNode [2018-11-07 18:40:22,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:22,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:22,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:40:22,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:40:22,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:22,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:40:22,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:40:22,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:40:22,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... [2018-11-07 18:40:22,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:40:22,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:40:22,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:40:22,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:40:22,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:40:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:40:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:40:22,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:40:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:40:22,714 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:40:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:40:22,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:40:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:40:22,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:40:26,127 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:40:26,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:26 BoogieIcfgContainer [2018-11-07 18:40:26,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:40:26,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:40:26,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:40:26,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:40:26,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:40:21" (1/3) ... [2018-11-07 18:40:26,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cca5ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:26, skipping insertion in model container [2018-11-07 18:40:26,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:22" (2/3) ... [2018-11-07 18:40:26,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cca5ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:26, skipping insertion in model container [2018-11-07 18:40:26,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:26" (3/3) ... [2018-11-07 18:40:26,137 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label25_true-unreach-call_false-termination.c [2018-11-07 18:40:26,147 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:40:26,155 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:40:26,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:40:26,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:40:26,208 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:40:26,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:40:26,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:40:26,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:40:26,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:40:26,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:40:26,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:40:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 18:40:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 18:40:26,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:26,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:26,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:26,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1106686112, now seen corresponding path program 1 times [2018-11-07 18:40:26,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:26,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:26,965 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:40:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:27,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:40:27,126 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:27,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:27,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:27,156 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 18:40:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:28,968 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 18:40:28,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:28,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-07 18:40:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:28,992 INFO L225 Difference]: With dead ends: 550 [2018-11-07 18:40:28,992 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 18:40:28,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 18:40:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 18:40:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 18:40:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-07 18:40:29,113 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 126 [2018-11-07 18:40:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:29,114 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-07 18:40:29,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-07 18:40:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 18:40:29,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:29,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:29,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:29,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1635455447, now seen corresponding path program 1 times [2018-11-07 18:40:29,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:29,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:29,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:29,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:29,442 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:40:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:40:29,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:29,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:40:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:40:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:40:29,491 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-07 18:40:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:31,235 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-07 18:40:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:40:31,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-11-07 18:40:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:31,247 INFO L225 Difference]: With dead ends: 1079 [2018-11-07 18:40:31,247 INFO L226 Difference]: Without dead ends: 745 [2018-11-07 18:40:31,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:40:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-07 18:40:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-07 18:40:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-07 18:40:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-07 18:40:31,305 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 136 [2018-11-07 18:40:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:31,305 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-07 18:40:31,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:40:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-07 18:40:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 18:40:31,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:31,312 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:31,312 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:31,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash 852389443, now seen corresponding path program 1 times [2018-11-07 18:40:31,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:31,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:31,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:31,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:31,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:31,757 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-11-07 18:40:31,759 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:31,825 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:31,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:32,555 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:32,557 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 18:40:32,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:32,600 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:33,068 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 79.49% of their original sizes. [2018-11-07 18:40:33,068 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:33,881 INFO L415 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2018-11-07 18:40:33,881 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-07 18:40:33,883 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:33,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:40:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:40:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:40:33,884 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 12 states. [2018-11-07 18:40:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:43,703 INFO L93 Difference]: Finished difference Result 1521 states and 2423 transitions. [2018-11-07 18:40:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:40:43,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2018-11-07 18:40:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:43,709 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 18:40:43,709 INFO L226 Difference]: Without dead ends: 794 [2018-11-07 18:40:43,712 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:40:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-07 18:40:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2018-11-07 18:40:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-07 18:40:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1232 transitions. [2018-11-07 18:40:43,756 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1232 transitions. Word has length 146 [2018-11-07 18:40:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:43,757 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1232 transitions. [2018-11-07 18:40:43,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:40:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1232 transitions. [2018-11-07 18:40:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 18:40:43,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:43,762 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:43,762 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:43,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -768658678, now seen corresponding path program 1 times [2018-11-07 18:40:43,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:43,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:43,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:43,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:43,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:43,954 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-07 18:40:43,955 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:43,961 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:43,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:44,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:44,651 INFO L272 AbstractInterpreter]: Visited 130 different actions 195 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:40:44,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:44,690 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:45,063 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 80.6% of their original sizes. [2018-11-07 18:40:45,063 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:45,529 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-07 18:40:45,529 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:45,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:45,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 18:40:45,532 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:45,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:40:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:40:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:40:45,533 INFO L87 Difference]: Start difference. First operand 794 states and 1232 transitions. Second operand 11 states. [2018-11-07 18:40:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:55,197 INFO L93 Difference]: Finished difference Result 2256 states and 3581 transitions. [2018-11-07 18:40:55,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:40:55,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 148 [2018-11-07 18:40:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:55,206 INFO L225 Difference]: With dead ends: 2256 [2018-11-07 18:40:55,206 INFO L226 Difference]: Without dead ends: 1529 [2018-11-07 18:40:55,210 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:40:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-11-07 18:40:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1504. [2018-11-07 18:40:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-11-07 18:40:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2018 transitions. [2018-11-07 18:40:55,253 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2018 transitions. Word has length 148 [2018-11-07 18:40:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:55,253 INFO L480 AbstractCegarLoop]: Abstraction has 1504 states and 2018 transitions. [2018-11-07 18:40:55,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:40:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2018 transitions. [2018-11-07 18:40:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 18:40:55,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:55,259 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:55,260 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:55,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1323457638, now seen corresponding path program 1 times [2018-11-07 18:40:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:55,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:55,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:55,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:55,458 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:55,458 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-07 18:40:55,459 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:55,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:55,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:55,981 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:55,981 INFO L272 AbstractInterpreter]: Visited 130 different actions 198 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:40:55,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:55,999 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:56,475 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 81.64% of their original sizes. [2018-11-07 18:40:56,476 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:57,069 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-07 18:40:57,070 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:57,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:57,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 23 [2018-11-07 18:40:57,070 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:57,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:40:57,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:40:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:40:57,072 INFO L87 Difference]: Start difference. First operand 1504 states and 2018 transitions. Second operand 18 states. [2018-11-07 18:41:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:11,021 INFO L93 Difference]: Finished difference Result 3226 states and 4399 transitions. [2018-11-07 18:41:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 18:41:11,021 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 155 [2018-11-07 18:41:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:11,030 INFO L225 Difference]: With dead ends: 3226 [2018-11-07 18:41:11,030 INFO L226 Difference]: Without dead ends: 1789 [2018-11-07 18:41:11,035 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-07 18:41:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-11-07 18:41:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1778. [2018-11-07 18:41:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-11-07 18:41:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2323 transitions. [2018-11-07 18:41:11,087 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2323 transitions. Word has length 155 [2018-11-07 18:41:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:11,087 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 2323 transitions. [2018-11-07 18:41:11,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:41:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2323 transitions. [2018-11-07 18:41:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 18:41:11,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:11,094 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:11,094 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:11,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1685172141, now seen corresponding path program 1 times [2018-11-07 18:41:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:11,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 18:41:11,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:11,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:11,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-07 18:41:11,378 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:11,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:11,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:12,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:41:12,541 INFO L272 AbstractInterpreter]: Visited 132 different actions 465 times. Merged at 8 different actions 31 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:12,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:12,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:41:12,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:12,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:41:12,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:12,586 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:41:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:12,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:41:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 18:41:13,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:41:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 18:41:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:41:13,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 18:41:13,695 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:41:13,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 18:41:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 18:41:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:13,697 INFO L87 Difference]: Start difference. First operand 1778 states and 2323 transitions. Second operand 8 states. [2018-11-07 18:41:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:18,278 INFO L93 Difference]: Finished difference Result 5547 states and 8025 transitions. [2018-11-07 18:41:18,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 18:41:18,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2018-11-07 18:41:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:18,296 INFO L225 Difference]: With dead ends: 5547 [2018-11-07 18:41:18,296 INFO L226 Difference]: Without dead ends: 2837 [2018-11-07 18:41:18,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 18:41:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2018-11-07 18:41:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2731. [2018-11-07 18:41:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-11-07 18:41:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3339 transitions. [2018-11-07 18:41:18,395 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3339 transitions. Word has length 167 [2018-11-07 18:41:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:18,396 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 3339 transitions. [2018-11-07 18:41:18,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 18:41:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3339 transitions. [2018-11-07 18:41:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 18:41:18,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:18,407 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:18,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:18,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1098274169, now seen corresponding path program 1 times [2018-11-07 18:41:18,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:18,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:18,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:18,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 18:41:18,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:18,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:18,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-07 18:41:18,901 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:18,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:18,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:19,868 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:19,869 INFO L272 AbstractInterpreter]: Visited 131 different actions 200 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:41:19,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:19,903 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:20,938 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 81.36% of their original sizes. [2018-11-07 18:41:20,939 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:22,053 INFO L415 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2018-11-07 18:41:22,053 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:22,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:22,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 18:41:22,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:22,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 18:41:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 18:41:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-07 18:41:22,055 INFO L87 Difference]: Start difference. First operand 2731 states and 3339 transitions. Second operand 23 states. [2018-11-07 18:41:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:45,393 INFO L93 Difference]: Finished difference Result 5541 states and 6839 transitions. [2018-11-07 18:41:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 18:41:45,393 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 194 [2018-11-07 18:41:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:45,408 INFO L225 Difference]: With dead ends: 5541 [2018-11-07 18:41:45,408 INFO L226 Difference]: Without dead ends: 3151 [2018-11-07 18:41:45,418 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 18:41:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-11-07 18:41:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2869. [2018-11-07 18:41:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2869 states. [2018-11-07 18:41:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3481 transitions. [2018-11-07 18:41:45,489 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3481 transitions. Word has length 194 [2018-11-07 18:41:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:45,490 INFO L480 AbstractCegarLoop]: Abstraction has 2869 states and 3481 transitions. [2018-11-07 18:41:45,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 18:41:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3481 transitions. [2018-11-07 18:41:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 18:41:45,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:45,500 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:45,500 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:45,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1467592292, now seen corresponding path program 1 times [2018-11-07 18:41:45,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:45,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:45,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:45,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:45,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-07 18:41:46,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:46,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:46,081 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-07 18:41:46,081 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:46,084 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:46,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:47,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:41:47,510 INFO L272 AbstractInterpreter]: Visited 133 different actions 473 times. Merged at 9 different actions 35 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:47,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:47,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:41:47,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:47,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:41:47,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:47,533 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:41:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:47,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:41:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 18:41:47,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:41:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 18:41:47,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:41:47,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:41:47,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:41:47,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:41:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:41:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:41:47,939 INFO L87 Difference]: Start difference. First operand 2869 states and 3481 transitions. Second operand 11 states. [2018-11-07 18:41:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:50,964 INFO L93 Difference]: Finished difference Result 10665 states and 13608 transitions. [2018-11-07 18:41:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 18:41:50,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 203 [2018-11-07 18:41:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:51,004 INFO L225 Difference]: With dead ends: 10665 [2018-11-07 18:41:51,005 INFO L226 Difference]: Without dead ends: 7815 [2018-11-07 18:41:51,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:41:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7815 states. [2018-11-07 18:41:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7815 to 7642. [2018-11-07 18:41:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7642 states. [2018-11-07 18:41:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7642 states to 7642 states and 9321 transitions. [2018-11-07 18:41:51,231 INFO L78 Accepts]: Start accepts. Automaton has 7642 states and 9321 transitions. Word has length 203 [2018-11-07 18:41:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:51,232 INFO L480 AbstractCegarLoop]: Abstraction has 7642 states and 9321 transitions. [2018-11-07 18:41:51,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:41:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7642 states and 9321 transitions. [2018-11-07 18:41:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 18:41:51,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:51,258 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:51,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:51,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash -266192138, now seen corresponding path program 1 times [2018-11-07 18:41:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:51,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:51,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-07 18:41:51,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:51,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:51,777 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-07 18:41:51,777 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:51,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:51,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:53,073 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:53,073 INFO L272 AbstractInterpreter]: Visited 132 different actions 722 times. Merged at 9 different actions 43 times. Widened at 1 different actions 1 times. Found 13 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:53,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:53,083 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:53,558 INFO L227 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 80.45% of their original sizes. [2018-11-07 18:41:53,559 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:53,665 INFO L415 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2018-11-07 18:41:53,665 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:53,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 18:41:53,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:53,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:41:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:41:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:53,666 INFO L87 Difference]: Start difference. First operand 7642 states and 9321 transitions. Second operand 11 states. [2018-11-07 18:42:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:00,217 INFO L93 Difference]: Finished difference Result 12211 states and 14904 transitions. [2018-11-07 18:42:00,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 18:42:00,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2018-11-07 18:42:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:00,219 INFO L225 Difference]: With dead ends: 12211 [2018-11-07 18:42:00,219 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:42:00,253 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:42:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:42:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:42:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:42:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:42:00,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-07 18:42:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:00,255 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:42:00,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:42:00,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:42:00,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:42:00,780 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-11-07 18:42:01,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,469 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 236 [2018-11-07 18:42:01,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:01,800 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 210 [2018-11-07 18:42:02,141 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-11-07 18:42:03,740 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2018-11-07 18:42:11,833 WARN L179 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 353 DAG size of output: 200 [2018-11-07 18:42:13,520 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 261 DAG size of output: 122 [2018-11-07 18:42:14,763 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 237 DAG size of output: 124 [2018-11-07 18:42:14,766 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:42:14,767 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-11-07 18:42:14,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:42:14,767 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 18:42:14,767 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 18:42:14,767 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 18:42:14,768 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,769 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 18:42:14,770 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 18:42:14,771 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 18:42:14,772 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 18:42:14,773 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,774 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 18:42:14,775 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 18:42:14,776 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 18:42:14,777 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 18:42:14,778 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,779 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 18:42:14,780 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 18:42:14,781 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 18:42:14,781 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 18:42:14,781 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse27 (<= 4 ~a16~0)) (.cse34 (<= ~a16~0 6)) (.cse25 (< |old(~a16~0)| 4)) (.cse8 (not (= 0 |old(~a7~0)|))) (.cse29 (not (= 1 |old(~a21~0)|))) (.cse30 (< 15 |old(~a8~0)|)) (.cse31 (not (= 8 ~a12~0))) (.cse35 (< 6 |old(~a16~0)|)) (.cse20 (= 1 |old(~a20~0)|)) (.cse0 (= 1 ~a7~0)) (.cse1 (= |old(~a8~0)| ~a8~0)) (.cse2 (= |old(~a20~0)| ~a20~0))) (let ((.cse10 (and .cse0 .cse1 .cse2)) (.cse15 (< 0 |old(~a20~0)|)) (.cse6 (= ~a16~0 5)) (.cse26 (<= ~a16~0 5)) (.cse22 (not (= 1 |old(~a17~0)|))) (.cse28 (< 5 |old(~a16~0)|)) (.cse23 (= ~a17~0 1)) (.cse5 (not (= 1 |old(~a7~0)|))) (.cse32 (= 13 |old(~a8~0)|)) (.cse21 (< |old(~a8~0)| 15)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse24 (not .cse20)) (.cse12 (let ((.cse37 (< 1 |old(~a17~0)|)) (.cse38 (< 1 |old(~a20~0)|)) (.cse39 (< |old(~a20~0)| 0))) (and (or .cse8 .cse29 .cse30 (< |old(~a8~0)| 14) .cse31 .cse37 .cse38 .cse39 .cse25 (< 8 |old(~a16~0)|)) (or .cse8 .cse29 .cse30 .cse31 .cse37 .cse38 .cse39 (< |old(~a16~0)| 3) .cse35)))) (.cse13 (< |old(~a17~0)| 0)) (.cse16 (<= 3 ~a16~0)) (.cse17 (= ~a21~0 1)) (.cse18 (let ((.cse36 (<= 0 ~a17~0))) (or (and .cse36 (<= 14 ~a8~0) .cse27) (and (not (= ~a16~0 0)) .cse36 .cse34)))) (.cse19 (<= ~a17~0 1)) (.cse14 (< |old(~a8~0)| 13)) (.cse7 (< |calculate_output_#in~input| 1)) (.cse4 (= 6 |old(~a16~0)|)) (.cse11 (< 13 |old(~a8~0)|)) (.cse33 (= ~a7~0 |old(~a7~0)|)) (.cse3 (not (= ~a16~0 6)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) .cse6 (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse7 .cse8 .cse9 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse10 .cse11 (< |old(~a20~0)| 1) .cse5) (or .cse4 .cse9 .cse12 .cse13 .cse14 .cse15 .cse7 (and .cse16 .cse17 .cse18 .cse19 (<= 0 ~a20~0) (<= ~a20~0 0))) (or .cse10 .cse5 .cse20 .cse21) (or .cse9 (or .cse22 (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) .cse15) .cse12 (and .cse23 .cse6) .cse7) (or .cse4 .cse9 .cse3 .cse12 .cse13 .cse7) (or .cse24 .cse25 .cse7 .cse9 (and .cse26 .cse23 .cse27) .cse22 .cse28 .cse12 .cse14) (or .cse9 .cse29 (and .cse26 .cse17) .cse30 .cse31 .cse22 .cse24 .cse28 .cse25 .cse5 .cse14 .cse7) (or .cse9 (or .cse29 (not (= 4 |old(~a16~0)|)) (not .cse32)) .cse31 .cse22 .cse24 .cse5 .cse7 (= ~a16~0 4)) (or .cse9 .cse29 .cse30 .cse31 .cse22 .cse24 .cse28 .cse25 (and .cse23 .cse27) .cse5 .cse14 .cse7) (or .cse9 .cse32 (and .cse16 .cse2 .cse17 (<= ~a16~0 8) .cse18 .cse19 .cse33 .cse1) .cse12 .cse13 .cse14 .cse7) (or .cse9 (and (<= 5 ~a16~0) (= ~a17~0 0) .cse34) (or .cse35 (< |old(~a16~0)| 5) (not (= 0 |old(~a17~0)|)) .cse21) .cse24 .cse12 .cse7) (or .cse9 .cse24 .cse12 .cse13 (and .cse16 .cse2 .cse17 .cse18 .cse19 .cse33 .cse1) .cse14 .cse7) (or .cse4 .cse11 (and .cse33 .cse1 .cse3))))) [2018-11-07 18:42:14,781 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 18:42:14,782 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 18:42:14,783 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 18:42:14,784 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 18:42:14,785 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,786 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 18:42:14,787 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 18:42:14,788 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 18:42:14,788 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:42:14,788 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 18:42:14,788 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:42:14,788 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:42:14,789 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:42:14,789 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:42:14,789 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse6 (= ~a12~0 8))) (let ((.cse3 (<= ~a8~0 13)) (.cse5 (not (= ~a16~0 6))) (.cse4 (= 1 ~a7~0)) (.cse0 (<= 1 main_~input~0)) (.cse1 (<= main_~input~0 6)) (.cse2 (let ((.cse7 (<= 0 ~a17~0)) (.cse8 (= ~a21~0 1)) (.cse9 (<= ~a8~0 15)) (.cse10 (<= main_~input~0 2147483647)) (.cse11 (<= ~a17~0 1)) (.cse12 (= ~a7~0 0)) (.cse13 (<= 0 (+ main_~input~0 2147483648))) (.cse14 (<= 0 ~a20~0)) (.cse15 (<= ~a20~0 1))) (or (and .cse7 .cse8 .cse9 (<= ~a16~0 8) .cse10 .cse11 .cse12 .cse13 .cse14 (<= 14 ~a8~0) (<= 4 ~a16~0) .cse6 .cse15) (and (<= 3 ~a16~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ~a16~0 6) (<= 13 ~a8~0) .cse6 .cse15))))) (or (and .cse0 .cse1 .cse2 (not (= ~a8~0 13))) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse3 .cse4 (<= 1 ~a20~0)) (and .cse3 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not .cse6) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse4 .cse5) (not (= 21 ~u~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse4 (not (= ~a20~0 1)) (<= 15 ~a8~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and (= |old(~a20~0)| ~a20~0) .cse0 .cse1 .cse2) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))))) [2018-11-07 18:42:14,789 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 18:42:14,789 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 18:42:14,790 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 18:42:14,790 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse6 (<= 0 ~a17~0)) (.cse7 (= ~a21~0 1)) (.cse8 (<= ~a8~0 15)) (.cse9 (<= ~a17~0 1)) (.cse10 (= ~a7~0 0)) (.cse11 (<= 0 ~a20~0)) (.cse12 (<= ~a20~0 1))) (let ((.cse5 (and (<= 3 ~a16~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~a16~0 6) (<= 13 ~a8~0) .cse12))) (let ((.cse0 (<= ~a8~0 13)) (.cse3 (or .cse5 (and .cse6 .cse7 .cse8 (<= ~a16~0 8) .cse9 .cse10 .cse11 (<= 14 ~a8~0) (<= 4 ~a16~0) .cse12))) (.cse2 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse1 (= 1 ~a7~0))) (or (and .cse0 .cse1 (<= 1 ~a20~0)) (and .cse0 (= ~a7~0 |old(~a7~0)|) .cse2) (and .cse0 (= |old(~a20~0)| ~a20~0) .cse3) (not (= 3 ~c~0)) (and .cse3 .cse4 (<= ~a20~0 0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse3 .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and (<= 1 main_~input~0) (<= main_~input~0 6) .cse5 .cse4) (not (= 21 ~u~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse1 (not (= ~a20~0 1)) (<= 15 ~a8~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))))) [2018-11-07 18:42:14,790 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:42:14,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:42:14 BoogieIcfgContainer [2018-11-07 18:42:14,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:42:14,808 INFO L168 Benchmark]: Toolchain (without parser) took 113125.88 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -652.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 18:42:14,809 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:42:14,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.26 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:14,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:14,811 INFO L168 Benchmark]: Boogie Preprocessor took 99.36 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-07 18:42:14,812 INFO L168 Benchmark]: RCFGBuilder took 3490.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:14,813 INFO L168 Benchmark]: TraceAbstraction took 108677.70 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 18:42:14,817 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.23 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 723.26 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 130.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.36 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 3490.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108677.70 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((a8 <= 13 && 1 == a7) && 1 <= a20) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || ((a8 <= 13 && \old(a20) == a20) && ((((((((((3 <= a16 && 0 <= a17) && a21 == 1) && a8 <= 15) && a17 <= 1) && a7 == 0) && 0 <= a20) && a16 <= 6) && 13 <= a8) && a20 <= 1) || (((((((((0 <= a17 && a21 == 1) && a8 <= 15) && a16 <= 8) && a17 <= 1) && a7 == 0) && 0 <= a20) && 14 <= a8) && 4 <= a16) && a20 <= 1)))) || !(3 == c)) || ((((((((((((3 <= a16 && 0 <= a17) && a21 == 1) && a8 <= 15) && a17 <= 1) && a7 == 0) && 0 <= a20) && a16 <= 6) && 13 <= a8) && a20 <= 1) || (((((((((0 <= a17 && a21 == 1) && a8 <= 15) && a16 <= 8) && a17 <= 1) && a7 == 0) && 0 <= a20) && 14 <= a8) && 4 <= a16) && a20 <= 1)) && !(a8 == 13)) && a20 <= 0)) || (1 == a7 && !(a16 == 6))) || !(1 == \old(a21))) || !(4 == d)) || !(2 == b)) || !(y == 25)) || (((((((((((3 <= a16 && 0 <= a17) && a21 == 1) && a8 <= 15) && a17 <= 1) && a7 == 0) && 0 <= a20) && a16 <= 6) && 13 <= a8) && a20 <= 1) || (((((((((0 <= a17 && a21 == 1) && a8 <= 15) && a16 <= 8) && a17 <= 1) && a7 == 0) && 0 <= a20) && 14 <= a8) && 4 <= a16) && a20 <= 1)) && !(a16 == 6))) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || (((1 <= input && input <= 6) && ((((((((3 <= a16 && 0 <= a17) && a21 == 1) && a8 <= 15) && a17 <= 1) && a7 == 0) && 0 <= a20) && a16 <= 6) && 13 <= a8) && a20 <= 1) && !(a8 == 13))) || !(21 == u)) || (((a8 <= \old(a8) && 1 == a7) && !(a20 == 1)) && 15 <= a8)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 108.5s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 74.7s AutomataDifference, 0.0s DeadEndRemovalTime, 14.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1503 SDtfs, 9754 SDslu, 2016 SDs, 0 SdLazy, 12952 SolverSat, 2269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1744 GetRequests, 1554 SyntacticMatches, 11 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7642occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.0s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9973835918788864 AbsIntWeakeningRatio, 0.21693735498839908 AbsIntAvgWeakeningVarsNumRemoved, 24.327146171693734 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 609 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 164 PreInvPairs, 304 NumberOfFragments, 2040 HoareAnnotationTreeSize, 164 FomulaSimplifications, 12958 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22847 FormulaSimplificationTreeSizeReductionInter, 12.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2226 ConstructedInterpolants, 0 QuantifiedInterpolants, 757878 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1103 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 792/916 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...