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/ssh-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:47:53,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:47:53,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:47:53,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:47:53,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:47:53,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:47:53,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:47:53,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:47:53,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:47:53,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:47:53,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:47:53,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:47:53,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:47:53,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:47:53,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:47:53,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:47:53,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:47:53,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:47:53,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:47:53,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:47:53,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:47:53,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:47:53,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:47:53,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:47:53,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:47:53,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:47:53,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:47:53,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:47:53,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:47:53,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:47:53,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:47:53,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:47:53,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:47:53,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:47:53,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:47:53,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:47:53,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:47:53,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:47:53,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:47:53,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:47:53,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:47:53,371 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 05:47:53,394 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:47:53,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:47:53,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:47:53,396 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:47:53,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:47:53,397 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:47:53,397 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:47:53,397 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:47:53,397 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:47:53,397 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:47:53,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:47:53,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:47:53,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:47:53,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:47:53,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:47:53,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:47:53,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:47:53,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:47:53,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:47:53,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:47:53,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:47:53,402 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:47:53,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:47:53,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:47:53,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:47:53,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:47:53,403 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:47:53,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:47:53,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:47:53,404 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:47:53,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:47:53,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:47:53,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:47:53,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:47:53,463 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:47:53,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-09-09 05:47:53,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254156322/ae11df7e299041b2927809811b5b0013/FLAG351039a6a [2019-09-09 05:47:54,006 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:47:54,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-09-09 05:47:54,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254156322/ae11df7e299041b2927809811b5b0013/FLAG351039a6a [2019-09-09 05:47:54,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254156322/ae11df7e299041b2927809811b5b0013 [2019-09-09 05:47:54,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:47:54,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:47:54,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:47:54,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:47:54,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:47:54,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22610838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54, skipping insertion in model container [2019-09-09 05:47:54,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:47:54,456 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:47:54,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:47:54,662 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:47:54,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:47:54,792 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:47:54,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54 WrapperNode [2019-09-09 05:47:54,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:47:54,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:47:54,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:47:54,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:47:54,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (1/1) ... [2019-09-09 05:47:54,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:47:54,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:47:54,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:47:54,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:47:54,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (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 05:47:54,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:47:54,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:47:54,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:47:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:47:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:47:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:47:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:47:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:47:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:47:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:47:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:47:55,180 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:47:55,180 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:47:55,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:47:55 BoogieIcfgContainer [2019-09-09 05:47:55,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:47:55,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:47:55,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:47:55,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:47:55,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:47:54" (1/3) ... [2019-09-09 05:47:55,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3bd60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:47:55, skipping insertion in model container [2019-09-09 05:47:55,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:47:54" (2/3) ... [2019-09-09 05:47:55,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3bd60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:47:55, skipping insertion in model container [2019-09-09 05:47:55,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:47:55" (3/3) ... [2019-09-09 05:47:55,189 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-09-09 05:47:55,200 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:47:55,208 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:47:55,233 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:47:55,281 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:47:55,282 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:47:55,282 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:47:55,296 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:47:55,296 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:47:55,297 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:47:55,297 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:47:55,297 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:47:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-09-09 05:47:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-09 05:47:55,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:55,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:55,343 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2019-09-09 05:47:55,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:55,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:55,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:55,470 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 05:47:55,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:55,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:55,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:55,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:55,494 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-09-09 05:47:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:55,631 INFO L93 Difference]: Finished difference Result 91 states and 139 transitions. [2019-09-09 05:47:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:55,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-09 05:47:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:55,657 INFO L225 Difference]: With dead ends: 91 [2019-09-09 05:47:55,657 INFO L226 Difference]: Without dead ends: 83 [2019-09-09 05:47:55,661 INFO L628 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-09-09 05:47:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-09 05:47:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-09 05:47:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-09 05:47:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2019-09-09 05:47:55,742 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 8 [2019-09-09 05:47:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2019-09-09 05:47:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2019-09-09 05:47:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-09 05:47:55,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:55,746 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:55,746 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2019-09-09 05:47:55,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:55,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:55,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:55,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:55,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:55,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:55,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:55,815 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 3 states. [2019-09-09 05:47:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:55,895 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2019-09-09 05:47:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:55,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-09 05:47:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:55,898 INFO L225 Difference]: With dead ends: 121 [2019-09-09 05:47:55,898 INFO L226 Difference]: Without dead ends: 121 [2019-09-09 05:47:55,899 INFO L628 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-09-09 05:47:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-09 05:47:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-09 05:47:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-09 05:47:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2019-09-09 05:47:55,913 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 13 [2019-09-09 05:47:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:55,914 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2019-09-09 05:47:55,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2019-09-09 05:47:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:47:55,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:55,916 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:55,916 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2019-09-09 05:47:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:55,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-09 05:47:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:55,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:55,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:55,971 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand 3 states. [2019-09-09 05:47:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:56,062 INFO L93 Difference]: Finished difference Result 159 states and 243 transitions. [2019-09-09 05:47:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:56,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:47:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:56,067 INFO L225 Difference]: With dead ends: 159 [2019-09-09 05:47:56,069 INFO L226 Difference]: Without dead ends: 159 [2019-09-09 05:47:56,070 INFO L628 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-09-09 05:47:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-09 05:47:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-09-09 05:47:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-09 05:47:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2019-09-09 05:47:56,096 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 19 [2019-09-09 05:47:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:56,097 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2019-09-09 05:47:56,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2019-09-09 05:47:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:47:56,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:56,100 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-09-09 05:47:56,101 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2019-09-09 05:47:56,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 05:47:56,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:56,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:56,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:56,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:56,180 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 3 states. [2019-09-09 05:47:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:56,314 INFO L93 Difference]: Finished difference Result 217 states and 300 transitions. [2019-09-09 05:47:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:56,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-09 05:47:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:56,318 INFO L225 Difference]: With dead ends: 217 [2019-09-09 05:47:56,318 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:47:56,319 INFO L628 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-09-09 05:47:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:47:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-09-09 05:47:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-09 05:47:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2019-09-09 05:47:56,349 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 34 [2019-09-09 05:47:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:56,349 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2019-09-09 05:47:56,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2019-09-09 05:47:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:47:56,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:56,352 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:56,353 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2019-09-09 05:47:56,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:56,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:56,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-09 05:47:56,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:56,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:56,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:56,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:56,414 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand 3 states. [2019-09-09 05:47:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:56,484 INFO L93 Difference]: Finished difference Result 264 states and 370 transitions. [2019-09-09 05:47:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:56,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-09 05:47:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:56,487 INFO L225 Difference]: With dead ends: 264 [2019-09-09 05:47:56,487 INFO L226 Difference]: Without dead ends: 264 [2019-09-09 05:47:56,489 INFO L628 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-09-09 05:47:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-09 05:47:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-09 05:47:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-09 05:47:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-09-09 05:47:56,503 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 48 [2019-09-09 05:47:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:56,503 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-09-09 05:47:56,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-09-09 05:47:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:47:56,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:56,507 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:56,507 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2019-09-09 05:47:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:56,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:47:56,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:56,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:56,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:56,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:56,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:56,551 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 3 states. [2019-09-09 05:47:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:56,646 INFO L93 Difference]: Finished difference Result 270 states and 345 transitions. [2019-09-09 05:47:56,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:56,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-09 05:47:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:56,648 INFO L225 Difference]: With dead ends: 270 [2019-09-09 05:47:56,648 INFO L226 Difference]: Without dead ends: 192 [2019-09-09 05:47:56,649 INFO L628 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-09-09 05:47:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-09 05:47:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-09-09 05:47:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-09 05:47:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2019-09-09 05:47:56,656 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 51 [2019-09-09 05:47:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:56,657 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2019-09-09 05:47:56,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2019-09-09 05:47:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:47:56,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:56,661 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:56,661 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:56,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1939547864, now seen corresponding path program 1 times [2019-09-09 05:47:56,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:56,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-09 05:47:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:56,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:56,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:56,765 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2019-09-09 05:47:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:56,776 INFO L93 Difference]: Finished difference Result 206 states and 260 transitions. [2019-09-09 05:47:56,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:56,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-09 05:47:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:56,777 INFO L225 Difference]: With dead ends: 206 [2019-09-09 05:47:56,777 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:47:56,777 INFO L628 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-09-09 05:47:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:47:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:47:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:47:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:47:56,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-09-09 05:47:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:56,779 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:47:56,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:47:56,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:47:56,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:47:56 BoogieIcfgContainer [2019-09-09 05:47:56,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:47:56,790 INFO L168 Benchmark]: Toolchain (without parser) took 2375.11 ms. Allocated memory was 133.7 MB in the beginning and 226.5 MB in the end (delta: 92.8 MB). Free memory was 89.1 MB in the beginning and 154.8 MB in the end (delta: -65.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:56,791 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:47:56,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.95 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 177.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:56,795 INFO L168 Benchmark]: Boogie Preprocessor took 57.43 ms. Allocated memory is still 200.8 MB. Free memory was 177.6 MB in the beginning and 175.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:56,796 INFO L168 Benchmark]: RCFGBuilder took 329.14 ms. Allocated memory is still 200.8 MB. Free memory was 175.4 MB in the beginning and 156.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:56,797 INFO L168 Benchmark]: TraceAbstraction took 1604.52 ms. Allocated memory was 200.8 MB in the beginning and 226.5 MB in the end (delta: 25.7 MB). Free memory was 156.8 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:56,805 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.95 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 177.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.43 ms. Allocated memory is still 200.8 MB. Free memory was 177.6 MB in the beginning and 175.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.14 ms. Allocated memory is still 200.8 MB. Free memory was 175.4 MB in the beginning and 156.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1604.52 ms. Allocated memory was 200.8 MB in the beginning and 226.5 MB in the end (delta: 25.7 MB). Free memory was 156.8 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: 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, 50 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 250 SDslu, 321 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=5, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 25301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...