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/Problem18_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 21:57:58,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 21:57:58,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 21:57:58,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 21:57:58,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 21:57:58,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 21:57:58,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 21:57:58,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 21:57:58,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 21:57:58,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 21:57:58,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 21:57:58,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 21:57:58,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 21:57:58,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 21:57:58,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 21:57:58,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 21:57:58,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 21:57:58,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 21:57:58,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 21:57:58,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 21:57:58,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 21:57:58,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 21:57:58,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 21:57:58,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 21:57:58,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 21:57:58,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 21:57:58,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 21:57:58,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 21:57:58,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 21:57:58,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 21:57:58,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 21:57:58,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 21:57:58,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 21:57:58,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 21:57:58,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 21:57:58,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 21:57:58,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 21:57:58,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 21:57:58,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 21:57:58,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 21:57:58,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 21:57:58,348 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-09-09 21:57:58,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 21:57:58,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 21:57:58,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 21:57:58,364 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 21:57:58,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 21:57:58,368 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 21:57:58,368 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 21:57:58,368 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 21:57:58,369 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 21:57:58,369 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 21:57:58,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 21:57:58,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 21:57:58,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 21:57:58,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 21:57:58,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 21:57:58,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 21:57:58,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 21:57:58,371 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 21:57:58,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 21:57:58,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 21:57:58,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 21:57:58,373 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 21:57:58,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 21:57:58,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 21:57:58,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 21:57:58,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 21:57:58,374 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 21:57:58,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 21:57:58,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 21:57:58,375 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 21:57:58,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 21:57:58,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 21:57:58,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 21:57:58,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 21:57:58,450 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 21:57:58,451 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label08.c [2019-09-09 21:57:58,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0d73054/e7f7d7abf9a543a8a6e8e5c579798d58/FLAGd625c5b7e [2019-09-09 21:57:59,281 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 21:57:59,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label08.c [2019-09-09 21:57:59,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0d73054/e7f7d7abf9a543a8a6e8e5c579798d58/FLAGd625c5b7e [2019-09-09 21:57:59,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0d73054/e7f7d7abf9a543a8a6e8e5c579798d58 [2019-09-09 21:57:59,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 21:57:59,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 21:57:59,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 21:57:59,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 21:57:59,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 21:57:59,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 09:57:59" (1/1) ... [2019-09-09 21:57:59,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116a0b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:57:59, skipping insertion in model container [2019-09-09 21:57:59,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 09:57:59" (1/1) ... [2019-09-09 21:57:59,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 21:57:59,558 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 21:58:00,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 21:58:00,723 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 21:58:01,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 21:58:01,239 INFO L192 MainTranslator]: Completed translation [2019-09-09 21:58:01,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01 WrapperNode [2019-09-09 21:58:01,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 21:58:01,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 21:58:01,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 21:58:01,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 21:58:01,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (1/1) ... [2019-09-09 21:58:01,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 21:58:01,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 21:58:01,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 21:58:01,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 21:58:01,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (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-09-09 21:58:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 21:58:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 21:58:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 21:58:01,649 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-09 21:58:01,649 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-09 21:58:01,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 21:58:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 21:58:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-09 21:58:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-09 21:58:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 21:58:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 21:58:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 21:58:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 21:58:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 21:58:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 21:58:05,640 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 21:58:05,641 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 21:58:05,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 09:58:05 BoogieIcfgContainer [2019-09-09 21:58:05,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 21:58:05,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 21:58:05,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 21:58:05,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 21:58:05,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 09:57:59" (1/3) ... [2019-09-09 21:58:05,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afdb763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 09:58:05, skipping insertion in model container [2019-09-09 21:58:05,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:58:01" (2/3) ... [2019-09-09 21:58:05,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afdb763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 09:58:05, skipping insertion in model container [2019-09-09 21:58:05,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 09:58:05" (3/3) ... [2019-09-09 21:58:05,657 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label08.c [2019-09-09 21:58:05,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 21:58:05,684 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 21:58:05,703 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 21:58:05,735 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 21:58:05,735 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 21:58:05,736 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 21:58:05,736 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 21:58:05,736 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 21:58:05,736 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 21:58:05,736 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 21:58:05,737 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 21:58:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-09 21:58:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 21:58:05,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:05,799 INFO L399 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] [2019-09-09 21:58:05,801 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash 526679754, now seen corresponding path program 1 times [2019-09-09 21:58:05,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:05,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:05,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:58:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:06,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:58:06,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:06,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:58:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:58:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:06,146 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-09-09 21:58:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:13,265 INFO L93 Difference]: Finished difference Result 2202 states and 3268 transitions. [2019-09-09 21:58:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:58:13,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-09 21:58:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:13,306 INFO L225 Difference]: With dead ends: 2202 [2019-09-09 21:58:13,306 INFO L226 Difference]: Without dead ends: 2114 [2019-09-09 21:58:13,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-09-09 21:58:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1412. [2019-09-09 21:58:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-09 21:58:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2246 transitions. [2019-09-09 21:58:13,455 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2246 transitions. Word has length 27 [2019-09-09 21:58:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:13,455 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2246 transitions. [2019-09-09 21:58:13,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:58:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2246 transitions. [2019-09-09 21:58:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 21:58:13,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:13,460 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 21:58:13,461 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1096664945, now seen corresponding path program 1 times [2019-09-09 21:58:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:13,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:58:13,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:13,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 21:58:13,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:13,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 21:58:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 21:58:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 21:58:13,662 INFO L87 Difference]: Start difference. First operand 1412 states and 2246 transitions. Second operand 5 states. [2019-09-09 21:58:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:20,478 INFO L93 Difference]: Finished difference Result 2888 states and 4349 transitions. [2019-09-09 21:58:20,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 21:58:20,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-09 21:58:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:20,502 INFO L225 Difference]: With dead ends: 2888 [2019-09-09 21:58:20,503 INFO L226 Difference]: Without dead ends: 2888 [2019-09-09 21:58:20,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 21:58:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-09-09 21:58:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2866. [2019-09-09 21:58:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2019-09-09 21:58:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4300 transitions. [2019-09-09 21:58:20,610 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4300 transitions. Word has length 96 [2019-09-09 21:58:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:20,612 INFO L475 AbstractCegarLoop]: Abstraction has 2866 states and 4300 transitions. [2019-09-09 21:58:20,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 21:58:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4300 transitions. [2019-09-09 21:58:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 21:58:20,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:20,626 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 21:58:20,626 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1485054039, now seen corresponding path program 1 times [2019-09-09 21:58:20,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:20,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:20,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:58:20,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:20,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 21:58:20,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:20,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 21:58:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 21:58:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 21:58:20,832 INFO L87 Difference]: Start difference. First operand 2866 states and 4300 transitions. Second operand 6 states. [2019-09-09 21:58:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:26,914 INFO L93 Difference]: Finished difference Result 5892 states and 8817 transitions. [2019-09-09 21:58:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 21:58:26,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-09 21:58:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:26,949 INFO L225 Difference]: With dead ends: 5892 [2019-09-09 21:58:26,950 INFO L226 Difference]: Without dead ends: 5892 [2019-09-09 21:58:26,950 INFO L628 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-09-09 21:58:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2019-09-09 21:58:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5837. [2019-09-09 21:58:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-09-09 21:58:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 8644 transitions. [2019-09-09 21:58:27,112 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 8644 transitions. Word has length 100 [2019-09-09 21:58:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:27,112 INFO L475 AbstractCegarLoop]: Abstraction has 5837 states and 8644 transitions. [2019-09-09 21:58:27,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 21:58:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 8644 transitions. [2019-09-09 21:58:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 21:58:27,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:27,115 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 21:58:27,115 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash -940092450, now seen corresponding path program 1 times [2019-09-09 21:58:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:27,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:27,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:27,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:58:27,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:27,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 21:58:27,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:27,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 21:58:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 21:58:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 21:58:27,324 INFO L87 Difference]: Start difference. First operand 5837 states and 8644 transitions. Second operand 6 states. [2019-09-09 21:58:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:33,171 INFO L93 Difference]: Finished difference Result 8852 states and 12863 transitions. [2019-09-09 21:58:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 21:58:33,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-09 21:58:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:33,212 INFO L225 Difference]: With dead ends: 8852 [2019-09-09 21:58:33,212 INFO L226 Difference]: Without dead ends: 8852 [2019-09-09 21:58:33,213 INFO L628 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-09-09 21:58:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2019-09-09 21:58:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8798. [2019-09-09 21:58:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2019-09-09 21:58:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 12614 transitions. [2019-09-09 21:58:33,463 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 12614 transitions. Word has length 121 [2019-09-09 21:58:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:33,464 INFO L475 AbstractCegarLoop]: Abstraction has 8798 states and 12614 transitions. [2019-09-09 21:58:33,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 21:58:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 12614 transitions. [2019-09-09 21:58:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-09 21:58:33,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:33,471 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 21:58:33,471 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:33,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1659967414, now seen corresponding path program 1 times [2019-09-09 21:58:33,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:33,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:33,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:33,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:33,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:58:33,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:33,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:58:33,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:33,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:58:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:58:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:33,659 INFO L87 Difference]: Start difference. First operand 8798 states and 12614 transitions. Second operand 4 states. [2019-09-09 21:58:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:40,057 INFO L93 Difference]: Finished difference Result 13039 states and 16597 transitions. [2019-09-09 21:58:40,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:58:40,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-09 21:58:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:40,124 INFO L225 Difference]: With dead ends: 13039 [2019-09-09 21:58:40,124 INFO L226 Difference]: Without dead ends: 13039 [2019-09-09 21:58:40,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13039 states. [2019-09-09 21:58:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13039 to 13039. [2019-09-09 21:58:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13039 states. [2019-09-09 21:58:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13039 states to 13039 states and 16597 transitions. [2019-09-09 21:58:40,384 INFO L78 Accepts]: Start accepts. Automaton has 13039 states and 16597 transitions. Word has length 133 [2019-09-09 21:58:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:40,387 INFO L475 AbstractCegarLoop]: Abstraction has 13039 states and 16597 transitions. [2019-09-09 21:58:40,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:58:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13039 states and 16597 transitions. [2019-09-09 21:58:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-09 21:58:40,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:40,392 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 21:58:40,392 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash -624053469, now seen corresponding path program 1 times [2019-09-09 21:58:40,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:40,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:40,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-09 21:58:40,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:40,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:58:40,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:40,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:58:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:58:40,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:40,534 INFO L87 Difference]: Start difference. First operand 13039 states and 16597 transitions. Second operand 4 states. [2019-09-09 21:58:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:47,691 INFO L93 Difference]: Finished difference Result 33655 states and 42738 transitions. [2019-09-09 21:58:47,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:58:47,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-09-09 21:58:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:47,818 INFO L225 Difference]: With dead ends: 33655 [2019-09-09 21:58:47,818 INFO L226 Difference]: Without dead ends: 33655 [2019-09-09 21:58:47,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33655 states. [2019-09-09 21:58:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33655 to 31538. [2019-09-09 21:58:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31538 states. [2019-09-09 21:58:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31538 states to 31538 states and 40237 transitions. [2019-09-09 21:58:48,560 INFO L78 Accepts]: Start accepts. Automaton has 31538 states and 40237 transitions. Word has length 202 [2019-09-09 21:58:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:48,562 INFO L475 AbstractCegarLoop]: Abstraction has 31538 states and 40237 transitions. [2019-09-09 21:58:48,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:58:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 31538 states and 40237 transitions. [2019-09-09 21:58:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-09 21:58:48,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:48,574 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 21:58:48,574 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2069046714, now seen corresponding path program 1 times [2019-09-09 21:58:48,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:48,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:48,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-09 21:58:48,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:58:48,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:58:48,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:58:48,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:58:48,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:58:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:48,768 INFO L87 Difference]: Start difference. First operand 31538 states and 40237 transitions. Second operand 4 states. [2019-09-09 21:58:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:58:55,089 INFO L93 Difference]: Finished difference Result 41416 states and 49124 transitions. [2019-09-09 21:58:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:58:55,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-09-09 21:58:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:58:55,224 INFO L225 Difference]: With dead ends: 41416 [2019-09-09 21:58:55,225 INFO L226 Difference]: Without dead ends: 41416 [2019-09-09 21:58:55,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:58:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41416 states. [2019-09-09 21:58:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41416 to 37195. [2019-09-09 21:58:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37195 states. [2019-09-09 21:58:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37195 states to 37195 states and 44344 transitions. [2019-09-09 21:58:55,974 INFO L78 Accepts]: Start accepts. Automaton has 37195 states and 44344 transitions. Word has length 283 [2019-09-09 21:58:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:58:55,975 INFO L475 AbstractCegarLoop]: Abstraction has 37195 states and 44344 transitions. [2019-09-09 21:58:55,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:58:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37195 states and 44344 transitions. [2019-09-09 21:58:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-09 21:58:56,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:58:56,002 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 21:58:56,002 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:58:56,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:58:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1501512014, now seen corresponding path program 1 times [2019-09-09 21:58:56,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:58:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:56,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:58:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:58:56,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:58:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:58:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:58:56,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 21:58:56,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 21:58:56,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-09 21:58:56,514 INFO L207 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1747], [1749], [1752], [1760], [1768], [1776], [1784], [1792], [1800], [1808], [1816], [1824], [1832], [1840], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2484], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2732], [2996], [3000], [3009], [3013], [3015], [3024], [3025], [3026], [3028], [3029] [2019-09-09 21:58:56,610 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 21:58:56,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 21:59:12,381 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 21:59:12,383 INFO L272 AbstractInterpreter]: Visited 228 different actions 228 times. Never merged. Never widened. Performed 458 root evaluator evaluations with a maximum evaluation depth of 13. Performed 458 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-09-09 21:59:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:59:12,388 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 21:59:30,086 INFO L227 lantSequenceWeakener]: Weakened 392 states. On average, predicates are now at 77.45% of their original sizes. [2019-09-09 21:59:30,086 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 21:59:30,194 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-09 21:59:30,194 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 21:59:30,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 21:59:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2019-09-09 21:59:30,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:59:30,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 21:59:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 21:59:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-09 21:59:30,197 INFO L87 Difference]: Start difference. First operand 37195 states and 44344 transitions. Second operand 11 states. [2019-09-09 22:01:46,693 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.