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/psyco/psyco_accelerometer_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:59:23,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:59:23,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:59:23,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:59:23,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:59:23,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:59:23,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:59:23,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:59:23,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:59:23,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:59:23,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:59:23,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:59:23,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:59:23,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:59:23,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:59:23,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:59:23,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:59:23,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:59:23,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:59:23,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:59:23,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:59:23,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:59:23,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:59:23,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:59:23,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:59:23,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:59:23,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:59:23,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:59:23,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:59:23,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:59:23,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:59:23,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:59:23,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:59:23,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:59:23,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:59:23,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:59:23,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:59:23,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:59:23,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:59:23,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:59:23,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:59:23,498 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-03 02:59:23,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:59:23,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:59:23,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:59:23,515 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:59:23,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:59:23,516 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:59:23,516 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:59:23,516 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:59:23,516 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:59:23,516 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:59:23,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:59:23,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:59:23,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:59:23,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:59:23,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:59:23,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:59:23,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:59:23,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:59:23,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:59:23,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:59:23,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:59:23,519 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:59:23,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:59:23,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:23,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:59:23,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:59:23,520 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:59:23,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:59:23,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:59:23,521 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:59:23,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:59:23,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:59:23,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:59:23,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:59:23,572 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:59:23,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-10-03 02:59:23,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0f49030/87ee0ef7d34c4b478f53ba0a65185971/FLAGa3f724027 [2019-10-03 02:59:24,340 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:59:24,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-10-03 02:59:24,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0f49030/87ee0ef7d34c4b478f53ba0a65185971/FLAGa3f724027 [2019-10-03 02:59:24,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0f49030/87ee0ef7d34c4b478f53ba0a65185971 [2019-10-03 02:59:24,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:59:24,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:59:24,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:24,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:59:24,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:59:24,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:24" (1/1) ... [2019-10-03 02:59:24,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e25428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:24, skipping insertion in model container [2019-10-03 02:59:24,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:24" (1/1) ... [2019-10-03 02:59:24,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:59:24,641 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:59:25,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:25,529 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:59:25,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:25,871 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:59:25,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25 WrapperNode [2019-10-03 02:59:25,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:25,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:59:25,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:59:25,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:59:25,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:26,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:26,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:26,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:26,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:59:26,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:59:26,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:59:26,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:59:26,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (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-03 02:59:26,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:59:26,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:59:26,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:59:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:59:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:59:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:59:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:59:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:28,306 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:28,307 INFO L283 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-03 02:59:28,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:28 BoogieIcfgContainer [2019-10-03 02:59:28,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:28,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:28,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:28,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:28,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:59:24" (1/3) ... [2019-10-03 02:59:28,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1f20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:28, skipping insertion in model container [2019-10-03 02:59:28,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (2/3) ... [2019-10-03 02:59:28,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1f20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:28, skipping insertion in model container [2019-10-03 02:59:28,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:28" (3/3) ... [2019-10-03 02:59:28,319 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-10-03 02:59:28,332 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:28,342 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:28,364 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:28,402 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:28,403 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:28,403 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:28,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:28,404 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:28,404 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:28,404 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:28,404 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2019-10-03 02:59:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:59:28,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:28,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:28,454 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash -854737335, now seen corresponding path program 1 times [2019-10-03 02:59:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:28,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:28,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:28,677 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-03 02:59:28,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:28,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:59:28,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:28,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:28,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:28,704 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 2 states. [2019-10-03 02:59:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:28,769 INFO L93 Difference]: Finished difference Result 233 states and 410 transitions. [2019-10-03 02:59:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:28,772 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-03 02:59:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:28,792 INFO L225 Difference]: With dead ends: 233 [2019-10-03 02:59:28,793 INFO L226 Difference]: Without dead ends: 228 [2019-10-03 02:59:28,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-03 02:59:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-10-03 02:59:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-03 02:59:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 397 transitions. [2019-10-03 02:59:28,877 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 397 transitions. Word has length 12 [2019-10-03 02:59:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:28,878 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 397 transitions. [2019-10-03 02:59:28,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 397 transitions. [2019-10-03 02:59:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:59:28,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:28,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:28,880 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -194587090, now seen corresponding path program 1 times [2019-10-03 02:59:28,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:28,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:28,958 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-03 02:59:28,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:28,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:28,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:28,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:28,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:28,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:28,962 INFO L87 Difference]: Start difference. First operand 228 states and 397 transitions. Second operand 3 states. [2019-10-03 02:59:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,187 INFO L93 Difference]: Finished difference Result 231 states and 400 transitions. [2019-10-03 02:59:29,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:29,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:59:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,191 INFO L225 Difference]: With dead ends: 231 [2019-10-03 02:59:29,191 INFO L226 Difference]: Without dead ends: 231 [2019-10-03 02:59:29,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-03 02:59:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-10-03 02:59:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-03 02:59:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 400 transitions. [2019-10-03 02:59:29,224 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 400 transitions. Word has length 13 [2019-10-03 02:59:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,225 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 400 transitions. [2019-10-03 02:59:29,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 400 transitions. [2019-10-03 02:59:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:59:29,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:29,227 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1341804167, now seen corresponding path program 1 times [2019-10-03 02:59:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:29,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:29,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,342 INFO L87 Difference]: Start difference. First operand 231 states and 400 transitions. Second operand 3 states. [2019-10-03 02:59:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,524 INFO L93 Difference]: Finished difference Result 216 states and 378 transitions. [2019-10-03 02:59:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:29,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 02:59:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,527 INFO L225 Difference]: With dead ends: 216 [2019-10-03 02:59:29,527 INFO L226 Difference]: Without dead ends: 216 [2019-10-03 02:59:29,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-03 02:59:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-10-03 02:59:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-03 02:59:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-10-03 02:59:29,538 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 18 [2019-10-03 02:59:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,538 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-10-03 02:59:29,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-10-03 02:59:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:59:29,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,540 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] [2019-10-03 02:59:29,540 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash -556790640, now seen corresponding path program 1 times [2019-10-03 02:59:29,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:29,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,594 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-10-03 02:59:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,911 INFO L93 Difference]: Finished difference Result 414 states and 731 transitions. [2019-10-03 02:59:29,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:29,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:59:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,916 INFO L225 Difference]: With dead ends: 414 [2019-10-03 02:59:29,916 INFO L226 Difference]: Without dead ends: 410 [2019-10-03 02:59:29,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-03 02:59:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 404. [2019-10-03 02:59:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-03 02:59:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 722 transitions. [2019-10-03 02:59:29,941 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 722 transitions. Word has length 21 [2019-10-03 02:59:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,942 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 722 transitions. [2019-10-03 02:59:29,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 722 transitions. [2019-10-03 02:59:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:59:29,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,947 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] [2019-10-03 02:59:29,947 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1774874971, now seen corresponding path program 1 times [2019-10-03 02:59:29,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:30,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,039 INFO L87 Difference]: Start difference. First operand 404 states and 722 transitions. Second operand 3 states. [2019-10-03 02:59:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,174 INFO L93 Difference]: Finished difference Result 248 states and 423 transitions. [2019-10-03 02:59:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:59:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,177 INFO L225 Difference]: With dead ends: 248 [2019-10-03 02:59:30,177 INFO L226 Difference]: Without dead ends: 248 [2019-10-03 02:59:30,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-03 02:59:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2019-10-03 02:59:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-03 02:59:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 422 transitions. [2019-10-03 02:59:30,185 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 422 transitions. Word has length 22 [2019-10-03 02:59:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,186 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 422 transitions. [2019-10-03 02:59:30,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 422 transitions. [2019-10-03 02:59:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:59:30,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,191 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] [2019-10-03 02:59:30,191 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -69220556, now seen corresponding path program 1 times [2019-10-03 02:59:30,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:30,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,265 INFO L87 Difference]: Start difference. First operand 246 states and 422 transitions. Second operand 3 states. [2019-10-03 02:59:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,425 INFO L93 Difference]: Finished difference Result 246 states and 414 transitions. [2019-10-03 02:59:30,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:59:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,427 INFO L225 Difference]: With dead ends: 246 [2019-10-03 02:59:30,428 INFO L226 Difference]: Without dead ends: 246 [2019-10-03 02:59:30,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-03 02:59:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2019-10-03 02:59:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-03 02:59:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 414 transitions. [2019-10-03 02:59:30,439 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 414 transitions. Word has length 22 [2019-10-03 02:59:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,441 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 414 transitions. [2019-10-03 02:59:30,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 414 transitions. [2019-10-03 02:59:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:59:30,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,442 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] [2019-10-03 02:59:30,443 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1162876623, now seen corresponding path program 1 times [2019-10-03 02:59:30,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:30,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,514 INFO L87 Difference]: Start difference. First operand 246 states and 414 transitions. Second operand 3 states. [2019-10-03 02:59:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:31,188 INFO L93 Difference]: Finished difference Result 419 states and 633 transitions. [2019-10-03 02:59:31,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:31,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:59:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:31,191 INFO L225 Difference]: With dead ends: 419 [2019-10-03 02:59:31,191 INFO L226 Difference]: Without dead ends: 415 [2019-10-03 02:59:31,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-10-03 02:59:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 402. [2019-10-03 02:59:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-10-03 02:59:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 614 transitions. [2019-10-03 02:59:31,203 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 614 transitions. Word has length 25 [2019-10-03 02:59:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:31,204 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 614 transitions. [2019-10-03 02:59:31,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 614 transitions. [2019-10-03 02:59:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:59:31,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:31,205 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:31,205 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -718901724, now seen corresponding path program 1 times [2019-10-03 02:59:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:31,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:31,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:31,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:31,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,260 INFO L87 Difference]: Start difference. First operand 402 states and 614 transitions. Second operand 3 states. [2019-10-03 02:59:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:31,340 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-10-03 02:59:31,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:31,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:59:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:31,343 INFO L225 Difference]: With dead ends: 343 [2019-10-03 02:59:31,343 INFO L226 Difference]: Without dead ends: 343 [2019-10-03 02:59:31,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-03 02:59:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-03 02:59:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-03 02:59:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2019-10-03 02:59:31,354 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 35 [2019-10-03 02:59:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:31,354 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2019-10-03 02:59:31,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2019-10-03 02:59:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:59:31,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:31,356 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:31,356 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:31,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1789616017, now seen corresponding path program 1 times [2019-10-03 02:59:31,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:31,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:31,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,392 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand 3 states. [2019-10-03 02:59:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:31,456 INFO L93 Difference]: Finished difference Result 337 states and 506 transitions. [2019-10-03 02:59:31,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:31,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-03 02:59:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:31,459 INFO L225 Difference]: With dead ends: 337 [2019-10-03 02:59:31,459 INFO L226 Difference]: Without dead ends: 337 [2019-10-03 02:59:31,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-03 02:59:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-10-03 02:59:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-03 02:59:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 506 transitions. [2019-10-03 02:59:31,469 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 506 transitions. Word has length 36 [2019-10-03 02:59:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:31,470 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 506 transitions. [2019-10-03 02:59:31,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 506 transitions. [2019-10-03 02:59:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 02:59:31,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:31,471 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:31,472 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 460400497, now seen corresponding path program 1 times [2019-10-03 02:59:31,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:31,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:59:31,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:31,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:59:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:59:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:31,521 INFO L87 Difference]: Start difference. First operand 337 states and 506 transitions. Second operand 4 states. [2019-10-03 02:59:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:31,920 INFO L93 Difference]: Finished difference Result 343 states and 475 transitions. [2019-10-03 02:59:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:31,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-10-03 02:59:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:31,923 INFO L225 Difference]: With dead ends: 343 [2019-10-03 02:59:31,923 INFO L226 Difference]: Without dead ends: 343 [2019-10-03 02:59:31,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-03 02:59:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-03 02:59:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2019-10-03 02:59:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-03 02:59:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 470 transitions. [2019-10-03 02:59:31,939 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 470 transitions. Word has length 40 [2019-10-03 02:59:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:31,945 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 470 transitions. [2019-10-03 02:59:31,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:59:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2019-10-03 02:59:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 02:59:31,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:31,946 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:31,949 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash -433463233, now seen corresponding path program 1 times [2019-10-03 02:59:31,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:32,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:32,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:32,022 INFO L87 Difference]: Start difference. First operand 337 states and 470 transitions. Second operand 3 states. [2019-10-03 02:59:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:32,063 INFO L93 Difference]: Finished difference Result 314 states and 433 transitions. [2019-10-03 02:59:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:32,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-03 02:59:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:32,066 INFO L225 Difference]: With dead ends: 314 [2019-10-03 02:59:32,066 INFO L226 Difference]: Without dead ends: 314 [2019-10-03 02:59:32,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-03 02:59:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-03 02:59:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-03 02:59:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 433 transitions. [2019-10-03 02:59:32,078 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 433 transitions. Word has length 41 [2019-10-03 02:59:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:32,079 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 433 transitions. [2019-10-03 02:59:32,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 433 transitions. [2019-10-03 02:59:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 02:59:32,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:32,081 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:32,081 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:32,082 INFO L82 PathProgramCache]: Analyzing trace with hash 181817089, now seen corresponding path program 1 times [2019-10-03 02:59:32,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:32,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:32,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:32,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:32,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:32,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:32,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:32,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:32,118 INFO L87 Difference]: Start difference. First operand 314 states and 433 transitions. Second operand 3 states. [2019-10-03 02:59:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:32,156 INFO L93 Difference]: Finished difference Result 176 states and 248 transitions. [2019-10-03 02:59:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:32,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-03 02:59:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:32,157 INFO L225 Difference]: With dead ends: 176 [2019-10-03 02:59:32,157 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:59:32,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:59:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:59:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:59:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:59:32,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-10-03 02:59:32,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:32,158 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:59:32,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:59:32,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:59:32,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:59:32 BoogieIcfgContainer [2019-10-03 02:59:32,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:59:32,167 INFO L168 Benchmark]: Toolchain (without parser) took 7661.11 ms. Allocated memory was 137.9 MB in the beginning and 314.6 MB in the end (delta: 176.7 MB). Free memory was 84.1 MB in the beginning and 111.3 MB in the end (delta: -27.3 MB). Peak memory consumption was 149.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:32,168 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 137.9 MB. Free memory was 112.2 MB in the beginning and 112.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:59:32,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1367.06 ms. Allocated memory was 137.9 MB in the beginning and 232.8 MB in the end (delta: 94.9 MB). Free memory was 83.9 MB in the beginning and 111.8 MB in the end (delta: -27.9 MB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:32,170 INFO L168 Benchmark]: Boogie Preprocessor took 238.50 ms. Allocated memory is still 232.8 MB. Free memory was 111.8 MB in the beginning and 97.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:32,171 INFO L168 Benchmark]: RCFGBuilder took 2196.41 ms. Allocated memory was 232.8 MB in the beginning and 254.8 MB in the end (delta: 22.0 MB). Free memory was 97.5 MB in the beginning and 136.0 MB in the end (delta: -38.5 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:32,172 INFO L168 Benchmark]: TraceAbstraction took 3854.36 ms. Allocated memory was 254.8 MB in the beginning and 314.6 MB in the end (delta: 59.8 MB). Free memory was 136.0 MB in the beginning and 111.3 MB in the end (delta: 24.7 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:32,176 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15 ms. Allocated memory is still 137.9 MB. Free memory was 112.2 MB in the beginning and 112.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1367.06 ms. Allocated memory was 137.9 MB in the beginning and 232.8 MB in the end (delta: 94.9 MB). Free memory was 83.9 MB in the beginning and 111.8 MB in the end (delta: -27.9 MB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 238.50 ms. Allocated memory is still 232.8 MB. Free memory was 111.8 MB in the beginning and 97.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2196.41 ms. Allocated memory was 232.8 MB in the beginning and 254.8 MB in the end (delta: 22.0 MB). Free memory was 97.5 MB in the beginning and 136.0 MB in the end (delta: -38.5 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3854.36 ms. Allocated memory was 254.8 MB in the beginning and 314.6 MB in the end (delta: 59.8 MB). Free memory was 136.0 MB in the beginning and 111.3 MB in the end (delta: 24.7 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 242 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4082 SDtfs, 2123 SDslu, 1809 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 14230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 38/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...