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_label26_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:09:00,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:09:00,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:09:00,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:09:00,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:09:00,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:09:00,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:09:00,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:09:00,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:09:00,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:09:00,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:09:00,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:09:00,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:09:00,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:09:00,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:09:00,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:09:00,946 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:09:00,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:09:00,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:09:00,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:09:00,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:09:00,967 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:09:00,969 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:09:00,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:09:00,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:09:00,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:09:00,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:09:00,976 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:09:00,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:09:00,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:09:00,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:09:00,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:09:00,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:09:00,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:09:00,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:09:00,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:09:00,983 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:09:01,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:09:01,012 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:09:01,013 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:09:01,014 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:09:01,015 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:09:01,015 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:09:01,015 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:09:01,015 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:09:01,015 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:09:01,016 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:09:01,016 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:09:01,016 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:09:01,016 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:09:01,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:09:01,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:09:01,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:09:01,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:09:01,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:09:01,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:09:01,018 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:09:01,018 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:09:01,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:09:01,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:09:01,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:09:01,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:09:01,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:09:01,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:09:01,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:09:01,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:09:01,022 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:09:01,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:09:01,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:09:01,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:09:01,023 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:09:01,023 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:09:01,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:09:01,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:09:01,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:09:01,107 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:09:01,107 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:09:01,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2018-11-12 17:09:01,167 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba6e61d2/8e385ead32164e82be520d94f13126f9/FLAG7982b927e [2018-11-12 17:09:01,736 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:09:01,737 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2018-11-12 17:09:01,750 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba6e61d2/8e385ead32164e82be520d94f13126f9/FLAG7982b927e [2018-11-12 17:09:01,764 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba6e61d2/8e385ead32164e82be520d94f13126f9 [2018-11-12 17:09:01,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:09:01,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:09:01,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:01,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:09:01,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:09:01,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:01" (1/1) ... [2018-11-12 17:09:01,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c85c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:01, skipping insertion in model container [2018-11-12 17:09:01,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:01" (1/1) ... [2018-11-12 17:09:01,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:09:01,873 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:09:02,347 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:02,352 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:09:02,450 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:02,468 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:09:02,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02 WrapperNode [2018-11-12 17:09:02,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:02,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:02,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:09:02,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:09:02,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:02,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:09:02,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:09:02,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:09:02,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... [2018-11-12 17:09:02,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:09:02,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:09:02,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:09:02,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:09:02,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:09:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:09:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:09:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:09:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:09:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:09:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:09:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:09:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:09:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:09:05,637 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:09:05,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:05 BoogieIcfgContainer [2018-11-12 17:09:05,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:09:05,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:09:05,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:09:05,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:09:05,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:09:01" (1/3) ... [2018-11-12 17:09:05,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b939ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:05, skipping insertion in model container [2018-11-12 17:09:05,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:02" (2/3) ... [2018-11-12 17:09:05,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b939ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:05, skipping insertion in model container [2018-11-12 17:09:05,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:05" (3/3) ... [2018-11-12 17:09:05,649 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label26_true-unreach-call_false-termination.c [2018-11-12 17:09:05,659 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:09:05,667 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:09:05,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:09:05,719 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:09:05,719 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:09:05,719 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:09:05,719 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:09:05,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:09:05,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:09:05,720 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:09:05,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:09:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:09:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-12 17:09:05,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:05,761 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] [2018-11-12 17:09:05,764 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:05,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash -5660128, now seen corresponding path program 1 times [2018-11-12 17:09:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:05,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:05,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:06,425 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:09:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:06,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:06,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:06,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:06,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:06,560 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:09:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:07,961 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:09:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:07,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-11-12 17:09:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:07,983 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:09:07,983 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:09:07,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:09:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:09:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:09:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-11-12 17:09:08,070 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 110 [2018-11-12 17:09:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:08,071 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-11-12 17:09:08,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-11-12 17:09:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 17:09:08,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:08,078 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:09:08,079 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:08,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1086899647, now seen corresponding path program 1 times [2018-11-12 17:09:08,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:08,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:08,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:08,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:08,366 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:09:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:08,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:08,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:09:08,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:08,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:09:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:09:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:09:08,412 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-11-12 17:09:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:10,492 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-11-12 17:09:10,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:10,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-12 17:09:10,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:10,507 INFO L225 Difference]: With dead ends: 1075 [2018-11-12 17:09:10,507 INFO L226 Difference]: Without dead ends: 741 [2018-11-12 17:09:10,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-12 17:09:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-12 17:09:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-12 17:09:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-11-12 17:09:10,583 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 121 [2018-11-12 17:09:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:10,584 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-11-12 17:09:10,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:09:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-11-12 17:09:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-12 17:09:10,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:10,590 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:09:10,591 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:10,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1300275949, now seen corresponding path program 1 times [2018-11-12 17:09:10,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:10,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:10,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:11,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:11,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:09:11,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:11,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:09:11,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:09:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:11,051 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-11-12 17:09:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:13,350 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-11-12 17:09:13,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:09:13,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-11-12 17:09:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:13,356 INFO L225 Difference]: With dead ends: 1578 [2018-11-12 17:09:13,356 INFO L226 Difference]: Without dead ends: 721 [2018-11-12 17:09:13,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-12 17:09:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-12 17:09:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-12 17:09:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-11-12 17:09:13,397 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 122 [2018-11-12 17:09:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:13,397 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-11-12 17:09:13,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:09:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-11-12 17:09:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 17:09:13,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:13,402 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:09:13,403 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:13,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1606009355, now seen corresponding path program 1 times [2018-11-12 17:09:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:13,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:13,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:13,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 17:09:13,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:13,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 17:09:13,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 17:09:13,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:09:13,694 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 4 states. [2018-11-12 17:09:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:15,379 INFO L93 Difference]: Finished difference Result 1708 states and 2510 transitions. [2018-11-12 17:09:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:09:15,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-12 17:09:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:15,387 INFO L225 Difference]: With dead ends: 1708 [2018-11-12 17:09:15,388 INFO L226 Difference]: Without dead ends: 993 [2018-11-12 17:09:15,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:09:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-11-12 17:09:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-11-12 17:09:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-11-12 17:09:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1361 transitions. [2018-11-12 17:09:15,428 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1361 transitions. Word has length 126 [2018-11-12 17:09:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:15,428 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1361 transitions. [2018-11-12 17:09:15,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 17:09:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1361 transitions. [2018-11-12 17:09:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-12 17:09:15,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:15,434 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-12 17:09:15,434 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:15,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1591148603, now seen corresponding path program 1 times [2018-11-12 17:09:15,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:15,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 17:09:15,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:15,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:15,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-12 17:09:15,822 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:15,885 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:15,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:16,606 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:16,607 INFO L272 AbstractInterpreter]: Visited 70 different actions 70 times. Never merged. Never widened. Performed 891 root evaluator evaluations with a maximum evaluation depth of 6. Performed 891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 42 variables. [2018-11-12 17:09:16,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:16,652 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:17,277 INFO L227 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 79.71% of their original sizes. [2018-11-12 17:09:17,277 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:18,551 INFO L415 sIntCurrentIteration]: We unified 171 AI predicates to 171 [2018-11-12 17:09:18,551 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:18,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:18,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-12 17:09:18,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:18,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:09:18,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:09:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:09:18,556 INFO L87 Difference]: Start difference. First operand 993 states and 1361 transitions. Second operand 12 states. [2018-11-12 17:09:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:26,209 INFO L93 Difference]: Finished difference Result 2041 states and 2796 transitions. [2018-11-12 17:09:26,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:09:26,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-11-12 17:09:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:26,215 INFO L225 Difference]: With dead ends: 2041 [2018-11-12 17:09:26,215 INFO L226 Difference]: Without dead ends: 1054 [2018-11-12 17:09:26,218 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:09:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-11-12 17:09:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2018-11-12 17:09:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-12 17:09:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1427 transitions. [2018-11-12 17:09:26,252 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1427 transitions. Word has length 172 [2018-11-12 17:09:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:26,252 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1427 transitions. [2018-11-12 17:09:26,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:09:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1427 transitions. [2018-11-12 17:09:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-12 17:09:26,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:26,257 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-12 17:09:26,258 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:26,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 790935592, now seen corresponding path program 1 times [2018-11-12 17:09:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:26,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:26,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:26,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 90 proven. 41 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:09:26,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:26,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:26,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-12 17:09:26,858 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:26,864 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:26,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:27,824 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:27,824 INFO L272 AbstractInterpreter]: Visited 116 different actions 184 times. Merged at 5 different actions 5 times. Never widened. Performed 2891 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:27,853 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:28,636 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 80.99% of their original sizes. [2018-11-12 17:09:28,636 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:30,693 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-12 17:09:30,694 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:30,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:30,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [9] total 26 [2018-11-12 17:09:30,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:30,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:09:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:09:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:09:30,696 INFO L87 Difference]: Start difference. First operand 1054 states and 1427 transitions. Second operand 19 states. [2018-11-12 17:09:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:45,838 INFO L93 Difference]: Finished difference Result 2326 states and 3127 transitions. [2018-11-12 17:09:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:09:45,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 181 [2018-11-12 17:09:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:45,845 INFO L225 Difference]: With dead ends: 2326 [2018-11-12 17:09:45,845 INFO L226 Difference]: Without dead ends: 1339 [2018-11-12 17:09:45,849 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:09:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-12 17:09:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1328. [2018-11-12 17:09:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-11-12 17:09:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1721 transitions. [2018-11-12 17:09:45,890 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1721 transitions. Word has length 181 [2018-11-12 17:09:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:45,890 INFO L480 AbstractCegarLoop]: Abstraction has 1328 states and 1721 transitions. [2018-11-12 17:09:45,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:09:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1721 transitions. [2018-11-12 17:09:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 17:09:45,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:45,896 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:09:45,897 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:45,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash -79361511, now seen corresponding path program 1 times [2018-11-12 17:09:45,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:45,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:46,427 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:09:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:09:46,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:46,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:46,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-12 17:09:46,605 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:46,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:46,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:47,055 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:47,055 INFO L272 AbstractInterpreter]: Visited 115 different actions 182 times. Merged at 5 different actions 5 times. Never widened. Performed 2976 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:47,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:47,060 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:47,989 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 80.91% of their original sizes. [2018-11-12 17:09:47,990 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:50,443 INFO L415 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2018-11-12 17:09:50,444 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:50,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:50,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-12 17:09:50,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:50,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 17:09:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 17:09:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:09:50,446 INFO L87 Difference]: Start difference. First operand 1328 states and 1721 transitions. Second operand 25 states. [2018-11-12 17:10:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:14,324 INFO L93 Difference]: Finished difference Result 2735 states and 3615 transitions. [2018-11-12 17:10:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:10:14,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 194 [2018-11-12 17:10:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:14,332 INFO L225 Difference]: With dead ends: 2735 [2018-11-12 17:10:14,332 INFO L226 Difference]: Without dead ends: 1748 [2018-11-12 17:10:14,337 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 17:10:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-11-12 17:10:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1466. [2018-11-12 17:10:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-11-12 17:10:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1863 transitions. [2018-11-12 17:10:14,383 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1863 transitions. Word has length 194 [2018-11-12 17:10:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:14,384 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 1863 transitions. [2018-11-12 17:10:14,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 17:10:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1863 transitions. [2018-11-12 17:10:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-12 17:10:14,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:14,391 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:14,392 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:14,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1649739324, now seen corresponding path program 1 times [2018-11-12 17:10:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:14,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:14,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:10:15,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:15,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:15,062 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-12 17:10:15,063 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:15,067 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:15,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:16,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:16,847 INFO L272 AbstractInterpreter]: Visited 117 different actions 541 times. Merged at 9 different actions 46 times. Widened at 1 different actions 1 times. Performed 8822 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8822 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:10:16,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:16,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:16,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:16,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:10:16,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:16,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:16,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-12 17:10:17,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:17,573 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 17:10:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:10:18,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:18,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:10:18,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:18,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:10:18,014 INFO L87 Difference]: Start difference. First operand 1466 states and 1863 transitions. Second operand 11 states. [2018-11-12 17:10:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:21,096 INFO L93 Difference]: Finished difference Result 5226 states and 7193 transitions. [2018-11-12 17:10:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 17:10:21,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 203 [2018-11-12 17:10:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:21,115 INFO L225 Difference]: With dead ends: 5226 [2018-11-12 17:10:21,116 INFO L226 Difference]: Without dead ends: 3965 [2018-11-12 17:10:21,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:10:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2018-11-12 17:10:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3805. [2018-11-12 17:10:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2018-11-12 17:10:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 4898 transitions. [2018-11-12 17:10:21,248 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 4898 transitions. Word has length 203 [2018-11-12 17:10:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:21,248 INFO L480 AbstractCegarLoop]: Abstraction has 3805 states and 4898 transitions. [2018-11-12 17:10:21,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 4898 transitions. [2018-11-12 17:10:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-12 17:10:21,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:21,265 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:21,265 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:21,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash 304635493, now seen corresponding path program 1 times [2018-11-12 17:10:21,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:21,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:21,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:21,804 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:10:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:10:22,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:22,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:22,001 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-11-12 17:10:22,002 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [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], [225], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:22,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:22,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:22,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:22,308 INFO L272 AbstractInterpreter]: Visited 115 different actions 182 times. Merged at 5 different actions 5 times. Never widened. Performed 2443 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2443 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:10:22,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:22,318 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:22,836 INFO L227 lantSequenceWeakener]: Weakened 125 states. On average, predicates are now at 80.02% of their original sizes. [2018-11-12 17:10:22,836 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:23,117 INFO L415 sIntCurrentIteration]: We unified 219 AI predicates to 219 [2018-11-12 17:10:23,117 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:23,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:23,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:10:23,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:23,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:10:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:10:23,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:10:23,119 INFO L87 Difference]: Start difference. First operand 3805 states and 4898 transitions. Second operand 18 states. [2018-11-12 17:10:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:37,293 INFO L93 Difference]: Finished difference Result 7406 states and 9611 transitions. [2018-11-12 17:10:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:10:37,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2018-11-12 17:10:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:37,309 INFO L225 Difference]: With dead ends: 7406 [2018-11-12 17:10:37,310 INFO L226 Difference]: Without dead ends: 3944 [2018-11-12 17:10:37,321 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:10:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2018-11-12 17:10:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3943. [2018-11-12 17:10:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3943 states. [2018-11-12 17:10:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 5043 transitions. [2018-11-12 17:10:37,418 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 5043 transitions. Word has length 220 [2018-11-12 17:10:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:37,419 INFO L480 AbstractCegarLoop]: Abstraction has 3943 states and 5043 transitions. [2018-11-12 17:10:37,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:10:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 5043 transitions. [2018-11-12 17:10:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-12 17:10:37,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:37,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-12 17:10:37,432 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:37,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 743357016, now seen corresponding path program 1 times [2018-11-12 17:10:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:37,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 173 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:10:38,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:38,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:38,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-12 17:10:38,051 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [105], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:38,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:38,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:39,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:39,604 INFO L272 AbstractInterpreter]: Visited 117 different actions 542 times. Merged at 9 different actions 46 times. Widened at 1 different actions 1 times. Performed 8580 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8580 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:10:39,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:39,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:39,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:39,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:10:39,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:39,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:39,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 162 proven. 25 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:10:39,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:10:40,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:40,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-12 17:10:40,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:40,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:10:40,289 INFO L87 Difference]: Start difference. First operand 3943 states and 5043 transitions. Second operand 11 states. [2018-11-12 17:10:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:44,264 INFO L93 Difference]: Finished difference Result 9237 states and 12810 transitions. [2018-11-12 17:10:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 17:10:44,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-11-12 17:10:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:44,304 INFO L225 Difference]: With dead ends: 9237 [2018-11-12 17:10:44,304 INFO L226 Difference]: Without dead ends: 5637 [2018-11-12 17:10:44,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 484 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:10:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2018-11-12 17:10:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 4925. [2018-11-12 17:10:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4925 states. [2018-11-12 17:10:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6092 transitions. [2018-11-12 17:10:44,475 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6092 transitions. Word has length 232 [2018-11-12 17:10:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:44,476 INFO L480 AbstractCegarLoop]: Abstraction has 4925 states and 6092 transitions. [2018-11-12 17:10:44,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6092 transitions. [2018-11-12 17:10:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-12 17:10:44,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:44,492 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:10:44,492 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:44,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1140587166, now seen corresponding path program 1 times [2018-11-12 17:10:44,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:44,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:44,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 190 proven. 114 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-12 17:10:44,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:44,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:44,729 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-11-12 17:10:44,729 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [49], [50], [54], [58], [62], [66], [70], [73], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:44,731 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:44,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:46,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:46,816 INFO L272 AbstractInterpreter]: Visited 119 different actions 917 times. Merged at 11 different actions 90 times. Widened at 1 different actions 3 times. Performed 13724 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 27 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:10:46,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:46,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:46,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:46,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:10:46,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:46,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:46,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-12 17:10:47,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-12 17:10:47,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:47,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2018-11-12 17:10:47,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:47,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:10:47,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:10:47,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:10:47,206 INFO L87 Difference]: Start difference. First operand 4925 states and 6092 transitions. Second operand 12 states. [2018-11-12 17:10:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:52,097 INFO L93 Difference]: Finished difference Result 12774 states and 16168 transitions. [2018-11-12 17:10:52,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 17:10:52,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 251 [2018-11-12 17:10:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:52,146 INFO L225 Difference]: With dead ends: 12774 [2018-11-12 17:10:52,146 INFO L226 Difference]: Without dead ends: 8330 [2018-11-12 17:10:52,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 17:10:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2018-11-12 17:10:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 7689. [2018-11-12 17:10:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-11-12 17:10:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 9150 transitions. [2018-11-12 17:10:52,357 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 9150 transitions. Word has length 251 [2018-11-12 17:10:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:52,357 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 9150 transitions. [2018-11-12 17:10:52,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:10:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 9150 transitions. [2018-11-12 17:10:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-12 17:10:52,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:52,374 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:10:52,374 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:52,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1813987248, now seen corresponding path program 1 times [2018-11-12 17:10:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:52,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-12 17:10:52,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:52,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:52,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-11-12 17:10:52,891 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [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], [517], [519], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:52,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:52,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:53,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:53,717 INFO L272 AbstractInterpreter]: Visited 117 different actions 417 times. Merged at 8 different actions 27 times. Never widened. Performed 5981 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5981 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:53,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:53,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:53,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:53,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:10:53,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:53,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:53,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-12 17:10:54,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-12 17:10:54,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:54,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:10:54,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:54,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:10:54,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:10:54,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:10:54,483 INFO L87 Difference]: Start difference. First operand 7689 states and 9150 transitions. Second operand 9 states. [2018-11-12 17:10:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:57,249 INFO L93 Difference]: Finished difference Result 15140 states and 17987 transitions. [2018-11-12 17:10:57,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:10:57,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 291 [2018-11-12 17:10:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:57,253 INFO L225 Difference]: With dead ends: 15140 [2018-11-12 17:10:57,253 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:10:57,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 594 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:10:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:10:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:10:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:10:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:10:57,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2018-11-12 17:10:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:57,296 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:10:57,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:10:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:10:57,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:10:57,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:10:57,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,280 WARN L179 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 217 [2018-11-12 17:10:58,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:10:58,988 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 237 [2018-11-12 17:10:59,971 WARN L179 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-11-12 17:11:00,532 WARN L179 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 86 [2018-11-12 17:11:06,029 WARN L179 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 348 DAG size of output: 166 [2018-11-12 17:11:06,966 WARN L179 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 107 [2018-11-12 17:11:08,041 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 258 DAG size of output: 107 [2018-11-12 17:11:08,044 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:08,044 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (<= ~a17~0 |old(~a17~0)|) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,045 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:11:08,046 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:11:08,047 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2018-11-12 17:11:08,048 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:11:08,049 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,050 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:11:08,051 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,052 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,053 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:11:08,054 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,055 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:11:08,056 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:11:08,057 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:11:08,058 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:11:08,059 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse19 (= ~a16~0 |old(~a16~0)|)) (.cse16 (<= ~a17~0 |old(~a17~0)|)) (.cse18 (= ~a7~0 |old(~a7~0)|)) (.cse20 (<= |old(~a8~0)| ~a8~0)) (.cse26 (= 1 ~a21~0)) (.cse21 (= ~a20~0 |old(~a20~0)|)) (.cse28 (= ~a8~0 15))) (let ((.cse14 (< 6 |calculate_output_#in~input|)) (.cse11 (and .cse28 (= ~a17~0 0))) (.cse13 (< |calculate_output_#in~input| 1)) (.cse15 (= 6 |old(~a16~0)|)) (.cse3 (< 0 |old(~a17~0)|)) (.cse22 (< 0 |old(~a21~0)|)) (.cse17 (= ~a21~0 |old(~a21~0)|)) (.cse4 (and .cse16 .cse18 .cse20 .cse26 .cse21 (= 5 ~a16~0))) (.cse7 (and .cse16 .cse18 .cse19 .cse20 .cse26 .cse21)) (.cse25 (< |old(~a8~0)| 15)) (.cse9 (not (= 1 |old(~a20~0)|))) (.cse6 (not (= 4 |old(~a16~0)|))) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse5 (= 1 |old(~a7~0)|)) (.cse8 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse10 (not (= 15 |old(~a8~0)|))) (.cse1 (not (= 5 |old(~a16~0)|))) (.cse2 (not (= 8 ~a12~0))) (.cse23 (< 0 |old(~a20~0)|)) (.cse27 (not (= 1 |old(~a17~0)|))) (.cse12 (and .cse28 (= ~a17~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2) (or (or .cse8 .cse0 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse9 .cse10 (not (= 0 |old(~a17~0)|)) .cse2) .cse11) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) .cse12 (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse13 .cse8 .cse14 (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 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse2 .cse22) (or .cse14 (or .cse8 .cse0) .cse6 .cse2 .cse11 .cse3 .cse9 .cse10 (< |old(~a17~0)| 0) .cse13) (or .cse15 .cse0 .cse2 .cse3 .cse23 .cse7) (or (or .cse2 (< |old(~a20~0)| 1) .cse22) (and .cse16 .cse20 (and .cse18 (= |old(~a20~0)| ~a20~0) .cse24) .cse17)) (or .cse0 .cse5 .cse9 .cse7 .cse2) (or .cse0 .cse5 .cse1 .cse4 .cse2 .cse25) (or .cse0 .cse5 .cse7 .cse2 .cse25 .cse23) (or .cse0 .cse9 .cse6 (and (= 1 ~a7~0) (= 1 ~a20~0) (= 13 ~a8~0) .cse24 .cse26 (= 1 ~a17~0)) .cse2 (not .cse5) (not (= 13 |old(~a8~0)|)) .cse27) (or (or .cse8 .cse0 .cse10 .cse1 .cse2 (< |old(~a20~0)| 0) .cse23 .cse27) .cse12)))) [2018-11-12 17:11:08,059 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:11:08,059 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,059 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,059 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,059 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:11:08,060 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,061 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:11:08,062 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,063 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:11:08,064 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:11:08,065 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:08,065 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) (= ~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) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-12 17:11:08,065 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:11:08,065 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:08,065 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= ~a8~0 15) (= 1 ~a21~0) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= 5 ~a16~0)) (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-12 17:11:08,065 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:08,066 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse3 (= 5 ~a16~0)) (.cse4 (<= ~a17~0 0)) (.cse5 (not (= ~a16~0 6))) (.cse7 (<= ~a21~0 0)) (.cse1 (= 1 ~a21~0)) (.cse0 (not (= ~a7~0 1))) (.cse2 (<= 15 ~a8~0)) (.cse6 (<= ~a20~0 0))) (or (and .cse0 (= ~a16~0 4) .cse1) (and .cse0 (= |old(~a20~0)| ~a20~0) .cse1) (and .cse0 .cse2 .cse1 .cse3) (and .cse1 .cse4 .cse3) (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)) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) .cse1 (= 1 ~a17~0)) (not (= 21 ~u~0)) (and .cse5 .cse1 .cse4 .cse6) (not (= 22 ~v~0)) (and .cse7 .cse5) (and .cse7 (<= 1 ~a20~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 .cse1 (and .cse0 .cse2 .cse6)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-12 17:11:08,066 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:11:08,066 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:11:08,066 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:11:08,066 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 5 ~a16~0)) (.cse4 (<= ~a17~0 0)) (.cse5 (not (= ~a16~0 6))) (.cse7 (<= ~a21~0 0)) (.cse1 (= 1 ~a21~0)) (.cse0 (not (= ~a7~0 1))) (.cse2 (<= 15 ~a8~0)) (.cse6 (<= ~a20~0 0))) (or (and .cse0 (= ~a16~0 4) .cse1) (and .cse0 (= |old(~a20~0)| ~a20~0) .cse1) (and .cse0 .cse2 .cse1 .cse3) (and .cse1 .cse4 .cse3) (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)) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) .cse1 (= 1 ~a17~0)) (not (= 21 ~u~0)) (and .cse5 .cse1 .cse4 .cse6) (not (= 22 ~v~0)) (and .cse7 .cse5) (and .cse7 (<= 1 ~a20~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 .cse1 (and .cse0 .cse2 .cse6)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-12 17:11:08,066 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:08,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:11:08 BoogieIcfgContainer [2018-11-12 17:11:08,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:11:08,081 INFO L168 Benchmark]: Toolchain (without parser) took 126306.05 ms. Allocated memory was 1.5 GB in the beginning and 4.0 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: -628.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:08,082 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:11:08,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.55 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-12 17:11:08,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.9 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:08,085 INFO L168 Benchmark]: Boogie Preprocessor took 102.81 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:11:08,085 INFO L168 Benchmark]: RCFGBuilder took 2932.24 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: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:08,086 INFO L168 Benchmark]: TraceAbstraction took 122441.25 ms. Allocated memory was 2.3 GB in the beginning and 4.0 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: 37.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:08,091 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.28 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 691.55 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 133.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.9 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.81 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 2932.24 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: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122441.25 ms. Allocated memory was 2.3 GB in the beginning and 4.0 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: 37.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: ((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && 1 == a21) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a21)) || (((!(a7 == 1) && 15 <= a8) && 1 == a21) && 5 == a16)) || ((1 == a21 && a17 <= 0) && 5 == a16)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(21 == u)) || (((!(a16 == 6) && 1 == a21) && a17 <= 0) && a20 <= 0)) || !(22 == v)) || (a21 <= 0 && !(a16 == 6))) || (a21 <= 0 && 1 <= a20)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || (1 == a21 && (!(a7 == 1) && 15 <= a8) && a20 <= 0)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 122.3s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 83.3s AutomataDifference, 0.0s DeadEndRemovalTime, 10.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1763 SDtfs, 13525 SDslu, 2729 SDs, 0 SdLazy, 19987 SolverSat, 2792 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2994 GetRequests, 2716 SyntacticMatches, 19 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7689occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.8s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9971080870584487 AbsIntWeakeningRatio, 0.22280471821756226 AbsIntAvgWeakeningVarsNumRemoved, 20.806028833551768 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1824 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 237 PreInvPairs, 395 NumberOfFragments, 1100 HoareAnnotationTreeSize, 237 FomulaSimplifications, 45476 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9779 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 3200 NumberOfCodeBlocks, 3200 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1968637 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2637 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 3657/4031 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...