/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:13:51,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:13:51,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:13:51,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:13:51,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:13:51,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:13:51,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:13:51,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:13:51,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:13:51,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:13:51,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:13:51,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:13:51,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:13:51,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:13:51,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:13:51,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:13:51,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:13:51,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:13:51,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:13:51,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:13:51,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:13:51,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:13:51,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:13:51,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:13:51,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:13:51,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:13:51,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:13:51,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:13:51,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:13:51,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:13:51,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:13:51,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:13:51,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:13:51,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:13:51,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:13:51,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:13:51,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:13:51,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:13:51,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:13:51,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:13:51,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:13:51,533 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-11-07 01:13:51,549 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:13:51,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:13:51,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:13:51,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:13:51,554 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:13:51,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:13:51,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:13:51,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:13:51,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:13:51,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:13:51,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:13:51,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:13:51,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:13:51,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:13:51,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:13:51,558 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:13:51,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:13:51,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:13:51,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:13:51,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:13:51,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:13:51,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:51,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:13:51,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:13:51,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:13:51,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:13:51,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:13:51,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:13:51,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:13:51,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:13:51,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:13:51,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:13:51,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:13:51,877 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:13:51,878 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-11-07 01:13:51,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c084fde5d/c1d5cf4161ba40fa977417e7afae1803/FLAG62ef3b06f [2019-11-07 01:13:52,466 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:13:52,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b.cil.c [2019-11-07 01:13:52,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c084fde5d/c1d5cf4161ba40fa977417e7afae1803/FLAG62ef3b06f [2019-11-07 01:13:52,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c084fde5d/c1d5cf4161ba40fa977417e7afae1803 [2019-11-07 01:13:52,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:13:52,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:13:52,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:52,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:13:52,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:13:52,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:52" (1/1) ... [2019-11-07 01:13:52,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abea181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:52, skipping insertion in model container [2019-11-07 01:13:52,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:52" (1/1) ... [2019-11-07 01:13:52,954 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:13:53,018 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:13:53,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:53,365 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:13:53,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:53,425 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:13:53,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53 WrapperNode [2019-11-07 01:13:53,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:53,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:13:53,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:13:53,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:13:53,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (1/1) ... [2019-11-07 01:13:53,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:13:53,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:13:53,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:13:53,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:13:53,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (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-11-07 01:13:53,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:13:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:13:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:13:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:13:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:13:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:13:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:13:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:13:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:13:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:13:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:13:53,842 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:13:53,842 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:13:53,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:53 BoogieIcfgContainer [2019-11-07 01:13:53,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:13:53,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:13:53,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:13:53,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:13:53,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:13:52" (1/3) ... [2019-11-07 01:13:53,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22daa63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:53, skipping insertion in model container [2019-11-07 01:13:53,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:53" (2/3) ... [2019-11-07 01:13:53,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22daa63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:53, skipping insertion in model container [2019-11-07 01:13:53,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:53" (3/3) ... [2019-11-07 01:13:53,872 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2019-11-07 01:13:53,884 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:13:53,893 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:13:53,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:13:53,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:13:53,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:13:53,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:13:53,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:13:53,951 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:13:53,951 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:13:53,951 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:13:53,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:13:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-07 01:13:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-07 01:13:53,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:53,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:53,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2134687016, now seen corresponding path program 1 times [2019-11-07 01:13:53,987 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:53,988 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113323151] [2019-11-07 01:13:53,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:54,118 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113323151] [2019-11-07 01:13:54,119 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,119 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:54,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215647538] [2019-11-07 01:13:54,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:54,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:54,158 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-11-07 01:13:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,301 INFO L93 Difference]: Finished difference Result 70 states and 116 transitions. [2019-11-07 01:13:54,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:54,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-07 01:13:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,320 INFO L225 Difference]: With dead ends: 70 [2019-11-07 01:13:54,321 INFO L226 Difference]: Without dead ends: 39 [2019-11-07 01:13:54,327 INFO L630 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-11-07 01:13:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-07 01:13:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-07 01:13:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 01:13:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-07 01:13:54,396 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 8 [2019-11-07 01:13:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,397 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-07 01:13:54,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-07 01:13:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 01:13:54,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,401 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,401 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1966827798, now seen corresponding path program 1 times [2019-11-07 01:13:54,403 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,404 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417504492] [2019-11-07 01:13:54,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:54,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417504492] [2019-11-07 01:13:54,454 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,454 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:54,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483447969] [2019-11-07 01:13:54,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:54,457 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:54,458 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2019-11-07 01:13:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,526 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-11-07 01:13:54,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:54,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-07 01:13:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,528 INFO L225 Difference]: With dead ends: 87 [2019-11-07 01:13:54,529 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 01:13:54,530 INFO L630 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-11-07 01:13:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 01:13:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-11-07 01:13:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-07 01:13:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2019-11-07 01:13:54,541 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 13 [2019-11-07 01:13:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,541 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-11-07 01:13:54,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2019-11-07 01:13:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 01:13:54,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,543 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1966887380, now seen corresponding path program 1 times [2019-11-07 01:13:54,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,545 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662260474] [2019-11-07 01:13:54,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:54,584 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662260474] [2019-11-07 01:13:54,585 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,585 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:54,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063768124] [2019-11-07 01:13:54,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:54,586 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:54,587 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand 3 states. [2019-11-07 01:13:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,661 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2019-11-07 01:13:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:54,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-07 01:13:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,663 INFO L225 Difference]: With dead ends: 93 [2019-11-07 01:13:54,663 INFO L226 Difference]: Without dead ends: 70 [2019-11-07 01:13:54,664 INFO L630 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-11-07 01:13:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-07 01:13:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-07 01:13:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-07 01:13:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2019-11-07 01:13:54,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 13 [2019-11-07 01:13:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,679 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2019-11-07 01:13:54,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2019-11-07 01:13:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 01:13:54,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,681 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,681 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 280007728, now seen corresponding path program 1 times [2019-11-07 01:13:54,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996851919] [2019-11-07 01:13:54,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 01:13:54,733 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996851919] [2019-11-07 01:13:54,734 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,735 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:54,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142017143] [2019-11-07 01:13:54,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:54,736 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:54,737 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 3 states. [2019-11-07 01:13:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,821 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2019-11-07 01:13:54,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:54,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 01:13:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,823 INFO L225 Difference]: With dead ends: 137 [2019-11-07 01:13:54,823 INFO L226 Difference]: Without dead ends: 93 [2019-11-07 01:13:54,824 INFO L630 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-11-07 01:13:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-07 01:13:54,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-07 01:13:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-07 01:13:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2019-11-07 01:13:54,839 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 20 [2019-11-07 01:13:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,839 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2019-11-07 01:13:54,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2019-11-07 01:13:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 01:13:54,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,841 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash 885328029, now seen corresponding path program 1 times [2019-11-07 01:13:54,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442218317] [2019-11-07 01:13:54,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 01:13:54,884 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442218317] [2019-11-07 01:13:54,884 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:54,885 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:54,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553683416] [2019-11-07 01:13:54,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:54,885 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:54,887 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand 3 states. [2019-11-07 01:13:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:54,937 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2019-11-07 01:13:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:54,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 01:13:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:54,939 INFO L225 Difference]: With dead ends: 181 [2019-11-07 01:13:54,939 INFO L226 Difference]: Without dead ends: 76 [2019-11-07 01:13:54,940 INFO L630 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-11-07 01:13:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-07 01:13:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-07 01:13:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-07 01:13:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2019-11-07 01:13:54,952 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 23 [2019-11-07 01:13:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:54,953 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2019-11-07 01:13:54,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2019-11-07 01:13:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 01:13:54,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:54,955 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:54,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1155086362, now seen corresponding path program 1 times [2019-11-07 01:13:54,956 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:54,957 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803322470] [2019-11-07 01:13:54,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:13:55,007 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803322470] [2019-11-07 01:13:55,008 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:55,008 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:55,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220113176] [2019-11-07 01:13:55,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:55,009 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:55,010 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 3 states. [2019-11-07 01:13:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:55,042 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2019-11-07 01:13:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:55,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-07 01:13:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:55,047 INFO L225 Difference]: With dead ends: 124 [2019-11-07 01:13:55,047 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:13:55,052 INFO L630 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-11-07 01:13:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:13:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:13:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:13:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:13:55,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-07 01:13:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:55,053 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:13:55,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:13:55,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:13:55,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:13:55,257 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 01:13:55,258 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:55,258 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:55,258 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 01:13:55,258 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:13:55,258 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:13:55,259 INFO L439 ceAbstractionStarter]: At program point L97(lines 9 141) the Hoare annotation is: false [2019-11-07 01:13:55,259 INFO L439 ceAbstractionStarter]: At program point L31(lines 30 125) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-11-07 01:13:55,259 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 54 107) no Hoare annotation was computed. [2019-11-07 01:13:55,259 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 141) no Hoare annotation was computed. [2019-11-07 01:13:55,259 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 54 107) no Hoare annotation was computed. [2019-11-07 01:13:55,259 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-07 01:13:55,260 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 54 107) no Hoare annotation was computed. [2019-11-07 01:13:55,260 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-11-07 01:13:55,260 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 128) no Hoare annotation was computed. [2019-11-07 01:13:55,260 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 54 107) no Hoare annotation was computed. [2019-11-07 01:13:55,260 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 109) no Hoare annotation was computed. [2019-11-07 01:13:55,260 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 111) no Hoare annotation was computed. [2019-11-07 01:13:55,261 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 141) no Hoare annotation was computed. [2019-11-07 01:13:55,261 INFO L446 ceAbstractionStarter]: At program point L137(lines 9 141) the Hoare annotation is: true [2019-11-07 01:13:55,261 INFO L439 ceAbstractionStarter]: At program point L100(lines 18 135) the Hoare annotation is: (or (and (<= 8640 main_~s__state~0) (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2)) [2019-11-07 01:13:55,261 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-11-07 01:13:55,261 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 125) no Hoare annotation was computed. [2019-11-07 01:13:55,261 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 141) the Hoare annotation is: true [2019-11-07 01:13:55,262 INFO L439 ceAbstractionStarter]: At program point L26(lines 25 128) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-11-07 01:13:55,262 INFO L439 ceAbstractionStarter]: At program point L51(lines 50 109) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 2)) (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))))) [2019-11-07 01:13:55,262 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-11-07 01:13:55,262 INFO L439 ceAbstractionStarter]: At program point L47(lines 46 111) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2019-11-07 01:13:55,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:13:55 BoogieIcfgContainer [2019-11-07 01:13:55,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:13:55,282 INFO L168 Benchmark]: Toolchain (without parser) took 2383.33 ms. Allocated memory was 138.9 MB in the beginning and 235.9 MB in the end (delta: 97.0 MB). Free memory was 103.4 MB in the beginning and 192.8 MB in the end (delta: -89.4 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:55,283 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-07 01:13:55,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.85 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:55,285 INFO L168 Benchmark]: Boogie Preprocessor took 118.50 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.0 MB in the beginning and 178.9 MB in the end (delta: -86.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:55,286 INFO L168 Benchmark]: RCFGBuilder took 302.67 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 164.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:55,287 INFO L168 Benchmark]: TraceAbstraction took 1429.87 ms. Allocated memory was 201.9 MB in the beginning and 235.9 MB in the end (delta: 34.1 MB). Free memory was 164.9 MB in the beginning and 192.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:55,290 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.17 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 520.85 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.50 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.0 MB in the beginning and 178.9 MB in the end (delta: -86.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 302.67 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 164.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1429.87 ms. Allocated memory was 201.9 MB in the beginning and 235.9 MB in the end (delta: 34.1 MB). Free memory was 164.9 MB in the beginning and 192.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 82.1 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: (8656 <= s__state && blastFlag <= 2) || ((8656 <= s__state && blastFlag <= 3) && !(0 == s__hit)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 184 SDtfs, 92 SDslu, 109 SDs, 0 SdLazy, 95 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 34 NumberOfFragments, 65 HoareAnnotationTreeSize, 11 FomulaSimplifications, 175 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 4626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 42/42 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...