java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:38:10,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:38:10,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:38:10,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:38:10,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:38:10,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:38:10,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:38:10,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:38:10,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:38:10,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:38:10,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:38:10,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:38:10,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:38:10,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:38:10,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:38:10,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:38:10,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:38:10,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:38:10,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:38:10,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:38:10,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:38:10,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:38:10,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:38:10,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:38:10,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:38:10,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:38:10,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:38:10,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:38:10,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:38:10,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:38:10,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:38:10,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:38:10,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:38:10,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:38:10,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:38:10,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:38:10,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:38:10,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:38:10,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:38:10,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:38:10,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:38:10,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 17:38:10,383 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:38:10,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:38:10,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:38:10,385 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:38:10,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:38:10,386 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:38:10,386 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:38:10,386 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:38:10,386 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:38:10,386 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:38:10,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:38:10,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:38:10,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:38:10,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:38:10,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:38:10,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:38:10,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:38:10,390 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:38:10,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:38:10,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:38:10,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:38:10,391 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:38:10,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:38:10,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:38:10,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:38:10,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:38:10,392 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:38:10,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:38:10,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:38:10,393 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:38:10,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:38:10,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:38:10,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:38:10,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:38:10,463 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:38:10,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48.c [2019-10-02 17:38:10,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2302888fd/ec3f7b2b520b4048ad1130c23f03ac71/FLAG4c5b0ebbb [2019-10-02 17:38:11,083 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:38:11,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label48.c [2019-10-02 17:38:11,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2302888fd/ec3f7b2b520b4048ad1130c23f03ac71/FLAG4c5b0ebbb [2019-10-02 17:38:11,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2302888fd/ec3f7b2b520b4048ad1130c23f03ac71 [2019-10-02 17:38:11,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:38:11,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:38:11,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:38:11,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:38:11,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:38:11,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:38:11" (1/1) ... [2019-10-02 17:38:11,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec6e512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:11, skipping insertion in model container [2019-10-02 17:38:11,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:38:11" (1/1) ... [2019-10-02 17:38:11,402 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:38:11,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:38:11,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:38:11,998 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:38:12,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:38:12,138 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:38:12,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12 WrapperNode [2019-10-02 17:38:12,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:38:12,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:38:12,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:38:12,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:38:12,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:38:12,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:38:12,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:38:12,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:38:12,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (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 [2019-10-02 17:38:12,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:38:12,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:38:12,323 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:38:12,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:38:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:38:13,503 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:38:13,503 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:38:13,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:38:13 BoogieIcfgContainer [2019-10-02 17:38:13,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:38:13,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:38:13,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:38:13,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:38:13,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:38:11" (1/3) ... [2019-10-02 17:38:13,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79859dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:38:13, skipping insertion in model container [2019-10-02 17:38:13,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12" (2/3) ... [2019-10-02 17:38:13,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79859dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:38:13, skipping insertion in model container [2019-10-02 17:38:13,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:38:13" (3/3) ... [2019-10-02 17:38:13,513 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label48.c [2019-10-02 17:38:13,523 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:38:13,531 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:38:13,548 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:38:13,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:38:13,576 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:38:13,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:38:13,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:38:13,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:38:13,577 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:38:13,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:38:13,577 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:38:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:38:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 17:38:13,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:13,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:13,622 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:13,628 INFO L82 PathProgramCache]: Analyzing trace with hash 231210793, now seen corresponding path program 1 times [2019-10-02 17:38:13,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:13,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:13,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:14,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:14,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:38:14,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:14,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:38:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:38:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:38:14,187 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:38:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:15,120 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:38:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:38:15,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-02 17:38:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:15,141 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:38:15,141 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:38:15,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:38:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:38:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:38:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:38:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:38:15,220 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 143 [2019-10-02 17:38:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:15,221 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:38:15,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:38:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:38:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 17:38:15,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:15,232 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:15,238 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 703690926, now seen corresponding path program 1 times [2019-10-02 17:38:15,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:15,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:15,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:15,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:15,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:15,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:15,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:15,660 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:38:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:16,333 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:38:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:16,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-02 17:38:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:16,341 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:38:16,341 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:38:16,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:38:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:38:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:38:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:38:16,361 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 151 [2019-10-02 17:38:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:16,362 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:38:16,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:38:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 17:38:16,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:16,365 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:16,365 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1665282438, now seen corresponding path program 1 times [2019-10-02 17:38:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:16,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:16,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:16,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:16,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:16,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:16,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:16,672 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:38:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:17,410 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:38:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:17,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-02 17:38:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:17,416 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:38:17,417 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:38:17,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:38:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:38:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:38:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:38:17,450 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 157 [2019-10-02 17:38:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:17,450 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:38:17,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:38:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 17:38:17,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:17,456 INFO L411 BasicCegarLoop]: trace histogram [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, 1] [2019-10-02 17:38:17,456 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1117544721, now seen corresponding path program 1 times [2019-10-02 17:38:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:17,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:17,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:17,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:17,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:38:17,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:17,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:38:17,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:38:17,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:38:17,602 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:38:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:18,384 INFO L93 Difference]: Finished difference Result 637 states and 894 transitions. [2019-10-02 17:38:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:38:18,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-02 17:38:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:18,391 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:38:18,391 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:38:18,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:38:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:38:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:38:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:38:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 17:38:18,429 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 165 [2019-10-02 17:38:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:18,429 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 17:38:18,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:38:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 17:38:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 17:38:18,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:18,433 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:38:18,434 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1318962261, now seen corresponding path program 1 times [2019-10-02 17:38:18,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:18,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:18,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:18,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:18,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:18,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:18,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:18,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:18,674 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 17:38:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:19,372 INFO L93 Difference]: Finished difference Result 710 states and 957 transitions. [2019-10-02 17:38:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:19,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-10-02 17:38:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:19,377 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:38:19,377 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:38:19,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:38:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:38:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:38:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 17:38:19,400 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 167 [2019-10-02 17:38:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:19,400 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 17:38:19,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 17:38:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 17:38:19,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:19,404 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:19,404 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1177950311, now seen corresponding path program 1 times [2019-10-02 17:38:19,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:19,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:19,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:19,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:19,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:19,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:19,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:19,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:19,705 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 17:38:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:20,287 INFO L93 Difference]: Finished difference Result 712 states and 947 transitions. [2019-10-02 17:38:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:20,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-10-02 17:38:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:20,292 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:38:20,292 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:38:20,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:38:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:38:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:38:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 17:38:20,313 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 169 [2019-10-02 17:38:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:20,313 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 17:38:20,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 17:38:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 17:38:20,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:20,317 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:20,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1524788769, now seen corresponding path program 1 times [2019-10-02 17:38:20,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:20,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:20,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:20,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:38:20,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:38:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:38:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:38:20,424 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 17:38:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:21,317 INFO L93 Difference]: Finished difference Result 1238 states and 1704 transitions. [2019-10-02 17:38:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:38:21,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-10-02 17:38:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:21,328 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:38:21,328 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:38:21,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:38:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:38:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:38:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:38:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 17:38:21,382 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 173 [2019-10-02 17:38:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:21,383 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 17:38:21,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:38:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 17:38:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 17:38:21,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:21,391 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:21,391 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash 689826632, now seen corresponding path program 1 times [2019-10-02 17:38:21,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:21,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:21,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:21,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:38:21,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:38:21,599 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2019-10-02 17:38:21,602 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [823], [825], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:38:21,690 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:38:21,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:50:14,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:50:14,352 INFO L272 AbstractInterpreter]: Visited 147 different actions 433 times. Merged at 6 different actions 12 times. Never widened. Performed 938 root evaluator evaluations with a maximum evaluation depth of 18. Performed 938 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2019-10-02 17:50:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:50:14,357 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates