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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:31:12,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:31:12,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:31:12,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:31:12,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:31:12,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:31:12,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:31:12,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:31:12,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:31:12,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:31:12,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:31:12,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:31:12,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:31:12,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:31:12,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:31:12,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:31:12,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:31:12,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:31:12,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:31:12,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:31:13,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:31:13,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:31:13,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:31:13,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:31:13,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:31:13,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:31:13,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:31:13,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:31:13,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:31:13,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:31:13,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:31:13,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:31:13,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:31:13,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:31:13,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:31:13,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:31:13,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:31:13,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:31:13,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:31:13,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:31:13,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:31:13,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:31:13,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:31:13,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:31:13,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:31:13,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:31:13,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:31:13,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:31:13,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:31:13,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:31:13,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:31:13,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:31:13,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:31:13,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:31:13,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:31:13,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:31:13,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:31:13,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:31:13,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:31:13,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:31:13,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:31:13,040 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:31:13,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:31:13,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:13,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:31:13,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:31:13,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:31:13,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:31:13,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:31:13,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:31:13,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:31:13,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:31:13,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:31:13,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:31:13,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:31:13,327 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:31:13,327 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2019-10-15 03:31:13,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662fd4fd0/2d637b7e3e4c437ca6094d5d5e73f9f1/FLAG4becd1bbd [2019-10-15 03:31:13,869 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:31:13,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2019-10-15 03:31:13,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662fd4fd0/2d637b7e3e4c437ca6094d5d5e73f9f1/FLAG4becd1bbd [2019-10-15 03:31:14,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662fd4fd0/2d637b7e3e4c437ca6094d5d5e73f9f1 [2019-10-15 03:31:14,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:31:14,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:31:14,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:14,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:31:14,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:31:14,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc444e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14, skipping insertion in model container [2019-10-15 03:31:14,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,271 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:31:14,293 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:14,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:14,489 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:14,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:14,522 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:14,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14 WrapperNode [2019-10-15 03:31:14,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:14,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:14,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:14,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:14,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (1/1) ... [2019-10-15 03:31:14,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:14,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:14,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:14,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:14,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (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-15 03:31:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:31:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:31:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:31:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:15,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:15,058 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:31:15,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:15 BoogieIcfgContainer [2019-10-15 03:31:15,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:15,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:15,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:15,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:15,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:31:14" (1/3) ... [2019-10-15 03:31:15,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188c0235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:15, skipping insertion in model container [2019-10-15 03:31:15,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:14" (2/3) ... [2019-10-15 03:31:15,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188c0235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:15, skipping insertion in model container [2019-10-15 03:31:15,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:15" (3/3) ... [2019-10-15 03:31:15,070 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2019-10-15 03:31:15,081 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:15,091 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:15,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:15,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:15,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:15,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:15,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:15,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:15,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:15,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:15,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-15 03:31:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-15 03:31:15,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:15,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:15,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2134687016, now seen corresponding path program 1 times [2019-10-15 03:31:15,171 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:15,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767849784] [2019-10-15 03:31:15,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:15,291 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-15 03:31:15,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767849784] [2019-10-15 03:31:15,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:15,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:15,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878505303] [2019-10-15 03:31:15,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:15,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:15,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:15,314 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-15 03:31:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:15,386 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2019-10-15 03:31:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:15,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-15 03:31:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:15,399 INFO L225 Difference]: With dead ends: 52 [2019-10-15 03:31:15,400 INFO L226 Difference]: Without dead ends: 27 [2019-10-15 03:31:15,403 INFO L600 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-15 03:31:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-15 03:31:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-15 03:31:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:31:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-15 03:31:15,446 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 8 [2019-10-15 03:31:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:15,446 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-15 03:31:15,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-15 03:31:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:31:15,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:15,448 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:15,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1122254586, now seen corresponding path program 1 times [2019-10-15 03:31:15,449 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:15,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118078870] [2019-10-15 03:31:15,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:15,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118078870] [2019-10-15 03:31:15,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530935812] [2019-10-15 03:31:15,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:15,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 03:31:15,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:15,557 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:15,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:15,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2019-10-15 03:31:15,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029102855] [2019-10-15 03:31:15,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:15,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:15,595 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 3 states. [2019-10-15 03:31:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:15,645 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-10-15 03:31:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:15,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-15 03:31:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:15,647 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:31:15,647 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:31:15,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:31:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-15 03:31:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:31:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-10-15 03:31:15,659 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 11 [2019-10-15 03:31:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:15,659 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-10-15 03:31:15,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2019-10-15 03:31:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:31:15,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:15,661 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:15,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:15,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:15,875 INFO L82 PathProgramCache]: Analyzing trace with hash -696464287, now seen corresponding path program 1 times [2019-10-15 03:31:15,876 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:15,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108220870] [2019-10-15 03:31:15,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:15,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:15,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108220870] [2019-10-15 03:31:15,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64350999] [2019-10-15 03:31:15,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:16,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 03:31:16,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:16,027 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:16,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:31:16,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:16,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 7 [2019-10-15 03:31:16,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544419723] [2019-10-15 03:31:16,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:16,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:16,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:16,079 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 3 states. [2019-10-15 03:31:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:16,134 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-10-15 03:31:16,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:16,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 03:31:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:16,137 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:31:16,137 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:31:16,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:31:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-15 03:31:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-15 03:31:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2019-10-15 03:31:16,148 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 17 [2019-10-15 03:31:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:16,149 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2019-10-15 03:31:16,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2019-10-15 03:31:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:31:16,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:16,151 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:16,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:16,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 710966102, now seen corresponding path program 1 times [2019-10-15 03:31:16,358 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:16,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071422021] [2019-10-15 03:31:16,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:16,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:16,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:31:16,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071422021] [2019-10-15 03:31:16,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:16,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:16,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418722190] [2019-10-15 03:31:16,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:16,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:16,415 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand 3 states. [2019-10-15 03:31:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:16,462 INFO L93 Difference]: Finished difference Result 105 states and 149 transitions. [2019-10-15 03:31:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:16,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 03:31:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:16,464 INFO L225 Difference]: With dead ends: 105 [2019-10-15 03:31:16,464 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:31:16,465 INFO L600 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-15 03:31:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:31:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-10-15 03:31:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:31:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-10-15 03:31:16,473 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 19 [2019-10-15 03:31:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:16,474 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-10-15 03:31:16,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-10-15 03:31:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:31:16,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:16,476 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:16,476 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 697914301, now seen corresponding path program 1 times [2019-10-15 03:31:16,477 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:16,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681629338] [2019-10-15 03:31:16,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:16,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:16,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:31:16,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681629338] [2019-10-15 03:31:16,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:16,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:16,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835581849] [2019-10-15 03:31:16,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:16,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:16,529 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 3 states. [2019-10-15 03:31:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:16,568 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2019-10-15 03:31:16,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:16,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 03:31:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:16,570 INFO L225 Difference]: With dead ends: 67 [2019-10-15 03:31:16,570 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:31:16,570 INFO L600 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-15 03:31:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:31:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-15 03:31:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-15 03:31:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-10-15 03:31:16,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 25 [2019-10-15 03:31:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:16,580 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-10-15 03:31:16,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-10-15 03:31:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 03:31:16,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:16,581 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:16,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1651754432, now seen corresponding path program 1 times [2019-10-15 03:31:16,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:16,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451269369] [2019-10-15 03:31:16,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:16,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:16,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:31:16,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451269369] [2019-10-15 03:31:16,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:16,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:16,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051620672] [2019-10-15 03:31:16,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:16,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:16,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:16,613 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 3 states. [2019-10-15 03:31:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:16,625 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-10-15 03:31:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:16,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 03:31:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:16,626 INFO L225 Difference]: With dead ends: 68 [2019-10-15 03:31:16,626 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:31:16,627 INFO L600 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-15 03:31:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:31:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:31:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:31:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:31:16,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-15 03:31:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:16,628 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:31:16,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:31:16,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:31:16,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:31:16,814 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:31:16,814 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:31:16,814 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:31:16,814 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:31:16,814 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:31:16,815 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:31:16,815 INFO L439 ceAbstractionStarter]: At program point L97(lines 9 141) the Hoare annotation is: false [2019-10-15 03:31:16,815 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 54 107) no Hoare annotation was computed. [2019-10-15 03:31:16,815 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 141) no Hoare annotation was computed. [2019-10-15 03:31:16,815 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 54 107) no Hoare annotation was computed. [2019-10-15 03:31:16,815 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-15 03:31:16,816 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 54 107) no Hoare annotation was computed. [2019-10-15 03:31:16,816 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-10-15 03:31:16,816 INFO L439 ceAbstractionStarter]: At program point L25(lines 25 128) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8640 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:16,816 INFO L439 ceAbstractionStarter]: At program point L50(lines 50 109) the Hoare annotation is: (< main_~blastFlag~0 5) [2019-10-15 03:31:16,817 INFO L439 ceAbstractionStarter]: At program point L46(lines 46 111) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8640 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:16,817 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 141) no Hoare annotation was computed. [2019-10-15 03:31:16,817 INFO L446 ceAbstractionStarter]: At program point L137(lines 9 141) the Hoare annotation is: true [2019-10-15 03:31:16,817 INFO L439 ceAbstractionStarter]: At program point L100(lines 18 135) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8640 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:16,817 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-10-15 03:31:16,817 INFO L439 ceAbstractionStarter]: At program point L30(lines 30 125) the Hoare annotation is: (or (and (= 8640 main_~s__state~0) (not (= 0 main_~s__hit~0))) (and (<= 8640 main_~s__state~0) (< main_~blastFlag~0 5)) (<= main_~blastFlag~0 2)) [2019-10-15 03:31:16,818 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 141) the Hoare annotation is: true [2019-10-15 03:31:16,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:31:16 BoogieIcfgContainer [2019-10-15 03:31:16,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:31:16,848 INFO L168 Benchmark]: Toolchain (without parser) took 2594.11 ms. Allocated memory was 138.9 MB in the beginning and 234.9 MB in the end (delta: 95.9 MB). Free memory was 102.5 MB in the beginning and 168.8 MB in the end (delta: -66.3 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,851 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.96 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,859 INFO L168 Benchmark]: Boogie Preprocessor took 107.94 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 180.7 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,861 INFO L168 Benchmark]: RCFGBuilder took 428.50 ms. Allocated memory is still 202.4 MB. Free memory was 180.7 MB in the beginning and 162.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,862 INFO L168 Benchmark]: TraceAbstraction took 1782.25 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 161.6 MB in the beginning and 168.8 MB in the end (delta: -7.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:31:16,873 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.96 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.94 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 180.7 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 428.50 ms. Allocated memory is still 202.4 MB. Free memory was 180.7 MB in the beginning and 162.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1782.25 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 161.6 MB in the beginning and 168.8 MB in the end (delta: -7.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: blastFlag < 5 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8640 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8640 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8640 <= s__state && blastFlag < 5)) || blastFlag <= 2 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((8640 == s__state && !(0 == s__hit)) || (8640 <= s__state && blastFlag < 5)) || blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 125 SDtfs, 34 SDslu, 73 SDs, 0 SdLazy, 74 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 43 NumberOfFragments, 85 HoareAnnotationTreeSize, 11 FomulaSimplifications, 324 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 28 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 5153 SizeOfPredicates, 2 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 51/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...