./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label03_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_label03_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 a91f469417fecfcde25fa5a52b02f071d3462166 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:32,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:49:32,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:49:32,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:49:32,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:49:32,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:49:32,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:49:32,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:49:32,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:49:32,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:49:32,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:49:32,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:49:32,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:49:32,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:49:32,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:49:32,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:49:32,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:49:32,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:49:32,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:49:32,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:49:32,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:49:32,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:49:32,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:49:32,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:49:32,069 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:49:32,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:49:32,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:49:32,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:49:32,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:49:32,075 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:49:32,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:49:32,076 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:49:32,076 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:49:32,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:49:32,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:49:32,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:49:32,079 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:32,095 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:49:32,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:49:32,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:49:32,097 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:49:32,097 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:49:32,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:49:32,098 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:49:32,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:49:32,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:49:32,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:49:32,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:49:32,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:49:32,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:49:32,099 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:49:32,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:49:32,100 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:49:32,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:49:32,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:49:32,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:49:32,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:49:32,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:49:32,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:49:32,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:49:32,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:49:32,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:49:32,102 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:49:32,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:49:32,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:49:32,103 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 -> a91f469417fecfcde25fa5a52b02f071d3462166 [2019-01-12 00:49:32,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:49:32,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:49:32,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:49:32,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:49:32,166 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:49:32,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label03_true-unreach-call_false-termination.c [2019-01-12 00:49:32,240 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e405a1a/b18a5057fba84ff4b03467dd826ee773/FLAG4ce9d757a [2019-01-12 00:49:32,775 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:49:32,776 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label03_true-unreach-call_false-termination.c [2019-01-12 00:49:32,789 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e405a1a/b18a5057fba84ff4b03467dd826ee773/FLAG4ce9d757a [2019-01-12 00:49:33,015 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e405a1a/b18a5057fba84ff4b03467dd826ee773 [2019-01-12 00:49:33,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:49:33,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:49:33,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:49:33,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:49:33,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:49:33,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:49:33" (1/1) ... [2019-01-12 00:49:33,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:33, skipping insertion in model container [2019-01-12 00:49:33,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:49:33" (1/1) ... [2019-01-12 00:49:33,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:49:33,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:49:33,541 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:49:33,547 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:49:33,679 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:49:33,708 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:49:33,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:33 WrapperNode [2019-01-12 00:49:33,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:49:33,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:49:33,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:49:33,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:49:33,721 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:33" (1/1) ... [2019-01-12 00:49:33,741 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:33" (1/1) ... [2019-01-12 00:49:33,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:49:33,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:49:33,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:49:33,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:49:33,923 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:33" (1/1) ... [2019-01-12 00:49:33,923 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:33" (1/1) ... [2019-01-12 00:49:33,939 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:33" (1/1) ... [2019-01-12 00:49:33,939 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:33" (1/1) ... [2019-01-12 00:49:33,990 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:33" (1/1) ... [2019-01-12 00:49:34,003 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:33" (1/1) ... [2019-01-12 00:49:34,007 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:33" (1/1) ... [2019-01-12 00:49:34,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:49:34,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:49:34,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:49:34,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:49:34,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:33" (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:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:49:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:49:37,645 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:49:37,645 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:49:37,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:49:37 BoogieIcfgContainer [2019-01-12 00:49:37,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:49:37,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:49:37,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:49:37,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:49:37,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:49:33" (1/3) ... [2019-01-12 00:49:37,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:49:37, skipping insertion in model container [2019-01-12 00:49:37,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:33" (2/3) ... [2019-01-12 00:49:37,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:49:37, skipping insertion in model container [2019-01-12 00:49:37,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:49:37" (3/3) ... [2019-01-12 00:49:37,654 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label03_true-unreach-call_false-termination.c [2019-01-12 00:49:37,664 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:49:37,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:49:37,694 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:49:37,736 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:49:37,737 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:49:37,738 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:49:37,738 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:49:37,738 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:49:37,739 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:49:37,739 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:49:37,739 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:49:37,739 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:49:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:49:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 00:49:37,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:37,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:37,779 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1437018794, now seen corresponding path program 1 times [2019-01-12 00:49:37,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:37,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:37,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:37,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:37,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:38,465 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:49:39,049 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-01-12 00:49:39,500 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-12 00:49:39,709 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-01-12 00:49:40,146 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:49:40,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 00:49:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 00:49:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 00:49:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:49:40,168 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-01-12 00:49:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:42,529 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-01-12 00:49:42,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:49:42,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-01-12 00:49:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:42,546 INFO L225 Difference]: With dead ends: 493 [2019-01-12 00:49:42,547 INFO L226 Difference]: Without dead ends: 193 [2019-01-12 00:49:42,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-01-12 00:49:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-12 00:49:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-12 00:49:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-12 00:49:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-01-12 00:49:42,604 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 129 [2019-01-12 00:49:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:42,605 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-01-12 00:49:42,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 00:49:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-01-12 00:49:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-12 00:49:42,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:42,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,609 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash 72009246, now seen corresponding path program 1 times [2019-01-12 00:49:42,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:49:42,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:42,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:49:42,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:42,767 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-01-12 00:49:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:43,533 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-01-12 00:49:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:43,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-01-12 00:49:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:43,539 INFO L225 Difference]: With dead ends: 457 [2019-01-12 00:49:43,540 INFO L226 Difference]: Without dead ends: 324 [2019-01-12 00:49:43,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-12 00:49:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-01-12 00:49:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-01-12 00:49:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-01-12 00:49:43,568 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 133 [2019-01-12 00:49:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:43,568 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-01-12 00:49:43,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-01-12 00:49:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 00:49:43,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:43,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:43,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash -620681437, now seen corresponding path program 1 times [2019-01-12 00:49:43,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:43,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:43,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:43,809 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 00:49:44,029 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 00:49:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:49:44,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:44,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:49:44,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:44,141 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-01-12 00:49:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:45,401 INFO L93 Difference]: Finished difference Result 814 states and 1161 transitions. [2019-01-12 00:49:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:45,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-01-12 00:49:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:45,405 INFO L225 Difference]: With dead ends: 814 [2019-01-12 00:49:45,406 INFO L226 Difference]: Without dead ends: 455 [2019-01-12 00:49:45,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-01-12 00:49:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-01-12 00:49:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-12 00:49:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 534 transitions. [2019-01-12 00:49:45,432 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 534 transitions. Word has length 136 [2019-01-12 00:49:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:45,433 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 534 transitions. [2019-01-12 00:49:45,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 534 transitions. [2019-01-12 00:49:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-12 00:49:45,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:45,438 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,438 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -647170395, now seen corresponding path program 1 times [2019-01-12 00:49:45,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:45,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:45,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:49:45,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:45,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:49:45,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:45,575 INFO L87 Difference]: Start difference. First operand 455 states and 534 transitions. Second operand 3 states. [2019-01-12 00:49:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:46,552 INFO L93 Difference]: Finished difference Result 981 states and 1165 transitions. [2019-01-12 00:49:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:46,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-01-12 00:49:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:46,558 INFO L225 Difference]: With dead ends: 981 [2019-01-12 00:49:46,559 INFO L226 Difference]: Without dead ends: 586 [2019-01-12 00:49:46,560 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:49:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-01-12 00:49:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-01-12 00:49:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-01-12 00:49:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 677 transitions. [2019-01-12 00:49:46,578 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 677 transitions. Word has length 144 [2019-01-12 00:49:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:46,579 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 677 transitions. [2019-01-12 00:49:46,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 677 transitions. [2019-01-12 00:49:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 00:49:46,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:46,582 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash -236489853, now seen corresponding path program 1 times [2019-01-12 00:49:46,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:46,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:46,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 00:49:46,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:46,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:49:46,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:46,731 INFO L87 Difference]: Start difference. First operand 586 states and 677 transitions. Second operand 4 states. [2019-01-12 00:49:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:48,838 INFO L93 Difference]: Finished difference Result 2029 states and 2386 transitions. [2019-01-12 00:49:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:48,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-01-12 00:49:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:48,846 INFO L225 Difference]: With dead ends: 2029 [2019-01-12 00:49:48,846 INFO L226 Difference]: Without dead ends: 1503 [2019-01-12 00:49:48,848 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:49:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-01-12 00:49:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1241. [2019-01-12 00:49:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-01-12 00:49:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1461 transitions. [2019-01-12 00:49:48,879 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1461 transitions. Word has length 153 [2019-01-12 00:49:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:48,879 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 1461 transitions. [2019-01-12 00:49:48,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1461 transitions. [2019-01-12 00:49:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 00:49:48,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:48,884 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1280194508, now seen corresponding path program 1 times [2019-01-12 00:49:48,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:48,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:48,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 00:49:49,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:49,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:49:49,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:49:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:49:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:49:49,133 INFO L87 Difference]: Start difference. First operand 1241 states and 1461 transitions. Second operand 5 states. [2019-01-12 00:49:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:50,558 INFO L93 Difference]: Finished difference Result 2946 states and 3473 transitions. [2019-01-12 00:49:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:49:50,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-01-12 00:49:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:50,568 INFO L225 Difference]: With dead ends: 2946 [2019-01-12 00:49:50,569 INFO L226 Difference]: Without dead ends: 1765 [2019-01-12 00:49:50,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:49:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-01-12 00:49:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-01-12 00:49:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-01-12 00:49:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1905 transitions. [2019-01-12 00:49:50,604 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1905 transitions. Word has length 159 [2019-01-12 00:49:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:50,605 INFO L480 AbstractCegarLoop]: Abstraction has 1634 states and 1905 transitions. [2019-01-12 00:49:50,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:49:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1905 transitions. [2019-01-12 00:49:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 00:49:50,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:50,610 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,610 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash -73226021, now seen corresponding path program 1 times [2019-01-12 00:49:50,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:50,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:50,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 00:49:50,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:50,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:49:50,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:50,745 INFO L87 Difference]: Start difference. First operand 1634 states and 1905 transitions. Second operand 3 states. [2019-01-12 00:49:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:51,476 INFO L93 Difference]: Finished difference Result 3732 states and 4372 transitions. [2019-01-12 00:49:51,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:51,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-01-12 00:49:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:51,491 INFO L225 Difference]: With dead ends: 3732 [2019-01-12 00:49:51,491 INFO L226 Difference]: Without dead ends: 2158 [2019-01-12 00:49:51,494 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:49:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-01-12 00:49:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2027. [2019-01-12 00:49:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-01-12 00:49:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2321 transitions. [2019-01-12 00:49:51,532 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2321 transitions. Word has length 193 [2019-01-12 00:49:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:51,532 INFO L480 AbstractCegarLoop]: Abstraction has 2027 states and 2321 transitions. [2019-01-12 00:49:51,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2321 transitions. [2019-01-12 00:49:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-01-12 00:49:51,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:51,539 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,540 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1876676455, now seen corresponding path program 1 times [2019-01-12 00:49:51,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:51,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:51,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:51,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:51,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:51,844 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 00:49:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 00:49:51,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:49:51,901 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:49:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:52,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:49:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-12 00:49:52,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:49:52,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 00:49:52,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:49:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:49:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:49:52,278 INFO L87 Difference]: Start difference. First operand 2027 states and 2321 transitions. Second operand 7 states. [2019-01-12 00:49:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:56,725 INFO L93 Difference]: Finished difference Result 5185 states and 5952 transitions. [2019-01-12 00:49:56,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 00:49:56,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-01-12 00:49:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:56,738 INFO L225 Difference]: With dead ends: 5185 [2019-01-12 00:49:56,738 INFO L226 Difference]: Without dead ends: 3087 [2019-01-12 00:49:56,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:49:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2019-01-12 00:49:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2682. [2019-01-12 00:49:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-12 00:49:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2984 transitions. [2019-01-12 00:49:56,798 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2984 transitions. Word has length 222 [2019-01-12 00:49:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:56,798 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 2984 transitions. [2019-01-12 00:49:56,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:49:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2984 transitions. [2019-01-12 00:49:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-12 00:49:56,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:56,806 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:49:56,806 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash -684823816, now seen corresponding path program 1 times [2019-01-12 00:49:56,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-12 00:49:57,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:57,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:49:57,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:57,040 INFO L87 Difference]: Start difference. First operand 2682 states and 2984 transitions. Second operand 4 states. [2019-01-12 00:49:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:57,997 INFO L93 Difference]: Finished difference Result 5304 states and 5906 transitions. [2019-01-12 00:49:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:57,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-01-12 00:49:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:58,006 INFO L225 Difference]: With dead ends: 5304 [2019-01-12 00:49:58,006 INFO L226 Difference]: Without dead ends: 2682 [2019-01-12 00:49:58,010 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:49:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-01-12 00:49:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2551. [2019-01-12 00:49:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2019-01-12 00:49:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 2793 transitions. [2019-01-12 00:49:58,057 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 2793 transitions. Word has length 252 [2019-01-12 00:49:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:58,057 INFO L480 AbstractCegarLoop]: Abstraction has 2551 states and 2793 transitions. [2019-01-12 00:49:58,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 2793 transitions. [2019-01-12 00:49:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-01-12 00:49:58,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:58,066 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:49:58,066 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash -160153905, now seen corresponding path program 1 times [2019-01-12 00:49:58,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-01-12 00:49:58,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:58,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:49:58,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:49:58,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:49:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:49:58,568 INFO L87 Difference]: Start difference. First operand 2551 states and 2793 transitions. Second operand 5 states. [2019-01-12 00:49:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:59,255 INFO L93 Difference]: Finished difference Result 4990 states and 5471 transitions. [2019-01-12 00:49:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:59,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2019-01-12 00:49:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:59,263 INFO L225 Difference]: With dead ends: 4990 [2019-01-12 00:49:59,263 INFO L226 Difference]: Without dead ends: 2420 [2019-01-12 00:49:59,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:49:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-01-12 00:49:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2420. [2019-01-12 00:49:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-12 00:49:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2648 transitions. [2019-01-12 00:49:59,307 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2648 transitions. Word has length 274 [2019-01-12 00:49:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:59,308 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 2648 transitions. [2019-01-12 00:49:59,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:49:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2648 transitions. [2019-01-12 00:49:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-12 00:49:59,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:59,317 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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:49:59,318 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1411032617, now seen corresponding path program 1 times [2019-01-12 00:49:59,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:59,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:59,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:59,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:59,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-12 00:50:00,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:50:00,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:50:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:00,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:50:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-01-12 00:50:00,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:50:00,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-01-12 00:50:00,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 00:50:00,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 00:50:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:50:00,422 INFO L87 Difference]: Start difference. First operand 2420 states and 2648 transitions. Second operand 14 states. [2019-01-12 00:50:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:02,704 INFO L93 Difference]: Finished difference Result 4184 states and 4588 transitions. [2019-01-12 00:50:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:50:02,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 280 [2019-01-12 00:50:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:02,706 INFO L225 Difference]: With dead ends: 4184 [2019-01-12 00:50:02,707 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:50:02,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2019-01-12 00:50:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:50:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:50:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:50:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:50:02,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2019-01-12 00:50:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:02,711 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:50:02,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 00:50:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:50:02,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:50:02,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:50:03,307 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-12 00:50:03,668 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-12 00:50:03,671 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:50:03,671 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:50:03,672 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,672 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,672 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,672 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,672 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,672 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:50:03,673 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:50:03,674 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:50:03,675 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:50:03,675 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:50:03,679 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:50:03,679 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:50:03,680 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:50:03,680 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:50:03,680 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:50:03,680 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:50:03,680 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:50:03,681 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:50:03,682 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:50:03,682 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:50:03,682 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:50:03,682 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:50:03,682 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a7~0 1))) (let ((.cse6 (= ~a16~0 6)) (.cse5 (not .cse8)) (.cse1 (<= ~a17~0 0)) (.cse9 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse10 (= ~a8~0 13)) (.cse12 (= ~a17~0 1)) (.cse3 (= ~a20~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (= ~a21~0 1)) (.cse7 (<= ~a20~0 0)) (.cse4 (= ~a16~0 5))) (or (and (= ~a8~0 14) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse0 .cse3 .cse6) (and .cse11 .cse0 .cse2 .cse7) (and .cse5 .cse11 .cse0 .cse3 .cse2) (and .cse9 (not (= 6 ~a16~0)) .cse12 .cse0 .cse7) (and (or (and .cse5 .cse3 .cse2 .cse6) (and .cse5 .cse2 .cse3 .cse4)) .cse0) (and .cse11 .cse0 .cse12 .cse2 .cse5) (and .cse8 .cse9 .cse11 .cse10 .cse0 .cse1 .cse3 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse8 .cse9 .cse10 .cse0 .cse12 .cse3) (and .cse11 .cse10 .cse12 .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse7 .cse4)))) [2019-01-12 00:50:03,682 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,683 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,688 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,688 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,688 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,688 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:50:03,688 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:50:03,688 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:50:03,689 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:50:03,690 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,690 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:50:03,694 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:50:03,695 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:50:03,696 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:50:03,697 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:50:03,699 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:50:03,699 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,699 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a7~0 1))) (let ((.cse6 (= ~a16~0 6)) (.cse5 (not .cse8)) (.cse1 (<= ~a17~0 0)) (.cse9 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse10 (= ~a8~0 13)) (.cse12 (= ~a17~0 1)) (.cse3 (= ~a20~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (= ~a21~0 1)) (.cse7 (<= ~a20~0 0)) (.cse4 (= ~a16~0 5))) (or (and (= ~a8~0 14) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse0 .cse3 .cse6) (and .cse11 .cse0 .cse2 .cse7) (and .cse5 .cse11 .cse0 .cse3 .cse2) (and .cse9 (not (= 6 ~a16~0)) .cse12 .cse0 .cse7) (and (or (and .cse5 .cse3 .cse2 .cse6) (and .cse5 .cse2 .cse3 .cse4)) .cse0) (and .cse11 .cse0 .cse12 .cse2 .cse5) (and .cse8 .cse9 .cse11 .cse10 .cse0 .cse1 .cse3 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse8 .cse9 .cse10 .cse0 .cse12 .cse3) (and .cse11 .cse10 .cse12 .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse7 .cse4)))) [2019-01-12 00:50:03,699 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,699 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:50:03,700 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:50:03,701 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:50:03,701 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:50:03,704 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,705 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:50:03,706 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:50:03,707 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:50:03,708 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:50:03,709 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:50:03,710 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:50:03,710 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:50:03,710 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:50:03,710 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:50:03,710 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:50:03,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:50:03 BoogieIcfgContainer [2019-01-12 00:50:03,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:50:03,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:50:03,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:50:03,759 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:50:03,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:49:37" (3/4) ... [2019-01-12 00:50:03,769 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:50:03,806 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:50:03,807 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:50:04,067 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:50:04,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:50:04,069 INFO L168 Benchmark]: Toolchain (without parser) took 31049.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.3 MB). Free memory was 952.7 MB in the beginning and 892.0 MB in the end (delta: 60.7 MB). Peak memory consumption was 543.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,070 INFO L168 Benchmark]: CDTParser took 0.22 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:04,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.81 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -219.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,071 INFO L168 Benchmark]: Boogie Preprocessor took 110.61 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,071 INFO L168 Benchmark]: RCFGBuilder took 3631.96 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,072 INFO L168 Benchmark]: TraceAbstraction took 26111.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 334.5 MB). Free memory was 1.0 GB in the beginning and 905.1 MB in the end (delta: 116.4 MB). Peak memory consumption was 450.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,072 INFO L168 Benchmark]: Witness Printer took 308.13 ms. Allocated memory is still 1.5 GB. Free memory was 905.1 MB in the beginning and 892.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:04,078 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.22 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 687.81 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 193.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -219.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.61 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3631.96 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26111.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 334.5 MB). Free memory was 1.0 GB in the beginning and 905.1 MB in the end (delta: 116.4 MB). Peak memory consumption was 450.9 MB. Max. memory is 11.5 GB. * Witness Printer took 308.13 ms. Allocated memory is still 1.5 GB. Free memory was 905.1 MB in the beginning and 892.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: (((((((((((((((a8 == 14 && a12 == 8) && a17 <= 0) && a21 == 1) && a20 == 1) && a16 == 5) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && a16 == 6) && a20 <= 0)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a20 == 1) && a16 == 6)) || (((a16 == 4 && a12 == 8) && a21 == 1) && a20 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a12 == 8) && a20 == 1) && a21 == 1)) || ((((a21 <= 0 && !(6 == a16)) && a17 == 1) && a12 == 8) && a20 <= 0)) || (((((!(a7 == 1) && a20 == 1) && a21 == 1) && a16 == 6) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) && a12 == 8)) || ((((a16 == 4 && a12 == 8) && a17 == 1) && a21 == 1) && !(a7 == 1))) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && input == 4)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || (((((a16 == 4 && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && a20 <= 0) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((a8 == 14 && a12 == 8) && a17 <= 0) && a21 == 1) && a20 == 1) && a16 == 5) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && a16 == 6) && a20 <= 0)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a20 == 1) && a16 == 6)) || (((a16 == 4 && a12 == 8) && a21 == 1) && a20 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a12 == 8) && a20 == 1) && a21 == 1)) || ((((a21 <= 0 && !(6 == a16)) && a17 == 1) && a12 == 8) && a20 <= 0)) || (((((!(a7 == 1) && a20 == 1) && a21 == 1) && a16 == 6) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) && a12 == 8)) || ((((a16 == 4 && a12 == 8) && a17 == 1) && a21 == 1) && !(a7 == 1))) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && input == 4)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || (((((a16 == 4 && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && a20 <= 0) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 25.9s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 647 SDtfs, 2735 SDslu, 169 SDs, 0 SdLazy, 8057 SolverSat, 826 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 518 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1060 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 459 HoareAnnotationTreeSize, 3 FomulaSimplifications, 915 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 168 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2564 ConstructedInterpolants, 0 QuantifiedInterpolants, 2831891 SizeOfPredicates, 2 NumberOfNonLiveVariables, 883 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1686/1717 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...