./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edfcf451b435e6b30ae37c75ee1e2f5c8348550f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:23:46,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:23:46,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:23:46,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:23:46,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:23:46,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:23:46,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:23:46,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:23:46,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:23:46,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:23:46,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:23:46,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:23:46,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:23:46,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:23:46,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:23:46,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:23:46,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:23:46,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:23:46,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:23:46,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:23:46,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:23:46,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:23:46,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:23:46,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:23:46,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:23:46,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:23:46,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:23:46,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:23:46,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:23:46,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:23:46,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:23:46,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:23:46,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:23:46,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:23:46,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:23:46,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:23:46,863 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:23:46,878 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:23:46,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:23:46,879 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:23:46,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:23:46,880 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:23:46,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:23:46,880 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:23:46,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:23:46,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:23:46,883 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:23:46,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:23:46,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:23:46,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:23:46,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:23:46,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:23:46,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:23:46,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:23:46,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:23:46,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:23:46,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:23:46,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:23:46,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:23:46,888 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-01-12 11:23:46,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:23:46,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:23:46,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:23:46,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:23:46,952 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:23:46,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2019-01-12 11:23:47,015 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89491ebc/753ceb4a765746abaa8e0c020bcdcd19/FLAG98cbbad4e [2019-01-12 11:23:47,547 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:23:47,547 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2019-01-12 11:23:47,558 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89491ebc/753ceb4a765746abaa8e0c020bcdcd19/FLAG98cbbad4e [2019-01-12 11:23:47,832 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89491ebc/753ceb4a765746abaa8e0c020bcdcd19 [2019-01-12 11:23:47,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:23:47,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:23:47,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:23:47,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:23:47,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:23:47,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:23:47" (1/1) ... [2019-01-12 11:23:47,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:47, skipping insertion in model container [2019-01-12 11:23:47,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:23:47" (1/1) ... [2019-01-12 11:23:47,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:23:47,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:23:48,201 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:23:48,213 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:23:48,262 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:23:48,277 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:23:48,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48 WrapperNode [2019-01-12 11:23:48,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:23:48,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:23:48,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:23:48,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:23:48,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:23:48,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:23:48,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:23:48,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:23:48,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (1/1) ... [2019-01-12 11:23:48,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:23:48,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:23:48,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:23:48,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:23:48,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (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-01-12 11:23:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:23:48,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:23:49,168 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:23:49,168 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:23:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:23:49 BoogieIcfgContainer [2019-01-12 11:23:49,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:23:49,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:23:49,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:23:49,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:23:49,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:23:47" (1/3) ... [2019-01-12 11:23:49,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d448a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:23:49, skipping insertion in model container [2019-01-12 11:23:49,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:23:48" (2/3) ... [2019-01-12 11:23:49,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d448a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:23:49, skipping insertion in model container [2019-01-12 11:23:49,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:23:49" (3/3) ... [2019-01-12 11:23:49,178 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2019-01-12 11:23:49,187 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:23:49,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-01-12 11:23:49,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-01-12 11:23:49,248 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:23:49,249 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:23:49,249 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:23:49,249 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:23:49,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:23:49,250 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:23:49,250 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:23:49,250 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:23:49,250 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:23:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-01-12 11:23:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:23:49,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:49,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:49,278 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2019-01-12 11:23:49,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:49,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:49,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:49,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:49,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:49,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:23:49,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:23:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:23:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:23:49,554 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2019-01-12 11:23:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:50,090 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2019-01-12 11:23:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:50,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-12 11:23:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:50,104 INFO L225 Difference]: With dead ends: 125 [2019-01-12 11:23:50,104 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 11:23:50,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 11:23:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-01-12 11:23:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 11:23:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-01-12 11:23:50,149 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-01-12 11:23:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:50,150 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-01-12 11:23:50,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:23:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-01-12 11:23:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:23:50,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:50,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:50,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:50,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2019-01-12 11:23:50,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:50,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:50,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:50,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:23:50,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:23:50,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:23:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:23:50,223 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-01-12 11:23:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:50,377 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-12 11:23:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:23:50,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-12 11:23:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:50,381 INFO L225 Difference]: With dead ends: 65 [2019-01-12 11:23:50,381 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 11:23:50,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:23:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 11:23:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-12 11:23:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-12 11:23:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-12 11:23:50,392 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2019-01-12 11:23:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:50,392 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-12 11:23:50,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:23:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-12 11:23:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:23:50,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:50,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:50,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2019-01-12 11:23:50,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:50,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:50,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:50,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:50,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:50,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:50,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:23:50,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:23:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:23:50,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:23:50,502 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-01-12 11:23:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:50,950 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-12 11:23:50,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:50,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 11:23:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:50,954 INFO L225 Difference]: With dead ends: 69 [2019-01-12 11:23:50,954 INFO L226 Difference]: Without dead ends: 67 [2019-01-12 11:23:50,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-12 11:23:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-12 11:23:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 11:23:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-01-12 11:23:50,963 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2019-01-12 11:23:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:50,964 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-01-12 11:23:50,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:23:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-01-12 11:23:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:23:50,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:50,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:50,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2019-01-12 11:23:50,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:50,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:50,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:51,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:51,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:51,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:51,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:51,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:51,092 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-01-12 11:23:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:51,350 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-01-12 11:23:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:51,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 11:23:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:51,356 INFO L225 Difference]: With dead ends: 103 [2019-01-12 11:23:51,356 INFO L226 Difference]: Without dead ends: 101 [2019-01-12 11:23:51,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-12 11:23:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2019-01-12 11:23:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-12 11:23:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-01-12 11:23:51,366 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2019-01-12 11:23:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:51,366 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-01-12 11:23:51,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-01-12 11:23:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:23:51,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:51,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:51,369 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:51,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2019-01-12 11:23:51,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:51,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:51,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:51,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:51,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:51,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:51,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:51,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:51,478 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2019-01-12 11:23:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:51,646 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-12 11:23:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:51,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 11:23:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:51,649 INFO L225 Difference]: With dead ends: 65 [2019-01-12 11:23:51,649 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 11:23:51,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 11:23:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-12 11:23:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 11:23:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-01-12 11:23:51,657 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2019-01-12 11:23:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:51,657 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-01-12 11:23:51,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-01-12 11:23:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:23:51,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:51,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:51,659 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2019-01-12 11:23:51,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:51,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:51,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:51,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:51,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:51,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:51,728 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2019-01-12 11:23:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:52,471 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-12 11:23:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:52,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-12 11:23:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:52,474 INFO L225 Difference]: With dead ends: 97 [2019-01-12 11:23:52,474 INFO L226 Difference]: Without dead ends: 93 [2019-01-12 11:23:52,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-12 11:23:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 58. [2019-01-12 11:23:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-12 11:23:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-01-12 11:23:52,488 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-01-12 11:23:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:52,489 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-01-12 11:23:52,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-01-12 11:23:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:23:52,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:52,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:52,492 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2019-01-12 11:23:52,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:52,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:52,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:52,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:52,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:52,587 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2019-01-12 11:23:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:52,788 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-01-12 11:23:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:52,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-12 11:23:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:52,791 INFO L225 Difference]: With dead ends: 134 [2019-01-12 11:23:52,791 INFO L226 Difference]: Without dead ends: 132 [2019-01-12 11:23:52,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-12 11:23:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 56. [2019-01-12 11:23:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 11:23:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-01-12 11:23:52,801 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2019-01-12 11:23:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:52,801 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-01-12 11:23:52,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-01-12 11:23:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:23:52,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:52,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:52,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2019-01-12 11:23:52,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:52,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:52,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:52,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:52,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:52,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:52,870 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2019-01-12 11:23:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:53,030 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-01-12 11:23:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:53,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-12 11:23:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:53,032 INFO L225 Difference]: With dead ends: 57 [2019-01-12 11:23:53,032 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 11:23:53,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 11:23:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-12 11:23:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 11:23:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-01-12 11:23:53,040 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2019-01-12 11:23:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:53,040 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-01-12 11:23:53,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-01-12 11:23:53,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:23:53,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:53,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:53,042 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:53,042 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2019-01-12 11:23:53,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:53,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:53,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:53,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:53,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 11:23:53,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:23:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:23:53,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:23:53,193 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 9 states. [2019-01-12 11:23:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:53,476 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-01-12 11:23:53,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:53,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-01-12 11:23:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:53,478 INFO L225 Difference]: With dead ends: 91 [2019-01-12 11:23:53,479 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 11:23:53,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 11:23:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2019-01-12 11:23:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 11:23:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-01-12 11:23:53,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2019-01-12 11:23:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:53,485 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-01-12 11:23:53,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:23:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-01-12 11:23:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:23:53,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:53,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:53,486 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2019-01-12 11:23:53,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:53,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:53,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:53,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:53,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:53,708 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-01-12 11:23:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:53,821 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-01-12 11:23:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:53,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:23:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:53,824 INFO L225 Difference]: With dead ends: 68 [2019-01-12 11:23:53,824 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 11:23:53,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 11:23:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-01-12 11:23:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-12 11:23:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-01-12 11:23:53,830 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2019-01-12 11:23:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:53,830 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-01-12 11:23:53,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-01-12 11:23:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:23:53,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:53,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:53,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2019-01-12 11:23:53,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:53,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:53,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:53,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:53,918 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-01-12 11:23:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:54,023 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-12 11:23:54,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:54,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:23:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:54,026 INFO L225 Difference]: With dead ends: 49 [2019-01-12 11:23:54,026 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 11:23:54,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 11:23:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-12 11:23:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 11:23:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-01-12 11:23:54,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2019-01-12 11:23:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:54,032 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-01-12 11:23:54,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-01-12 11:23:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:23:54,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:54,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:54,034 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:54,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2019-01-12 11:23:54,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:54,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:54,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:54,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:54,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:54,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:54,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 11:23:54,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:23:54,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:23:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:23:54,232 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2019-01-12 11:23:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:54,437 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-12 11:23:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:54,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-01-12 11:23:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:54,439 INFO L225 Difference]: With dead ends: 47 [2019-01-12 11:23:54,439 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 11:23:54,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 11:23:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-01-12 11:23:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 11:23:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-12 11:23:54,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-01-12 11:23:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:54,446 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-12 11:23:54,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:23:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-12 11:23:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:23:54,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:54,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:54,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2019-01-12 11:23:54,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:54,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:54,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:54,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:54,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:54,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:54,552 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2019-01-12 11:23:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:55,081 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-01-12 11:23:55,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:55,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 11:23:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:55,083 INFO L225 Difference]: With dead ends: 57 [2019-01-12 11:23:55,083 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 11:23:55,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:23:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 11:23:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-12 11:23:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 11:23:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-12 11:23:55,091 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-01-12 11:23:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:55,091 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-12 11:23:55,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-12 11:23:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:23:55,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:55,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:55,096 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2019-01-12 11:23:55,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:55,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:55,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:55,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:55,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:55,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:55,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:55,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:55,479 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-01-12 11:23:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:55,646 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-01-12 11:23:55,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:55,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 11:23:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:55,648 INFO L225 Difference]: With dead ends: 61 [2019-01-12 11:23:55,648 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 11:23:55,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 11:23:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-01-12 11:23:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 11:23:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-12 11:23:55,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-01-12 11:23:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:55,654 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-12 11:23:55,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-12 11:23:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:23:55,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:55,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:55,656 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2019-01-12 11:23:55,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:55,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:55,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:55,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:55,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:55,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:55,792 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-01-12 11:23:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:55,956 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-01-12 11:23:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:55,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 11:23:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:55,958 INFO L225 Difference]: With dead ends: 37 [2019-01-12 11:23:55,958 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 11:23:55,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:23:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 11:23:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-12 11:23:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 11:23:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-12 11:23:55,963 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-01-12 11:23:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:55,963 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-12 11:23:55,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-12 11:23:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:23:55,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:55,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:55,965 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2019-01-12 11:23:55,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:55,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:56,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:56,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:56,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:56,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:56,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:56,059 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-01-12 11:23:56,334 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2019-01-12 11:23:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:56,453 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-01-12 11:23:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:56,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 11:23:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:56,455 INFO L225 Difference]: With dead ends: 48 [2019-01-12 11:23:56,455 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 11:23:56,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:23:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 11:23:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-01-12 11:23:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 11:23:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-12 11:23:56,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-01-12 11:23:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:56,460 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-12 11:23:56,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-01-12 11:23:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:23:56,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:56,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:56,461 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2019-01-12 11:23:56,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:56,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:56,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:56,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:56,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:56,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:56,549 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2019-01-12 11:23:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:56,698 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-12 11:23:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:56,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-12 11:23:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:56,700 INFO L225 Difference]: With dead ends: 35 [2019-01-12 11:23:56,700 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 11:23:56,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 11:23:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-12 11:23:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 11:23:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-12 11:23:56,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-01-12 11:23:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:56,706 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-12 11:23:56,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-12 11:23:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 11:23:56,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:56,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:56,708 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2019-01-12 11:23:56,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:56,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:56,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:56,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:56,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:56,775 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-01-12 11:23:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:57,141 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-12 11:23:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:57,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 11:23:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:57,141 INFO L225 Difference]: With dead ends: 33 [2019-01-12 11:23:57,142 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:23:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:23:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:23:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:23:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:23:57,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-12 11:23:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:57,145 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:23:57,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:23:57,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:23:57,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:23:57,982 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 14 [2019-01-12 11:23:58,139 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 13 [2019-01-12 11:23:58,405 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 8 [2019-01-12 11:23:58,588 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-01-12 11:23:58,591 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-01-12 11:23:58,592 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L451 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L451 ceAbstractionStarter]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-01-12 11:23:58,593 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-01-12 11:23:58,594 INFO L444 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 0 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 1)) [2019-01-12 11:23:58,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-01-12 11:23:58,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-01-12 11:23:58,594 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 11:23:58,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-01-12 11:23:58,594 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-01-12 11:23:58,594 INFO L444 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-01-12 11:23:58,595 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-01-12 11:23:58,596 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L448 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-01-12 11:23:58,597 INFO L444 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:23:58,597 INFO L444 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 11:23:58,598 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-01-12 11:23:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:23:58 BoogieIcfgContainer [2019-01-12 11:23:58,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:23:58,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:23:58,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:23:58,618 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:23:58,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:23:49" (3/4) ... [2019-01-12 11:23:58,624 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:23:58,638 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:23:58,639 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:23:58,732 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:23:58,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:23:58,733 INFO L168 Benchmark]: Toolchain (without parser) took 10896.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 946.0 MB in the beginning and 928.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:58,734 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:23:58,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.05 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:58,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.57 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:23:58,736 INFO L168 Benchmark]: Boogie Preprocessor took 139.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -218.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:58,737 INFO L168 Benchmark]: RCFGBuilder took 690.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:58,737 INFO L168 Benchmark]: TraceAbstraction took 9447.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 935.9 MB in the end (delta: 187.7 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:58,738 INFO L168 Benchmark]: Witness Printer took 114.19 ms. Allocated memory is still 1.2 GB. Free memory was 935.9 MB in the beginning and 928.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:58,742 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.05 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.57 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -218.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 690.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9447.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 935.9 MB in the end (delta: 187.7 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. * Witness Printer took 114.19 ms. Allocated memory is still 1.2 GB. Free memory was 935.9 MB in the beginning and 928.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t + 1 <= main__tagbuf_len) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) && __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. SAFE Result, 9.3s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 752 SDtfs, 2026 SDslu, 1126 SDs, 0 SdLazy, 1560 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 314 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 61 HoareAnnotationTreeSize, 6 FomulaSimplifications, 281084 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1572 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...