./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.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 1924a8dde25e8984c73792fdb4b4e419be9487c7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:43:06,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:43:06,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:43:06,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:43:06,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:43:06,089 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:43:06,090 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:43:06,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:43:06,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:43:06,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:43:06,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:43:06,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:43:06,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:43:06,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:43:06,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:43:06,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:43:06,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:43:06,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:43:06,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:43:06,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:43:06,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:43:06,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:43:06,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:43:06,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:43:06,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:43:06,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:43:06,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:43:06,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:43:06,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:43:06,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:43:06,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:43:06,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:43:06,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:43:06,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:43:06,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:43:06,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:43:06,124 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:43:06,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:43:06,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:43:06,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:43:06,158 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:43:06,160 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:43:06,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:43:06,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:43:06,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:43:06,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:43:06,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:43:06,161 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:43:06,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:43:06,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:43:06,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:43:06,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:43:06,162 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:43:06,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:43:06,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:43:06,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:43:06,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:43:06,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:43:06,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:43:06,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:43:06,165 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:43:06,165 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:43:06,165 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:43:06,166 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:43:06,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:43:06,166 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 -> 1924a8dde25e8984c73792fdb4b4e419be9487c7 [2018-12-30 19:43:06,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:43:06,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:43:06,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:43:06,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:43:06,241 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:43:06,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c [2018-12-30 19:43:06,301 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ba3eb31/a7f56f95979e45eb9f2799dc54823fb5/FLAG376bfda0b [2018-12-30 19:43:06,882 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:43:06,884 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c [2018-12-30 19:43:06,897 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ba3eb31/a7f56f95979e45eb9f2799dc54823fb5/FLAG376bfda0b [2018-12-30 19:43:07,113 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ba3eb31/a7f56f95979e45eb9f2799dc54823fb5 [2018-12-30 19:43:07,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:43:07,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:43:07,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:43:07,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:43:07,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:43:07,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:07,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbddce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07, skipping insertion in model container [2018-12-30 19:43:07,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:07,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:43:07,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:43:07,676 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:43:07,683 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:43:07,809 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:43:07,838 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:43:07,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07 WrapperNode [2018-12-30 19:43:07,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:43:07,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:43:07,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:43:07,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:43:07,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:07,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:43:08,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:43:08,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:43:08,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:43:08,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (1/1) ... [2018-12-30 19:43:08,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:43:08,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:43:08,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:43:08,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:43:08,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (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 [2018-12-30 19:43:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:43:08,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:43:11,554 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:43:11,555 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:43:11,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:43:11 BoogieIcfgContainer [2018-12-30 19:43:11,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:43:11,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:43:11,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:43:11,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:43:11,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:43:07" (1/3) ... [2018-12-30 19:43:11,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f51c5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:43:11, skipping insertion in model container [2018-12-30 19:43:11,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:43:07" (2/3) ... [2018-12-30 19:43:11,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f51c5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:43:11, skipping insertion in model container [2018-12-30 19:43:11,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:43:11" (3/3) ... [2018-12-30 19:43:11,564 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label51_true-unreach-call_false-termination.c [2018-12-30 19:43:11,575 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:43:11,584 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:43:11,602 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:43:11,636 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:43:11,637 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:43:11,637 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:43:11,637 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:43:11,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:43:11,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:43:11,638 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:43:11,638 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:43:11,638 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:43:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:43:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-30 19:43:11,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:11,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:11,678 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1145971337, now seen corresponding path program 1 times [2018-12-30 19:43:11,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:11,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:11,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:43:12,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:12,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:43:12,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:43:12,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:43:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:12,173 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2018-12-30 19:43:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:13,647 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2018-12-30 19:43:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:13,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-12-30 19:43:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:13,669 INFO L225 Difference]: With dead ends: 528 [2018-12-30 19:43:13,669 INFO L226 Difference]: Without dead ends: 266 [2018-12-30 19:43:13,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-30 19:43:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-12-30 19:43:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:43:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:43:13,736 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 106 [2018-12-30 19:43:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:13,737 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:43:13,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:43:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-30 19:43:13,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:13,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:13,742 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:13,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash 366337359, now seen corresponding path program 1 times [2018-12-30 19:43:13,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:13,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:13,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:43:13,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:13,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:13,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:13,829 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:43:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:14,974 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2018-12-30 19:43:14,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:14,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-30 19:43:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:14,981 INFO L225 Difference]: With dead ends: 792 [2018-12-30 19:43:14,981 INFO L226 Difference]: Without dead ends: 528 [2018-12-30 19:43:14,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:14,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-12-30 19:43:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-12-30 19:43:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-30 19:43:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2018-12-30 19:43:15,021 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 111 [2018-12-30 19:43:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:15,022 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2018-12-30 19:43:15,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2018-12-30 19:43:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-30 19:43:15,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:15,028 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:15,028 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash -206300869, now seen corresponding path program 1 times [2018-12-30 19:43:15,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:15,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:15,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:43:15,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:15,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:43:15,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:43:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:43:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:15,243 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2018-12-30 19:43:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:16,264 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2018-12-30 19:43:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:16,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2018-12-30 19:43:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:16,269 INFO L225 Difference]: With dead ends: 1185 [2018-12-30 19:43:16,269 INFO L226 Difference]: Without dead ends: 659 [2018-12-30 19:43:16,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-30 19:43:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2018-12-30 19:43:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-30 19:43:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2018-12-30 19:43:16,294 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 119 [2018-12-30 19:43:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:16,295 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2018-12-30 19:43:16,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2018-12-30 19:43:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-30 19:43:16,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:16,297 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:16,298 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash -118652371, now seen corresponding path program 1 times [2018-12-30 19:43:16,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:16,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:16,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:43:16,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:16,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:16,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:16,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:16,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:16,457 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2018-12-30 19:43:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:19,165 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2018-12-30 19:43:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:43:19,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-30 19:43:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:19,174 INFO L225 Difference]: With dead ends: 1971 [2018-12-30 19:43:19,174 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:43:19,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:43:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2018-12-30 19:43:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:43:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2018-12-30 19:43:19,219 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 128 [2018-12-30 19:43:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:19,219 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2018-12-30 19:43:19,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2018-12-30 19:43:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-30 19:43:19,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:19,224 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:19,224 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1007946460, now seen corresponding path program 1 times [2018-12-30 19:43:19,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:19,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:43:19,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:19,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:19,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:19,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:19,432 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2018-12-30 19:43:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:20,173 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2018-12-30 19:43:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:20,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-12-30 19:43:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:20,181 INFO L225 Difference]: With dead ends: 2762 [2018-12-30 19:43:20,182 INFO L226 Difference]: Without dead ends: 1450 [2018-12-30 19:43:20,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-30 19:43:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2018-12-30 19:43:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:43:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2018-12-30 19:43:20,225 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 134 [2018-12-30 19:43:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:20,225 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2018-12-30 19:43:20,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2018-12-30 19:43:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-30 19:43:20,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:20,233 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:20,233 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1361139476, now seen corresponding path program 1 times [2018-12-30 19:43:20,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:20,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:20,705 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:43:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:43:20,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:20,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:43:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:43:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:43:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:20,723 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2018-12-30 19:43:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:21,824 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2018-12-30 19:43:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:21,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-12-30 19:43:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:21,833 INFO L225 Difference]: With dead ends: 2888 [2018-12-30 19:43:21,833 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:43:21,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:43:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2018-12-30 19:43:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:43:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2018-12-30 19:43:21,867 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 138 [2018-12-30 19:43:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:21,867 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2018-12-30 19:43:21,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:43:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2018-12-30 19:43:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-30 19:43:21,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:21,872 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:21,873 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash -892874449, now seen corresponding path program 1 times [2018-12-30 19:43:21,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:21,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:43:21,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:21,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:43:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:43:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:21,972 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2018-12-30 19:43:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:22,505 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2018-12-30 19:43:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:22,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-12-30 19:43:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:22,515 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 19:43:22,515 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:43:22,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:43:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2018-12-30 19:43:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:43:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2018-12-30 19:43:22,586 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 141 [2018-12-30 19:43:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:22,586 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2018-12-30 19:43:22,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2018-12-30 19:43:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 19:43:22,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:22,591 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:22,592 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash 468657843, now seen corresponding path program 1 times [2018-12-30 19:43:22,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:22,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:22,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:23,087 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-30 19:43:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:43:23,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:23,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:43:23,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:43:23,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:43:23,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:23,108 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2018-12-30 19:43:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:25,216 INFO L93 Difference]: Finished difference Result 4593 states and 5243 transitions. [2018-12-30 19:43:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:25,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-12-30 19:43:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:25,228 INFO L225 Difference]: With dead ends: 4593 [2018-12-30 19:43:25,228 INFO L226 Difference]: Without dead ends: 3019 [2018-12-30 19:43:25,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2018-12-30 19:43:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 2493. [2018-12-30 19:43:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2018-12-30 19:43:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2762 transitions. [2018-12-30 19:43:25,278 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2762 transitions. Word has length 156 [2018-12-30 19:43:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:25,279 INFO L480 AbstractCegarLoop]: Abstraction has 2493 states and 2762 transitions. [2018-12-30 19:43:25,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:43:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2762 transitions. [2018-12-30 19:43:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-30 19:43:25,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:25,286 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:25,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -779622233, now seen corresponding path program 1 times [2018-12-30 19:43:25,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:25,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-30 19:43:25,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:25,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:43:25,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:25,497 INFO L87 Difference]: Start difference. First operand 2493 states and 2762 transitions. Second operand 4 states. [2018-12-30 19:43:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:28,276 INFO L93 Difference]: Finished difference Result 5508 states and 6131 transitions. [2018-12-30 19:43:28,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:43:28,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-30 19:43:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:28,290 INFO L225 Difference]: With dead ends: 5508 [2018-12-30 19:43:28,290 INFO L226 Difference]: Without dead ends: 2886 [2018-12-30 19:43:28,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2018-12-30 19:43:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2493. [2018-12-30 19:43:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2018-12-30 19:43:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2683 transitions. [2018-12-30 19:43:28,342 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2683 transitions. Word has length 185 [2018-12-30 19:43:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:28,343 INFO L480 AbstractCegarLoop]: Abstraction has 2493 states and 2683 transitions. [2018-12-30 19:43:28,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2683 transitions. [2018-12-30 19:43:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-30 19:43:28,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:28,353 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:28,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1645730410, now seen corresponding path program 1 times [2018-12-30 19:43:28,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:28,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:28,807 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:43:29,014 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:43:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-30 19:43:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:29,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 19:43:29,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:43:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:43:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:43:29,089 INFO L87 Difference]: Start difference. First operand 2493 states and 2683 transitions. Second operand 6 states. [2018-12-30 19:43:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:30,138 INFO L93 Difference]: Finished difference Result 5162 states and 5545 transitions. [2018-12-30 19:43:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:30,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2018-12-30 19:43:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:30,146 INFO L225 Difference]: With dead ends: 5162 [2018-12-30 19:43:30,146 INFO L226 Difference]: Without dead ends: 2671 [2018-12-30 19:43:30,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:43:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2018-12-30 19:43:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2362. [2018-12-30 19:43:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2018-12-30 19:43:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2529 transitions. [2018-12-30 19:43:30,194 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2529 transitions. Word has length 276 [2018-12-30 19:43:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:30,195 INFO L480 AbstractCegarLoop]: Abstraction has 2362 states and 2529 transitions. [2018-12-30 19:43:30,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:43:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2529 transitions. [2018-12-30 19:43:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-30 19:43:30,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:30,204 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:30,204 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -731842585, now seen corresponding path program 1 times [2018-12-30 19:43:30,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:30,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:30,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:43:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:30,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:30,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:43:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:43:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:30,384 INFO L87 Difference]: Start difference. First operand 2362 states and 2529 transitions. Second operand 3 states. [2018-12-30 19:43:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:30,973 INFO L93 Difference]: Finished difference Result 4982 states and 5344 transitions. [2018-12-30 19:43:30,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:30,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-12-30 19:43:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:30,974 INFO L225 Difference]: With dead ends: 4982 [2018-12-30 19:43:30,975 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:43:30,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:43:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:43:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:43:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:43:30,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2018-12-30 19:43:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:30,979 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:43:30,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:43:30,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:43:30,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:43:31,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:43:31,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:43:31,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:43:31,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:43:31,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:43:32,523 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2018-12-30 19:43:32,958 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2018-12-30 19:43:32,962 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:43:32,962 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:43:32,962 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,962 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,962 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,962 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:43:32,963 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:43:32,964 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:43:32,965 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:43:32,966 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:43:32,967 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:43:32,967 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:43:32,967 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:43:32,967 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a17~0 1))) (let ((.cse2 (not .cse3)) (.cse5 (= ~a16~0 6)) (.cse4 (= ~a8~0 15)) (.cse1 (= ~a16~0 4)) (.cse6 (<= ~a17~0 0)) (.cse0 (not (= ~a20~0 1))) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= ~a21~0 1)) (and .cse0 .cse4 .cse5) (and (and .cse4 .cse2) .cse5) (and .cse4 .cse6 .cse7) (= ~a7~0 1) (and .cse1 .cse6) (and .cse0 .cse7)))) [2018-12-30 19:43:32,967 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,967 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:43:32,968 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,969 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,970 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:43:32,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,972 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a17~0 1))) (let ((.cse2 (not .cse3)) (.cse5 (= ~a16~0 6)) (.cse4 (= ~a8~0 15)) (.cse1 (= ~a16~0 4)) (.cse6 (<= ~a17~0 0)) (.cse0 (not (= ~a20~0 1))) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= ~a21~0 1)) (and .cse0 .cse4 .cse5) (and (and .cse4 .cse2) .cse5) (and .cse4 .cse6 .cse7) (= ~a7~0 1) (and .cse1 .cse6) (and .cse0 .cse7)))) [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:43:32,973 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:43:32,974 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,975 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:43:32,976 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,977 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:43:32,978 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,979 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:43:32,980 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:43:33,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:43:33 BoogieIcfgContainer [2018-12-30 19:43:33,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:43:33,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:43:33,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:43:33,003 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:43:33,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:43:11" (3/4) ... [2018-12-30 19:43:33,007 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:43:33,032 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:43:33,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:43:33,213 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:43:33,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:43:33,214 INFO L168 Benchmark]: Toolchain (without parser) took 26095.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.0 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -367.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:43:33,214 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:43:33,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.26 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:33,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -218.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:33,217 INFO L168 Benchmark]: Boogie Preprocessor took 78.46 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:33,218 INFO L168 Benchmark]: RCFGBuilder took 3434.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.2 MB). Peak memory consumption was 108.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:33,218 INFO L168 Benchmark]: TraceAbstraction took 21445.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -318.2 MB). Peak memory consumption was 412.6 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:33,218 INFO L168 Benchmark]: Witness Printer took 210.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:33,222 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 718.26 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 203.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -218.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.46 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3434.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.2 MB). Peak memory consumption was 108.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21445.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -318.2 MB). Peak memory consumption was 412.6 MB. Max. memory is 11.5 GB. * Witness Printer took 210.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && a16 == 4) && !(a17 == 1)) || (a17 == 1 && a21 == 1)) || ((!(a20 == 1) && a8 == 15) && a16 == 6)) || ((a8 == 15 && !(a17 == 1)) && a16 == 6)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || a7 == 1) || (a16 == 4 && a17 <= 0)) || (!(a20 == 1) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && a16 == 4) && !(a17 == 1)) || (a17 == 1 && a21 == 1)) || ((!(a20 == 1) && a8 == 15) && a16 == 6)) || ((a8 == 15 && !(a17 == 1)) && a16 == 6)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || a7 == 1) || (a16 == 4 && a17 <= 0)) || (!(a20 == 1) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 21.3s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1027 SDtfs, 2372 SDslu, 126 SDs, 0 SdLazy, 5885 SolverSat, 828 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1757 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 143 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5035 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 264 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 601234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1139/1139 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...