./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label04_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label04_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 3774d82389353be2170e26cc4e53c0d06e3cb94d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:49:56,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:49:56,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:49:56,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:49:56,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:49:56,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:49:56,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:49:56,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:49:56,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:49:56,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:49:56,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:49:56,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:49:56,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:49:56,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:49:56,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:49:56,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:49:56,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:49:56,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:49:56,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:49:56,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:49:56,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:49:56,209 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:49:56,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:49:56,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:49:56,214 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:49:56,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:49:56,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:49:56,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:49:56,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:49:56,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:49:56,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:49:56,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:49:56,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:49:56,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:49:56,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:49:56,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:49:56,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:49:56,258 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:49:56,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:49:56,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:49:56,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:49:56,261 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:49:56,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:49:56,262 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:49:56,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:49:56,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:49:56,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:49:56,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:49:56,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:49:56,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:49:56,264 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:49:56,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:49:56,264 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:49:56,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:49:56,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:49:56,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:49:56,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:49:56,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:49:56,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:49:56,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:49:56,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:49:56,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:49:56,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:49:56,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:49:56,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:49:56,268 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 -> 3774d82389353be2170e26cc4e53c0d06e3cb94d [2019-01-12 00:49:56,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:49:56,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:49:56,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:49:56,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:49:56,341 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:49:56,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label04_true-unreach-call_false-termination.c [2019-01-12 00:49:56,402 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fb57cb0/6e3a70a2fe0543eea3744139695707fd/FLAGb80264cca [2019-01-12 00:49:56,989 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:49:56,990 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label04_true-unreach-call_false-termination.c [2019-01-12 00:49:57,006 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fb57cb0/6e3a70a2fe0543eea3744139695707fd/FLAGb80264cca [2019-01-12 00:49:57,231 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fb57cb0/6e3a70a2fe0543eea3744139695707fd [2019-01-12 00:49:57,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:49:57,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:49:57,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:49:57,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:49:57,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:49:57,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:57,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b967a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57, skipping insertion in model container [2019-01-12 00:49:57,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:57,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:49:57,337 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:49:57,808 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:49:57,813 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:49:57,939 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:49:57,968 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:49:57,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57 WrapperNode [2019-01-12 00:49:57,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:49:57,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:49:57,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:49:57,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:49:57,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:49:58,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:49:58,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:49:58,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:49:58,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... [2019-01-12 00:49:58,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:49:58,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:49:58,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:49:58,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:49:58,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:49:58,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:49:58,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:50:01,268 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:50:01,268 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:50:01,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:50:01 BoogieIcfgContainer [2019-01-12 00:50:01,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:50:01,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:50:01,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:50:01,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:50:01,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:49:57" (1/3) ... [2019-01-12 00:50:01,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e04580e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:50:01, skipping insertion in model container [2019-01-12 00:50:01,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:57" (2/3) ... [2019-01-12 00:50:01,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e04580e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:50:01, skipping insertion in model container [2019-01-12 00:50:01,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:50:01" (3/3) ... [2019-01-12 00:50:01,277 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label04_true-unreach-call_false-termination.c [2019-01-12 00:50:01,287 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:50:01,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:50:01,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:50:01,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:50:01,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:50:01,343 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:50:01,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:50:01,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:50:01,344 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:50:01,344 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:50:01,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:50:01,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:50:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:50:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 00:50:01,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:01,374 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] [2019-01-12 00:50:01,376 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 857742575, now seen corresponding path program 1 times [2019-01-12 00:50:01,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:01,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:01,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:01,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:50:01,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:01,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:50:01,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:50:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:50:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:01,985 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:50:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:04,673 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:50:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:50:04,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-12 00:50:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:04,692 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:50:04,692 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:50:04,697 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 [2019-01-12 00:50:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:50:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-01-12 00:50:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 00:50:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-01-12 00:50:04,772 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 96 [2019-01-12 00:50:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:04,773 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-01-12 00:50:04,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:50:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-01-12 00:50:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 00:50:04,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:04,779 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] [2019-01-12 00:50:04,779 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2104593095, now seen corresponding path program 1 times [2019-01-12 00:50:04,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:04,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:04,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:50:04,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:50:04,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:50:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:50:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:04,885 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-01-12 00:50:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:06,007 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-01-12 00:50:06,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:06,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 00:50:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:06,012 INFO L225 Difference]: With dead ends: 1185 [2019-01-12 00:50:06,013 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:50:06,015 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 [2019-01-12 00:50:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:50:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:50:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:50:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-01-12 00:50:06,067 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 101 [2019-01-12 00:50:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-01-12 00:50:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:50:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-01-12 00:50:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 00:50:06,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:06,076 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:50:06,076 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:06,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2133421455, now seen corresponding path program 1 times [2019-01-12 00:50:06,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:06,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:06,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:50:06,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:06,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:06,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:06,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:06,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:06,189 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-01-12 00:50:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:07,296 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-01-12 00:50:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:07,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-01-12 00:50:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:07,302 INFO L225 Difference]: With dead ends: 1971 [2019-01-12 00:50:07,302 INFO L226 Difference]: Without dead ends: 1183 [2019-01-12 00:50:07,304 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 [2019-01-12 00:50:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-01-12 00:50:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-01-12 00:50:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-01-12 00:50:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-01-12 00:50:07,344 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 122 [2019-01-12 00:50:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:07,349 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-01-12 00:50:07,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-01-12 00:50:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-12 00:50:07,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:07,355 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:50:07,356 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1539851884, now seen corresponding path program 1 times [2019-01-12 00:50:07,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:07,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:07,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-12 00:50:07,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:07,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:07,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:07,579 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-01-12 00:50:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:09,292 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-01-12 00:50:09,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:09,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-12 00:50:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:09,299 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:50:09,300 INFO L226 Difference]: Without dead ends: 1314 [2019-01-12 00:50:09,302 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 [2019-01-12 00:50:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-01-12 00:50:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-01-12 00:50:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-01-12 00:50:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-01-12 00:50:09,333 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 158 [2019-01-12 00:50:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:09,334 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-01-12 00:50:09,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-01-12 00:50:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 00:50:09,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:09,338 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 00:50:09,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2022693764, now seen corresponding path program 1 times [2019-01-12 00:50:09,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:09,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:09,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:09,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-01-12 00:50:09,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:09,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:09,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:09,486 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-01-12 00:50:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:10,033 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-01-12 00:50:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:10,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-01-12 00:50:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:10,042 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:50:10,042 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:50:10,044 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 [2019-01-12 00:50:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:50:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-01-12 00:50:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:50:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2019-01-12 00:50:10,081 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 177 [2019-01-12 00:50:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:10,081 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2019-01-12 00:50:10,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2019-01-12 00:50:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-12 00:50:10,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:10,086 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:50:10,087 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -442422933, now seen corresponding path program 1 times [2019-01-12 00:50:10,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:10,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:50:10,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:10,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:10,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:10,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:10,262 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2019-01-12 00:50:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:11,065 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2019-01-12 00:50:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:11,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-01-12 00:50:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:11,074 INFO L225 Difference]: With dead ends: 3412 [2019-01-12 00:50:11,074 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:50:11,077 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 [2019-01-12 00:50:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:50:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-01-12 00:50:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:50:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2019-01-12 00:50:11,111 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 180 [2019-01-12 00:50:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:11,111 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2019-01-12 00:50:11,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2019-01-12 00:50:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-12 00:50:11,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:11,116 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:50:11,117 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:11,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash 570545059, now seen corresponding path program 1 times [2019-01-12 00:50:11,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:11,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:50:11,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 00:50:11,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:50:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:50:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:50:11,389 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2019-01-12 00:50:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:12,645 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2019-01-12 00:50:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 00:50:12,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-01-12 00:50:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:12,653 INFO L225 Difference]: With dead ends: 3841 [2019-01-12 00:50:12,653 INFO L226 Difference]: Without dead ends: 2005 [2019-01-12 00:50:12,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:50:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-01-12 00:50:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2019-01-12 00:50:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:50:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2019-01-12 00:50:12,691 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 184 [2019-01-12 00:50:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:12,692 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2019-01-12 00:50:12,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:50:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2019-01-12 00:50:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-12 00:50:12,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:12,697 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 00:50:12,697 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 540380915, now seen corresponding path program 1 times [2019-01-12 00:50:12,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:12,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:12,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-12 00:50:12,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:12,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:50:12,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:50:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:50:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:12,928 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2019-01-12 00:50:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:14,050 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2019-01-12 00:50:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:50:14,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-01-12 00:50:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:14,061 INFO L225 Difference]: With dead ends: 3936 [2019-01-12 00:50:14,062 INFO L226 Difference]: Without dead ends: 2100 [2019-01-12 00:50:14,065 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 [2019-01-12 00:50:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-01-12 00:50:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-01-12 00:50:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-01-12 00:50:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2019-01-12 00:50:14,100 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 217 [2019-01-12 00:50:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:14,100 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2019-01-12 00:50:14,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:50:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2019-01-12 00:50:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-01-12 00:50:14,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:14,108 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:50:14,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1041196455, now seen corresponding path program 1 times [2019-01-12 00:50:14,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:14,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:14,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:14,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:14,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-12 00:50:14,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:14,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:50:14,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:50:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:50:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:14,412 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2019-01-12 00:50:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:17,075 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2019-01-12 00:50:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:50:17,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-01-12 00:50:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:17,090 INFO L225 Difference]: With dead ends: 4460 [2019-01-12 00:50:17,090 INFO L226 Difference]: Without dead ends: 2493 [2019-01-12 00:50:17,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-01-12 00:50:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-01-12 00:50:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-01-12 00:50:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-01-12 00:50:17,152 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 243 [2019-01-12 00:50:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:17,153 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-01-12 00:50:17,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:50:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-01-12 00:50:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-12 00:50:17,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:17,162 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:50:17,163 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:17,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1832313326, now seen corresponding path program 1 times [2019-01-12 00:50:17,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:17,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:17,527 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 00:50:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-12 00:50:17,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:17,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 00:50:17,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 00:50:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 00:50:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:50:17,601 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-01-12 00:50:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:18,844 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-01-12 00:50:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:50:18,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-01-12 00:50:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:18,852 INFO L225 Difference]: With dead ends: 4105 [2019-01-12 00:50:18,852 INFO L226 Difference]: Without dead ends: 2138 [2019-01-12 00:50:18,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:50:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-01-12 00:50:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-01-12 00:50:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:50:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-01-12 00:50:18,889 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 264 [2019-01-12 00:50:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:18,890 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-01-12 00:50:18,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 00:50:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-01-12 00:50:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-12 00:50:18,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:18,898 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 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] [2019-01-12 00:50:18,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1089791849, now seen corresponding path program 1 times [2019-01-12 00:50:18,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:19,434 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-12 00:50:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-12 00:50:20,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:50:20,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:50:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:20,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:50:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-01-12 00:50:20,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:50:20,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-01-12 00:50:20,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 00:50:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 00:50:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:50:20,522 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 14 states. [2019-01-12 00:50:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:23,597 INFO L93 Difference]: Finished difference Result 3589 states and 4108 transitions. [2019-01-12 00:50:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 00:50:23,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 286 [2019-01-12 00:50:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:23,599 INFO L225 Difference]: With dead ends: 3589 [2019-01-12 00:50:23,599 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:50:23,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2019-01-12 00:50:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:50:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:50:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:50:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:50:23,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 286 [2019-01-12 00:50:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:23,604 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:50:23,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 00:50:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:50:23,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:50:23,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:50:23,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,769 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 102 [2019-01-12 00:50:23,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:23,939 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 102 [2019-01-12 00:50:25,095 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2019-01-12 00:50:25,526 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2019-01-12 00:50:25,530 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:50:25,530 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:50:25,530 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:50:25,531 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,532 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:50:25,533 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:50:25,535 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:50:25,536 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:50:25,537 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:50:25,537 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:50:25,537 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:50:25,537 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:50:25,537 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:50:25,537 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse4 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse1 (= ~a17~0 1)) (.cse6 (<= ~a21~0 0)) (.cse8 (= ~a8~0 13)) (.cse9 (<= ~a17~0 0)) (.cse3 (= ~a20~0 1)) (.cse10 (not .cse5)) (.cse0 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 (and .cse1 .cse2 .cse3)) (and (and .cse4 .cse2 (not .cse1)) .cse0) (and .cse5 .cse6 .cse7 .cse8 .cse1 .cse0) (and (and .cse2 (= ~a16~0 5)) .cse0) (and .cse5 .cse6 .cse4 .cse8 .cse0 .cse9) (and .cse0 (and .cse10 .cse7 .cse1 .cse2)) (and .cse5 .cse6 .cse8 .cse0 .cse9 .cse3 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse10 (= ~a8~0 15) .cse0 .cse2 .cse11)))) [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:50:25,538 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:50:25,539 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:50:25,539 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,542 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:50:25,543 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,544 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,546 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:50:25,547 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse0 (= ~a16~0 4)) (.cse6 (not .cse11)) (.cse5 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse8 (<= ~a17~0 0)) (.cse2 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse9 (not .cse4)) (.cse3 (= ~a12~0 8)) (.cse1 (= ~a21~0 1))) (or (and (and .cse0 .cse1 (not .cse2)) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (and .cse1 (= ~a16~0 5)) .cse3) (and .cse4 .cse5 .cse0 .cse7 .cse3 .cse8) (and .cse3 (and .cse9 .cse6 .cse2 .cse1)) (and .cse4 .cse5 .cse7 .cse3 .cse8 .cse10 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse3 (and .cse2 .cse1 .cse10)) (and .cse9 (= ~a8~0 15) .cse3 .cse1 .cse11)))) [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,548 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,549 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:50:25,550 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:50:25,551 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,552 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:50:25,553 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:50:25,554 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:50:25,555 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:50:25,556 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:50:25,557 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:50:25,557 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:50:25,557 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:50:25,557 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:50:25,557 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:50:25,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:50:25 BoogieIcfgContainer [2019-01-12 00:50:25,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:50:25,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:50:25,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:50:25,589 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:50:25,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:50:01" (3/4) ... [2019-01-12 00:50:25,595 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:50:25,617 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:50:25,618 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:50:25,814 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:50:25,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:50:25,816 INFO L168 Benchmark]: Toolchain (without parser) took 28580.11 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.5 MB). Free memory was 952.7 MB in the beginning and 1.4 GB in the end (delta: -409.4 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:25,816 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. [2019-01-12 00:50:25,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.06 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. [2019-01-12 00:50:25,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 211.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -215.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:25,817 INFO L168 Benchmark]: Boogie Preprocessor took 94.85 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:25,817 INFO L168 Benchmark]: RCFGBuilder took 2992.24 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: 105.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:25,819 INFO L168 Benchmark]: TraceAbstraction took 24317.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -365.6 MB). Peak memory consumption was 453.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:25,819 INFO L168 Benchmark]: Witness Printer took 225.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:25,821 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 733.06 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 211.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -215.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.85 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2992.24 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: 105.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24317.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -365.6 MB). Peak memory consumption was 453.8 MB. Max. memory is 11.5 GB. * Witness Printer took 225.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 464]: 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: (((((((a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || ((a21 == 1 && a16 == 5) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (a12 == 8 && ((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a16 == 4 && a21 == 1) && !(a17 == 1)) && a12 == 8) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || ((a21 == 1 && a16 == 5) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (a12 == 8 && ((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || (a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 24.2s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 2502 SDslu, 144 SDs, 0 SdLazy, 6862 SolverSat, 935 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 299 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred 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, 1908 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 309 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8374 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2078 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2314 NumberOfCodeBlocks, 2314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664083 SizeOfPredicates, 1 NumberOfNonLiveVariables, 517 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...