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/Problem16_label50_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:56:18,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:56:18,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:56:18,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:56:18,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:56:18,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:56:18,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:56:18,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:56:18,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:56:18,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:56:18,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:56:18,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:56:18,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:56:18,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:56:18,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:56:18,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:56:18,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:56:18,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:56:18,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:56:18,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:56:18,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:56:18,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:56:18,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:56:18,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:56:18,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:56:18,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:56:18,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:56:18,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:56:18,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:56:18,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:56:18,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:56:18,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:56:18,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:56:18,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:56:18,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:56:18,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:56:18,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:56:18,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:56:18,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:56:18,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:56:18,113 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:56:18,113 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:56:18,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:56:18,114 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:56:18,114 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:56:18,114 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:56:18,114 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:56:18,114 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:56:18,114 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:56:18,115 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:56:18,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:56:18,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:56:18,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:56:18,117 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:56:18,117 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:56:18,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:56:18,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:56:18,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:56:18,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:56:18,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:56:18,119 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:56:18,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:56:18,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:56:18,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:56:18,120 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:56:18,120 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:56:18,121 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:56:18,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:56:18,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:56:18,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:56:18,121 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:56:18,122 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:56:18,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:56:18,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:56:18,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:56:18,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:56:18,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:56:18,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label50_true-unreach-call.c [2018-11-07 20:56:18,292 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f1b83db/c8e4e84337c74a969edfde7baf62ad9a/FLAG3853fb468 [2018-11-07 20:56:19,028 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:56:19,029 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label50_true-unreach-call.c [2018-11-07 20:56:19,047 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f1b83db/c8e4e84337c74a969edfde7baf62ad9a/FLAG3853fb468 [2018-11-07 20:56:19,062 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f1b83db/c8e4e84337c74a969edfde7baf62ad9a [2018-11-07 20:56:19,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:56:19,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:56:19,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:56:19,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:56:19,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:56:19,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:56:19" (1/1) ... [2018-11-07 20:56:19,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567b4d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:19, skipping insertion in model container [2018-11-07 20:56:19,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:56:19" (1/1) ... [2018-11-07 20:56:19,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:56:19,175 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:56:19,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:56:19,916 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:56:20,207 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:56:20,229 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:56:20,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20 WrapperNode [2018-11-07 20:56:20,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:56:20,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:56:20,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:56:20,231 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:56:20,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:56:20,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:56:20,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:56:20,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:56:20,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... [2018-11-07 20:56:20,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:56:20,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:56:20,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:56:20,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:56:20,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:56:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:56:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:56:20,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:56:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:56:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:56:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:56:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:56:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:56:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:56:20,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:56:26,917 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:56:26,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:26 BoogieIcfgContainer [2018-11-07 20:56:26,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:56:26,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:56:26,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:56:26,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:56:26,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:56:19" (1/3) ... [2018-11-07 20:56:26,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b302e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:56:26, skipping insertion in model container [2018-11-07 20:56:26,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:56:20" (2/3) ... [2018-11-07 20:56:26,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b302e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:56:26, skipping insertion in model container [2018-11-07 20:56:26,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:56:26" (3/3) ... [2018-11-07 20:56:26,927 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label50_true-unreach-call.c [2018-11-07 20:56:26,937 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:56:26,946 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:56:26,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:56:27,013 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:56:27,013 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:56:27,013 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:56:27,014 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:56:27,014 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:56:27,014 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:56:27,014 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:56:27,014 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:56:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-11-07 20:56:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 20:56:27,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:27,061 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] [2018-11-07 20:56:27,064 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:27,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1374048196, now seen corresponding path program 1 times [2018-11-07 20:56:27,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:27,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:56:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:56:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:56:27,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:56:27,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:56:27,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:56:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:56:27,721 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-11-07 20:56:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:56:34,042 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-11-07 20:56:34,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:56:34,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-11-07 20:56:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:56:34,070 INFO L225 Difference]: With dead ends: 1513 [2018-11-07 20:56:34,071 INFO L226 Difference]: Without dead ends: 1097 [2018-11-07 20:56:34,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:56:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-11-07 20:56:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2018-11-07 20:56:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-07 20:56:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1954 transitions. [2018-11-07 20:56:34,210 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1954 transitions. Word has length 52 [2018-11-07 20:56:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:56:34,211 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1954 transitions. [2018-11-07 20:56:34,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:56:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1954 transitions. [2018-11-07 20:56:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 20:56:34,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:34,226 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:56:34,226 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:34,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2033575421, now seen corresponding path program 1 times [2018-11-07 20:56:34,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:34,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:34,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:34,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:34,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:56:34,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:56:34,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:56:34,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:56:34,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:56:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:56:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:56:34,690 INFO L87 Difference]: Start difference. First operand 1097 states and 1954 transitions. Second operand 6 states. [2018-11-07 20:56:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:56:39,329 INFO L93 Difference]: Finished difference Result 3259 states and 5952 transitions. [2018-11-07 20:56:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:56:39,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-11-07 20:56:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:56:39,364 INFO L225 Difference]: With dead ends: 3259 [2018-11-07 20:56:39,365 INFO L226 Difference]: Without dead ends: 2168 [2018-11-07 20:56:39,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:56:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-11-07 20:56:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2142. [2018-11-07 20:56:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-11-07 20:56:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3739 transitions. [2018-11-07 20:56:39,480 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3739 transitions. Word has length 123 [2018-11-07 20:56:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:56:39,481 INFO L480 AbstractCegarLoop]: Abstraction has 2142 states and 3739 transitions. [2018-11-07 20:56:39,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:56:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3739 transitions. [2018-11-07 20:56:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 20:56:39,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:39,488 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:56:39,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:39,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:39,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1172506123, now seen corresponding path program 1 times [2018-11-07 20:56:39,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:39,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:39,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:39,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:39,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:56:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:56:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:56:39,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:56:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:56:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:56:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:56:39,757 INFO L87 Difference]: Start difference. First operand 2142 states and 3739 transitions. Second operand 6 states. [2018-11-07 20:56:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:56:44,904 INFO L93 Difference]: Finished difference Result 7053 states and 12688 transitions. [2018-11-07 20:56:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:56:44,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-07 20:56:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:56:44,944 INFO L225 Difference]: With dead ends: 7053 [2018-11-07 20:56:44,945 INFO L226 Difference]: Without dead ends: 4917 [2018-11-07 20:56:44,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:56:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2018-11-07 20:56:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4877. [2018-11-07 20:56:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2018-11-07 20:56:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7891 transitions. [2018-11-07 20:56:45,120 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7891 transitions. Word has length 151 [2018-11-07 20:56:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:56:45,121 INFO L480 AbstractCegarLoop]: Abstraction has 4877 states and 7891 transitions. [2018-11-07 20:56:45,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:56:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7891 transitions. [2018-11-07 20:56:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 20:56:45,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:45,125 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:56:45,125 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:45,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 405483975, now seen corresponding path program 1 times [2018-11-07 20:56:45,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:45,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:45,388 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:56:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:56:45,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:56:45,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:56:45,450 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:56:45,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:56:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:56:45,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:56:45,452 INFO L87 Difference]: Start difference. First operand 4877 states and 7891 transitions. Second operand 6 states. [2018-11-07 20:56:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:56:48,051 INFO L93 Difference]: Finished difference Result 11909 states and 19972 transitions. [2018-11-07 20:56:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:56:48,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2018-11-07 20:56:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:56:48,109 INFO L225 Difference]: With dead ends: 11909 [2018-11-07 20:56:48,110 INFO L226 Difference]: Without dead ends: 7038 [2018-11-07 20:56:48,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:56:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2018-11-07 20:56:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6977. [2018-11-07 20:56:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-11-07 20:56:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 9942 transitions. [2018-11-07 20:56:48,382 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 9942 transitions. Word has length 169 [2018-11-07 20:56:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:56:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 6977 states and 9942 transitions. [2018-11-07 20:56:48,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:56:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 9942 transitions. [2018-11-07 20:56:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 20:56:48,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:48,389 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:56:48,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash 573454830, now seen corresponding path program 1 times [2018-11-07 20:56:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:48,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:48,753 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:56:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:56:49,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:56:49,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:56:49,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:56:49,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:56:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:56:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:56:49,362 INFO L87 Difference]: Start difference. First operand 6977 states and 9942 transitions. Second operand 6 states. [2018-11-07 20:56:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:56:52,986 INFO L93 Difference]: Finished difference Result 17709 states and 25496 transitions. [2018-11-07 20:56:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:56:52,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-11-07 20:56:52,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:56:53,044 INFO L225 Difference]: With dead ends: 17709 [2018-11-07 20:56:53,045 INFO L226 Difference]: Without dead ends: 10738 [2018-11-07 20:56:53,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:56:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10738 states. [2018-11-07 20:56:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10738 to 10702. [2018-11-07 20:56:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2018-11-07 20:56:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 14504 transitions. [2018-11-07 20:56:53,384 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 14504 transitions. Word has length 216 [2018-11-07 20:56:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:56:53,384 INFO L480 AbstractCegarLoop]: Abstraction has 10702 states and 14504 transitions. [2018-11-07 20:56:53,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:56:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 14504 transitions. [2018-11-07 20:56:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 20:56:53,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:53,391 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:56:53,391 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:53,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1283886317, now seen corresponding path program 1 times [2018-11-07 20:56:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:53,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:53,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-07 20:56:53,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:56:53,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:56:53,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:56:53,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:56:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:56:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:56:53,675 INFO L87 Difference]: Start difference. First operand 10702 states and 14504 transitions. Second operand 4 states. [2018-11-07 20:56:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:56:57,979 INFO L93 Difference]: Finished difference Result 27183 states and 37572 transitions. [2018-11-07 20:56:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:56:57,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-11-07 20:56:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:56:58,052 INFO L225 Difference]: With dead ends: 27183 [2018-11-07 20:56:58,052 INFO L226 Difference]: Without dead ends: 16487 [2018-11-07 20:56:58,092 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-07 20:56:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2018-11-07 20:56:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16487. [2018-11-07 20:56:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2018-11-07 20:56:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 21483 transitions. [2018-11-07 20:56:58,502 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 21483 transitions. Word has length 253 [2018-11-07 20:56:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:56:58,503 INFO L480 AbstractCegarLoop]: Abstraction has 16487 states and 21483 transitions. [2018-11-07 20:56:58,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:56:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 21483 transitions. [2018-11-07 20:56:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-11-07 20:56:58,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:56:58,543 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:56:58,543 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:56:58,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:56:58,544 INFO L82 PathProgramCache]: Analyzing trace with hash -207588909, now seen corresponding path program 1 times [2018-11-07 20:56:58,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:56:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:58,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:56:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:56:58,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:56:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:56:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 254 proven. 115 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-07 20:56:59,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:56:59,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:56:59,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 438 with the following transitions: [2018-11-07 20:56:59,271 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 20:56:59,342 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:56:59,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:57:00,239 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:57:00,241 INFO L272 AbstractInterpreter]: Visited 145 different actions 145 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:57:00,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:57:00,295 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:57:02,171 INFO L227 lantSequenceWeakener]: Weakened 409 states. On average, predicates are now at 77.71% of their original sizes. [2018-11-07 20:57:02,172 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:57:04,071 INFO L415 sIntCurrentIteration]: We unified 436 AI predicates to 436 [2018-11-07 20:57:04,072 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:57:04,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:57:04,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:57:04,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:57:04,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:57:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:57:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:57:04,075 INFO L87 Difference]: Start difference. First operand 16487 states and 21483 transitions. Second operand 11 states. [2018-11-07 20:57:09,500 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:57:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:57:40,360 INFO L93 Difference]: Finished difference Result 33311 states and 43366 transitions. [2018-11-07 20:57:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 20:57:40,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 437 [2018-11-07 20:57:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:57:40,444 INFO L225 Difference]: With dead ends: 33311 [2018-11-07 20:57:40,444 INFO L226 Difference]: Without dead ends: 16830 [2018-11-07 20:57:40,505 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 441 GetRequests, 331 SyntacticMatches, 96 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:57:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16830 states. [2018-11-07 20:57:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16830 to 16825. [2018-11-07 20:57:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16825 states. [2018-11-07 20:57:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16825 states to 16825 states and 21830 transitions. [2018-11-07 20:57:40,906 INFO L78 Accepts]: Start accepts. Automaton has 16825 states and 21830 transitions. Word has length 437 [2018-11-07 20:57:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:57:40,906 INFO L480 AbstractCegarLoop]: Abstraction has 16825 states and 21830 transitions. [2018-11-07 20:57:40,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:57:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 16825 states and 21830 transitions. [2018-11-07 20:57:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-11-07 20:57:40,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:57:40,954 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:57:40,954 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:57:40,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:57:40,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1522548143, now seen corresponding path program 1 times [2018-11-07 20:57:40,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:57:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:57:40,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:57:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:57:40,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:57:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:57:41,350 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 20:57:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 257 proven. 311 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-07 20:57:42,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:57:42,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:57:42,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 530 with the following transitions: [2018-11-07 20:57:42,921 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 20:57:42,930 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:57:42,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:57:43,049 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:57:43,435 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:57:43,435 INFO L272 AbstractInterpreter]: Visited 149 different actions 434 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:57:43,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:57:43,443 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:57:44,215 INFO L227 lantSequenceWeakener]: Weakened 409 states. On average, predicates are now at 77.71% of their original sizes. [2018-11-07 20:57:44,215 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:57:46,493 INFO L415 sIntCurrentIteration]: We unified 528 AI predicates to 528 [2018-11-07 20:57:46,493 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:57:46,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:57:46,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-11-07 20:57:46,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:57:46,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 20:57:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 20:57:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-07 20:57:46,496 INFO L87 Difference]: Start difference. First operand 16825 states and 21830 transitions. Second operand 15 states. [2018-11-07 20:58:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:58:12,992 INFO L93 Difference]: Finished difference Result 33973 states and 44122 transitions. [2018-11-07 20:58:12,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 20:58:12,992 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 529 [2018-11-07 20:58:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:58:13,060 INFO L225 Difference]: With dead ends: 33973 [2018-11-07 20:58:13,060 INFO L226 Difference]: Without dead ends: 17492 [2018-11-07 20:58:13,106 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 535 GetRequests, 406 SyntacticMatches, 109 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 20:58:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17492 states. [2018-11-07 20:58:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17492 to 17483. [2018-11-07 20:58:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17483 states. [2018-11-07 20:58:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17483 states to 17483 states and 22569 transitions. [2018-11-07 20:58:13,409 INFO L78 Accepts]: Start accepts. Automaton has 17483 states and 22569 transitions. Word has length 529 [2018-11-07 20:58:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:58:13,409 INFO L480 AbstractCegarLoop]: Abstraction has 17483 states and 22569 transitions. [2018-11-07 20:58:13,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 20:58:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17483 states and 22569 transitions. [2018-11-07 20:58:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-11-07 20:58:13,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:58:13,464 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:58:13,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:58:13,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:58:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1766035367, now seen corresponding path program 1 times [2018-11-07 20:58:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:58:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:58:13,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:58:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:58:13,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:58:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:58:14,178 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 20:58:14,937 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 20:58:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 316 proven. 242 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-11-07 20:58:15,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:58:15,646 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:58:15,646 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 566 with the following transitions: [2018-11-07 20:58:15,646 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 20:58:15,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:58:15,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:58:16,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:58:16,752 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:58:16,753 INFO L272 AbstractInterpreter]: Visited 149 different actions 434 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:58:16,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:58:16,793 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:58:17,644 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 77.33% of their original sizes. [2018-11-07 20:58:17,644 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:58:18,136 INFO L415 sIntCurrentIteration]: We unified 564 AI predicates to 564 [2018-11-07 20:58:18,137 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:58:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:58:18,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2018-11-07 20:58:18,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:58:18,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:58:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:58:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:58:18,140 INFO L87 Difference]: Start difference. First operand 17483 states and 22569 transitions. Second operand 20 states. [2018-11-07 20:59:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:59:15,012 INFO L93 Difference]: Finished difference Result 36673 states and 47238 transitions. [2018-11-07 20:59:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:59:15,012 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 565 [2018-11-07 20:59:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:59:15,068 INFO L225 Difference]: With dead ends: 36673 [2018-11-07 20:59:15,068 INFO L226 Difference]: Without dead ends: 19534 [2018-11-07 20:59:15,109 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 583 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 20:59:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19534 states. [2018-11-07 20:59:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19534 to 18563. [2018-11-07 20:59:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18563 states. [2018-11-07 20:59:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18563 states to 18563 states and 23838 transitions. [2018-11-07 20:59:15,454 INFO L78 Accepts]: Start accepts. Automaton has 18563 states and 23838 transitions. Word has length 565 [2018-11-07 20:59:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:59:15,455 INFO L480 AbstractCegarLoop]: Abstraction has 18563 states and 23838 transitions. [2018-11-07 20:59:15,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:59:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18563 states and 23838 transitions. [2018-11-07 20:59:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-11-07 20:59:15,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:59:15,523 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:59:15,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:59:15,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:59:15,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1339943481, now seen corresponding path program 1 times [2018-11-07 20:59:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:59:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:59:15,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:59:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:59:15,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:59:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:59:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 423 proven. 115 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-11-07 20:59:16,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:59:16,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:59:16,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 678 with the following transitions: [2018-11-07 20:59:16,556 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 20:59:16,563 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:59:16,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:59:17,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:59:17,095 INFO L272 AbstractInterpreter]: Visited 250 different actions 496 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:59:17,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:59:17,136 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:59:17,835 INFO L227 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 78.42% of their original sizes. [2018-11-07 20:59:17,836 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:59:18,890 INFO L415 sIntCurrentIteration]: We unified 676 AI predicates to 676 [2018-11-07 20:59:18,891 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:59:18,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:59:18,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 20:59:18,892 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:59:18,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 20:59:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 20:59:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-11-07 20:59:18,893 INFO L87 Difference]: Start difference. First operand 18563 states and 23838 transitions. Second operand 22 states. [2018-11-07 20:59:21,405 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:59:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:59:42,432 INFO L93 Difference]: Finished difference Result 36410 states and 47059 transitions. [2018-11-07 20:59:42,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 20:59:42,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 677 [2018-11-07 20:59:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:59:42,479 INFO L225 Difference]: With dead ends: 36410 [2018-11-07 20:59:42,480 INFO L226 Difference]: Without dead ends: 19199 [2018-11-07 20:59:42,512 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 691 GetRequests, 616 SyntacticMatches, 40 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 20:59:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19199 states. [2018-11-07 20:59:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19199 to 19194. [2018-11-07 20:59:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19194 states. [2018-11-07 20:59:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 24511 transitions. [2018-11-07 20:59:42,840 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 24511 transitions. Word has length 677 [2018-11-07 20:59:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:59:42,841 INFO L480 AbstractCegarLoop]: Abstraction has 19194 states and 24511 transitions. [2018-11-07 20:59:42,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 20:59:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 24511 transitions. [2018-11-07 20:59:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-11-07 20:59:42,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:59:42,877 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:59:42,877 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:59:42,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:59:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash -190813751, now seen corresponding path program 1 times [2018-11-07 20:59:42,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:59:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:59:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:59:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:59:42,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:59:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:59:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 423 proven. 115 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-11-07 20:59:43,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:59:43,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:59:43,502 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 686 with the following transitions: [2018-11-07 20:59:43,502 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 20:59:43,507 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:59:43,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:59:46,757 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:59:46,757 INFO L272 AbstractInterpreter]: Visited 258 different actions 2778 times. Merged at 5 different actions 50 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:59:46,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:59:46,766 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:59:47,572 INFO L227 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 78.74% of their original sizes. [2018-11-07 20:59:47,573 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:59:47,957 INFO L415 sIntCurrentIteration]: We unified 684 AI predicates to 684 [2018-11-07 20:59:47,957 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:59:47,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:59:47,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 20:59:47,958 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:59:47,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 20:59:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 20:59:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:59:47,959 INFO L87 Difference]: Start difference. First operand 19194 states and 24511 transitions. Second operand 23 states. [2018-11-07 20:59:50,889 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 20:59:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 20:59:55,002 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:59:55,008 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:59:55,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:59:55 BoogieIcfgContainer [2018-11-07 20:59:55,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:59:55,009 INFO L168 Benchmark]: Toolchain (without parser) took 215934.75 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 78.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 20:59:55,010 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:59:55,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-07 20:59:55,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -854.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-11-07 20:59:55,012 INFO L168 Benchmark]: Boogie Preprocessor took 158.39 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:59:55,013 INFO L168 Benchmark]: RCFGBuilder took 6348.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.8 MB). Peak memory consumption was 251.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:59:55,013 INFO L168 Benchmark]: TraceAbstraction took 208089.33 ms. Allocated memory was 2.3 GB in the beginning and 4.4 GB in the end (delta: 2.1 GB). Free memory was 1.9 GB in the beginning and 1.3 GB in the end (delta: 597.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-11-07 20:59:55,018 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.19 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 1154.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 178.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -854.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.39 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 6348.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.8 MB). Peak memory consumption was 251.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208089.33 ms. Allocated memory was 2.3 GB in the beginning and 4.4 GB in the end (delta: 2.1 GB). Free memory was 1.9 GB in the beginning and 1.3 GB in the end (delta: 597.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 142). Cancelled while BasicCegarLoop was constructing difference of abstraction (19194states) and FLOYD_HOARE automaton (currently 10 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (450 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. TIMEOUT Result, 208.0s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 177.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2450 SDtfs, 24102 SDslu, 1848 SDs, 0 SdLazy, 32492 SolverSat, 5122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.9s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2991 GetRequests, 2577 SyntacticMatches, 249 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19194occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.5s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9979709421515096 AbsIntWeakeningRatio, 0.06371191135734072 AbsIntAvgWeakeningVarsNumRemoved, 8.93836565096953 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1153 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 3857 NumberOfCodeBlocks, 3857 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3846 ConstructedInterpolants, 0 QuantifiedInterpolants, 6715009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 3526/4424 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown