./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17769653fcc1793cb44568ec45f15628df5f1ace ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:25:12,686 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:25:12,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:25:12,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:25:12,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:25:12,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:25:12,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:25:12,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:25:12,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:25:12,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:25:12,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:25:12,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:25:12,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:25:12,711 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:25:12,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:25:12,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:25:12,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:25:12,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:25:12,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:25:12,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:25:12,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:25:12,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:25:12,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:25:12,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:25:12,726 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:25:12,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:25:12,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:25:12,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:25:12,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:25:12,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:25:12,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:25:12,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:25:12,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:25:12,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:25:12,740 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:25:12,740 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:25:12,741 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:25:12,773 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:25:12,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:25:12,775 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:25:12,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:25:12,777 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:25:12,777 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:25:12,777 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:25:12,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:25:12,777 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:25:12,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:25:12,778 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:25:12,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:25:12,778 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:25:12,778 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:25:12,778 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:25:12,779 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:25:12,781 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:25:12,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:25:12,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:25:12,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:25:12,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:25:12,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:25:12,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:25:12,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:25:12,783 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:25:12,783 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:25:12,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:25:12,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:25:12,783 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 -> 17769653fcc1793cb44568ec45f15628df5f1ace [2019-01-12 11:25:12,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:25:12,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:25:12,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:25:12,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:25:12,846 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:25:12,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2019-01-12 11:25:12,914 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d585abda7/bb9e78216ac444638e62642670fa5057/FLAG52bea2d65 [2019-01-12 11:25:13,408 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:25:13,410 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2019-01-12 11:25:13,432 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d585abda7/bb9e78216ac444638e62642670fa5057/FLAG52bea2d65 [2019-01-12 11:25:13,706 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d585abda7/bb9e78216ac444638e62642670fa5057 [2019-01-12 11:25:13,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:25:13,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:25:13,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:25:13,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:25:13,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:25:13,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9c63be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13, skipping insertion in model container [2019-01-12 11:25:13,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:25:13,789 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:25:14,113 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:25:14,120 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:25:14,226 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:25:14,241 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:25:14,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14 WrapperNode [2019-01-12 11:25:14,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:25:14,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:25:14,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:25:14,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:25:14,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:25:14,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:25:14,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:25:14,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:25:14,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... [2019-01-12 11:25:14,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:25:14,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:25:14,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:25:14,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:25:14,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:25:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:25:14,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:25:16,151 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:25:16,151 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:25:16,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:25:16 BoogieIcfgContainer [2019-01-12 11:25:16,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:25:16,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:25:16,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:25:16,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:25:16,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:25:13" (1/3) ... [2019-01-12 11:25:16,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a03dc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:25:16, skipping insertion in model container [2019-01-12 11:25:16,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:14" (2/3) ... [2019-01-12 11:25:16,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a03dc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:25:16, skipping insertion in model container [2019-01-12 11:25:16,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:25:16" (3/3) ... [2019-01-12 11:25:16,161 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2019-01-12 11:25:16,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:25:16,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:25:16,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:25:16,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:25:16,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:25:16,224 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:25:16,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:25:16,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:25:16,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:25:16,224 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:25:16,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:25:16,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:25:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-01-12 11:25:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:16,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:16,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:16,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1067704148, now seen corresponding path program 1 times [2019-01-12 11:25:16,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:16,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:25:16,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:25:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:25:16,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:16,491 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2019-01-12 11:25:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:17,518 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2019-01-12 11:25:17,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:25:17,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-01-12 11:25:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:17,533 INFO L225 Difference]: With dead ends: 284 [2019-01-12 11:25:17,533 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 11:25:17,537 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 11:25:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 11:25:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-12 11:25:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-12 11:25:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-01-12 11:25:17,586 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 139 [2019-01-12 11:25:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:17,587 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-01-12 11:25:17,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:25:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-01-12 11:25:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:17,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:17,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:17,592 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1752580255, now seen corresponding path program 1 times [2019-01-12 11:25:17,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:17,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:17,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:25:17,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:25:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:25:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:17,692 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 3 states. [2019-01-12 11:25:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:18,554 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2019-01-12 11:25:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:25:18,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-01-12 11:25:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:18,559 INFO L225 Difference]: With dead ends: 406 [2019-01-12 11:25:18,559 INFO L226 Difference]: Without dead ends: 273 [2019-01-12 11:25:18,560 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 11:25:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-12 11:25:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-01-12 11:25:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-12 11:25:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2019-01-12 11:25:18,587 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 139 [2019-01-12 11:25:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:18,588 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2019-01-12 11:25:18,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:25:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2019-01-12 11:25:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:18,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:18,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:18,592 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2041942551, now seen corresponding path program 1 times [2019-01-12 11:25:18,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:18,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:18,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:18,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:18,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:18,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:18,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:25:18,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:25:18,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:25:18,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:25:18,813 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand 6 states. [2019-01-12 11:25:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:19,670 INFO L93 Difference]: Finished difference Result 402 states and 470 transitions. [2019-01-12 11:25:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:25:19,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-01-12 11:25:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:19,674 INFO L225 Difference]: With dead ends: 402 [2019-01-12 11:25:19,674 INFO L226 Difference]: Without dead ends: 267 [2019-01-12 11:25:19,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:25:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-01-12 11:25:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-01-12 11:25:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-12 11:25:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 332 transitions. [2019-01-12 11:25:19,696 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 332 transitions. Word has length 139 [2019-01-12 11:25:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:19,697 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 332 transitions. [2019-01-12 11:25:19,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:25:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 332 transitions. [2019-01-12 11:25:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:19,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:19,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:19,700 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1527946145, now seen corresponding path program 1 times [2019-01-12 11:25:19,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:19,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:19,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:25:19,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:25:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:25:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:25:19,884 INFO L87 Difference]: Start difference. First operand 267 states and 332 transitions. Second operand 7 states. [2019-01-12 11:25:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:21,343 INFO L93 Difference]: Finished difference Result 394 states and 459 transitions. [2019-01-12 11:25:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:25:21,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-01-12 11:25:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:21,347 INFO L225 Difference]: With dead ends: 394 [2019-01-12 11:25:21,347 INFO L226 Difference]: Without dead ends: 265 [2019-01-12 11:25:21,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:25:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-12 11:25:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-01-12 11:25:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-01-12 11:25:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2019-01-12 11:25:21,369 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 139 [2019-01-12 11:25:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:21,369 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2019-01-12 11:25:21,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:25:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2019-01-12 11:25:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:21,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:21,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:21,372 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1089183555, now seen corresponding path program 1 times [2019-01-12 11:25:21,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:21,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:21,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 11:25:21,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:25:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:25:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:25:21,563 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand 10 states. [2019-01-12 11:25:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:22,972 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2019-01-12 11:25:22,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:25:22,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2019-01-12 11:25:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:22,975 INFO L225 Difference]: With dead ends: 386 [2019-01-12 11:25:22,975 INFO L226 Difference]: Without dead ends: 259 [2019-01-12 11:25:22,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:25:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-12 11:25:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-01-12 11:25:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-12 11:25:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2019-01-12 11:25:23,001 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 139 [2019-01-12 11:25:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:23,002 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2019-01-12 11:25:23,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:25:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2019-01-12 11:25:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:23,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:23,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:23,004 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash -41763050, now seen corresponding path program 1 times [2019-01-12 11:25:23,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:23,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:23,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:23,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 11:25:23,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 11:25:23,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 11:25:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:25:23,196 INFO L87 Difference]: Start difference. First operand 259 states and 320 transitions. Second operand 13 states. [2019-01-12 11:25:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:24,869 INFO L93 Difference]: Finished difference Result 374 states and 435 transitions. [2019-01-12 11:25:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 11:25:24,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2019-01-12 11:25:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:24,875 INFO L225 Difference]: With dead ends: 374 [2019-01-12 11:25:24,875 INFO L226 Difference]: Without dead ends: 253 [2019-01-12 11:25:24,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:25:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-12 11:25:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-01-12 11:25:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-12 11:25:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 311 transitions. [2019-01-12 11:25:24,890 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 311 transitions. Word has length 139 [2019-01-12 11:25:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:24,890 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 311 transitions. [2019-01-12 11:25:24,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 11:25:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 311 transitions. [2019-01-12 11:25:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:24,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:24,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:24,894 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1153200357, now seen corresponding path program 1 times [2019-01-12 11:25:24,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:24,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:24,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:25,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:25,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-12 11:25:25,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 11:25:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 11:25:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:25:25,222 INFO L87 Difference]: Start difference. First operand 253 states and 311 transitions. Second operand 15 states. [2019-01-12 11:25:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:26,707 INFO L93 Difference]: Finished difference Result 364 states and 422 transitions. [2019-01-12 11:25:26,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 11:25:26,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 139 [2019-01-12 11:25:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:26,711 INFO L225 Difference]: With dead ends: 364 [2019-01-12 11:25:26,711 INFO L226 Difference]: Without dead ends: 249 [2019-01-12 11:25:26,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:25:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-12 11:25:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-01-12 11:25:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-12 11:25:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2019-01-12 11:25:26,722 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 139 [2019-01-12 11:25:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:26,722 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2019-01-12 11:25:26,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 11:25:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2019-01-12 11:25:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:26,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:26,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:26,725 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -717830785, now seen corresponding path program 1 times [2019-01-12 11:25:26,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:26,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:27,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:27,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-01-12 11:25:27,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:25:27,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:25:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:25:27,111 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand 19 states. [2019-01-12 11:25:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:28,471 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2019-01-12 11:25:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 11:25:28,472 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 139 [2019-01-12 11:25:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:28,474 INFO L225 Difference]: With dead ends: 352 [2019-01-12 11:25:28,474 INFO L226 Difference]: Without dead ends: 241 [2019-01-12 11:25:28,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:25:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-12 11:25:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-12 11:25:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-12 11:25:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2019-01-12 11:25:28,483 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 139 [2019-01-12 11:25:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:28,483 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2019-01-12 11:25:28,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:25:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2019-01-12 11:25:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:28,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:28,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:28,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1738769551, now seen corresponding path program 1 times [2019-01-12 11:25:28,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:28,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:28,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:28,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:28,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-12 11:25:28,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 11:25:28,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 11:25:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:25:28,815 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand 22 states. [2019-01-12 11:25:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:31,031 INFO L93 Difference]: Finished difference Result 338 states and 390 transitions. [2019-01-12 11:25:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 11:25:31,032 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 139 [2019-01-12 11:25:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:31,034 INFO L225 Difference]: With dead ends: 338 [2019-01-12 11:25:31,034 INFO L226 Difference]: Without dead ends: 235 [2019-01-12 11:25:31,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:25:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-12 11:25:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-01-12 11:25:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-12 11:25:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2019-01-12 11:25:31,042 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 139 [2019-01-12 11:25:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:31,043 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2019-01-12 11:25:31,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 11:25:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2019-01-12 11:25:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:31,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:31,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:31,045 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -834827415, now seen corresponding path program 1 times [2019-01-12 11:25:31,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:31,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:31,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:31,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-12 11:25:31,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 11:25:31,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 11:25:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:25:31,360 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand 23 states. [2019-01-12 11:25:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:35,766 INFO L93 Difference]: Finished difference Result 330 states and 379 transitions. [2019-01-12 11:25:35,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 11:25:35,767 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2019-01-12 11:25:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:35,769 INFO L225 Difference]: With dead ends: 330 [2019-01-12 11:25:35,769 INFO L226 Difference]: Without dead ends: 233 [2019-01-12 11:25:35,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-01-12 11:25:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-12 11:25:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-01-12 11:25:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-12 11:25:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2019-01-12 11:25:35,778 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 139 [2019-01-12 11:25:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:35,778 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2019-01-12 11:25:35,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 11:25:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2019-01-12 11:25:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:35,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:35,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:35,780 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1868941195, now seen corresponding path program 1 times [2019-01-12 11:25:35,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:35,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:36,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:36,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-01-12 11:25:36,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 11:25:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 11:25:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:25:36,183 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand 26 states. [2019-01-12 11:25:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:38,299 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2019-01-12 11:25:38,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 11:25:38,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2019-01-12 11:25:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:38,303 INFO L225 Difference]: With dead ends: 322 [2019-01-12 11:25:38,303 INFO L226 Difference]: Without dead ends: 227 [2019-01-12 11:25:38,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:25:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-12 11:25:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-01-12 11:25:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-12 11:25:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2019-01-12 11:25:38,312 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 139 [2019-01-12 11:25:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:38,312 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2019-01-12 11:25:38,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 11:25:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2019-01-12 11:25:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:38,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:38,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:38,315 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:38,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1432066370, now seen corresponding path program 1 times [2019-01-12 11:25:38,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:38,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:38,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:39,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:39,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-01-12 11:25:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 11:25:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 11:25:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-12 11:25:39,614 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand 29 states. [2019-01-12 11:25:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:40,832 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2019-01-12 11:25:40,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 11:25:40,838 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 139 [2019-01-12 11:25:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:40,839 INFO L225 Difference]: With dead ends: 310 [2019-01-12 11:25:40,839 INFO L226 Difference]: Without dead ends: 221 [2019-01-12 11:25:40,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-01-12 11:25:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-01-12 11:25:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-01-12 11:25:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-12 11:25:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2019-01-12 11:25:40,850 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 139 [2019-01-12 11:25:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:40,850 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2019-01-12 11:25:40,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 11:25:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2019-01-12 11:25:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:40,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:40,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:40,852 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -269817043, now seen corresponding path program 1 times [2019-01-12 11:25:40,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:40,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-01-12 11:25:41,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 11:25:41,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 11:25:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-12 11:25:41,299 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand 31 states. [2019-01-12 11:25:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:43,843 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2019-01-12 11:25:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 11:25:43,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 139 [2019-01-12 11:25:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:43,852 INFO L225 Difference]: With dead ends: 300 [2019-01-12 11:25:43,853 INFO L226 Difference]: Without dead ends: 217 [2019-01-12 11:25:43,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-12 11:25:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-12 11:25:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-01-12 11:25:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-12 11:25:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2019-01-12 11:25:43,862 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 139 [2019-01-12 11:25:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:43,863 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2019-01-12 11:25:43,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 11:25:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2019-01-12 11:25:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:43,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:43,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:43,866 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash -295254777, now seen corresponding path program 1 times [2019-01-12 11:25:43,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:44,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-01-12 11:25:44,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 11:25:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 11:25:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 11:25:44,439 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand 35 states. [2019-01-12 11:25:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:46,924 INFO L93 Difference]: Finished difference Result 288 states and 328 transitions. [2019-01-12 11:25:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 11:25:46,925 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2019-01-12 11:25:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:46,928 INFO L225 Difference]: With dead ends: 288 [2019-01-12 11:25:46,928 INFO L226 Difference]: Without dead ends: 209 [2019-01-12 11:25:46,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 11:25:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-12 11:25:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-12 11:25:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-12 11:25:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2019-01-12 11:25:46,937 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 139 [2019-01-12 11:25:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:46,937 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2019-01-12 11:25:46,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 11:25:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2019-01-12 11:25:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:46,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:46,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:46,941 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1471149049, now seen corresponding path program 1 times [2019-01-12 11:25:46,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:46,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:46,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:48,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:48,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-01-12 11:25:48,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-12 11:25:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-12 11:25:48,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 11:25:48,367 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand 38 states. [2019-01-12 11:25:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:51,372 INFO L93 Difference]: Finished difference Result 274 states and 310 transitions. [2019-01-12 11:25:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-12 11:25:51,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 139 [2019-01-12 11:25:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:51,374 INFO L225 Difference]: With dead ends: 274 [2019-01-12 11:25:51,375 INFO L226 Difference]: Without dead ends: 203 [2019-01-12 11:25:51,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 11:25:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-12 11:25:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-12 11:25:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-12 11:25:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 236 transitions. [2019-01-12 11:25:51,382 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 236 transitions. Word has length 139 [2019-01-12 11:25:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:51,383 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 236 transitions. [2019-01-12 11:25:51,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-12 11:25:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 236 transitions. [2019-01-12 11:25:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:51,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:51,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:51,386 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2129031119, now seen corresponding path program 1 times [2019-01-12 11:25:51,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:51,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:51,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:51,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:51,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:52,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:52,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-01-12 11:25:52,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-12 11:25:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-12 11:25:52,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 11:25:52,088 INFO L87 Difference]: Start difference. First operand 203 states and 236 transitions. Second operand 39 states. [2019-01-12 11:25:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:53,386 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2019-01-12 11:25:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 11:25:53,387 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 139 [2019-01-12 11:25:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:53,390 INFO L225 Difference]: With dead ends: 266 [2019-01-12 11:25:53,390 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 11:25:53,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 11:25:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 11:25:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-12 11:25:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-12 11:25:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2019-01-12 11:25:53,397 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 139 [2019-01-12 11:25:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:53,397 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2019-01-12 11:25:53,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-12 11:25:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2019-01-12 11:25:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:53,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:53,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:53,401 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1672960723, now seen corresponding path program 1 times [2019-01-12 11:25:53,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:53,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:55,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:55,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2019-01-12 11:25:55,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-12 11:25:55,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-12 11:25:55,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 11:25:55,496 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand 42 states. [2019-01-12 11:25:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:58,291 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2019-01-12 11:25:58,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-12 11:25:58,293 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 139 [2019-01-12 11:25:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:58,294 INFO L225 Difference]: With dead ends: 258 [2019-01-12 11:25:58,294 INFO L226 Difference]: Without dead ends: 195 [2019-01-12 11:25:58,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 11:25:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-12 11:25:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-12 11:25:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-12 11:25:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2019-01-12 11:25:58,300 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 139 [2019-01-12 11:25:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:58,300 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2019-01-12 11:25:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-12 11:25:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2019-01-12 11:25:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:25:58,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:58,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:58,304 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash -371842202, now seen corresponding path program 1 times [2019-01-12 11:25:58,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:58,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:59,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:59,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2019-01-12 11:25:59,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-12 11:25:59,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-12 11:25:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 11:25:59,206 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand 45 states. [2019-01-12 11:26:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:02,287 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2019-01-12 11:26:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-12 11:26:02,293 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2019-01-12 11:26:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:02,294 INFO L225 Difference]: With dead ends: 246 [2019-01-12 11:26:02,294 INFO L226 Difference]: Without dead ends: 189 [2019-01-12 11:26:02,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 11:26:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-12 11:26:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-12 11:26:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-12 11:26:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2019-01-12 11:26:02,301 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 139 [2019-01-12 11:26:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:02,301 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2019-01-12 11:26:02,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-12 11:26:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2019-01-12 11:26:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:26:02,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:02,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:02,304 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:02,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:02,304 INFO L82 PathProgramCache]: Analyzing trace with hash 941521525, now seen corresponding path program 1 times [2019-01-12 11:26:02,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:02,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:02,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:03,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:26:03,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2019-01-12 11:26:03,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 11:26:03,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 11:26:03,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 11:26:03,544 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand 47 states. [2019-01-12 11:26:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:06,433 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2019-01-12 11:26:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-12 11:26:06,435 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 139 [2019-01-12 11:26:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:06,436 INFO L225 Difference]: With dead ends: 236 [2019-01-12 11:26:06,436 INFO L226 Difference]: Without dead ends: 185 [2019-01-12 11:26:06,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 11:26:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-12 11:26:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-12 11:26:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-12 11:26:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2019-01-12 11:26:06,443 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 139 [2019-01-12 11:26:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:06,444 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2019-01-12 11:26:06,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 11:26:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2019-01-12 11:26:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:26:06,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:06,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:06,447 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 566614415, now seen corresponding path program 1 times [2019-01-12 11:26:06,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:06,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:07,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:26:07,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2019-01-12 11:26:07,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-12 11:26:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-12 11:26:07,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 11:26:07,535 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand 51 states. [2019-01-12 11:26:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:10,489 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2019-01-12 11:26:10,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-12 11:26:10,490 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 139 [2019-01-12 11:26:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:10,491 INFO L225 Difference]: With dead ends: 224 [2019-01-12 11:26:10,491 INFO L226 Difference]: Without dead ends: 177 [2019-01-12 11:26:10,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 11:26:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-12 11:26:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-12 11:26:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-12 11:26:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2019-01-12 11:26:10,498 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 139 [2019-01-12 11:26:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:10,498 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2019-01-12 11:26:10,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-12 11:26:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2019-01-12 11:26:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:26:10,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:10,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:10,502 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash 325265535, now seen corresponding path program 1 times [2019-01-12 11:26:10,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:10,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:12,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:26:12,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-01-12 11:26:12,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 11:26:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 11:26:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 11:26:12,442 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand 53 states. [2019-01-12 11:26:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:13,713 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2019-01-12 11:26:13,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 11:26:13,714 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 139 [2019-01-12 11:26:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:13,715 INFO L225 Difference]: With dead ends: 212 [2019-01-12 11:26:13,716 INFO L226 Difference]: Without dead ends: 143 [2019-01-12 11:26:13,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 11:26:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-12 11:26:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-01-12 11:26:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-12 11:26:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-12 11:26:13,724 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 139 [2019-01-12 11:26:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:13,724 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-12 11:26:13,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 11:26:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-12 11:26:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 11:26:13,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:13,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:13,725 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2012640870, now seen corresponding path program 1 times [2019-01-12 11:26:13,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:13,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:13,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:13,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:13,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:14,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:26:14,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-12 11:26:14,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 11:26:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 11:26:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:26:14,580 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 22 states. [2019-01-12 11:26:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:15,004 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-12 11:26:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 11:26:15,008 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 139 [2019-01-12 11:26:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:15,009 INFO L225 Difference]: With dead ends: 184 [2019-01-12 11:26:15,009 INFO L226 Difference]: Without dead ends: 181 [2019-01-12 11:26:15,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:26:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-12 11:26:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-01-12 11:26:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-12 11:26:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-01-12 11:26:15,019 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 139 [2019-01-12 11:26:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:15,019 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-01-12 11:26:15,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 11:26:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-01-12 11:26:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-12 11:26:15,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:15,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:15,023 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1095804606, now seen corresponding path program 1 times [2019-01-12 11:26:15,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:15,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:15,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:15,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:15,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 11:26:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:26:17,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-01-12 11:26:17,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:26:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:26:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:26:17,125 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 52 states. [2019-01-12 11:26:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:19,570 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2019-01-12 11:26:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:26:19,571 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 143 [2019-01-12 11:26:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:19,573 INFO L225 Difference]: With dead ends: 188 [2019-01-12 11:26:19,573 INFO L226 Difference]: Without dead ends: 146 [2019-01-12 11:26:19,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:26:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-12 11:26:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-01-12 11:26:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 11:26:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-12 11:26:19,582 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-01-12 11:26:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:19,583 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-12 11:26:19,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:26:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-12 11:26:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 11:26:19,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:19,584 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:19,584 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash -818315832, now seen corresponding path program 1 times [2019-01-12 11:26:19,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:19,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:19,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:21,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:21,099 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 11:26:21,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:21,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:23,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:23,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 73] total 75 [2019-01-12 11:26:23,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-12 11:26:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-12 11:26:24,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-01-12 11:26:24,002 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 75 states. [2019-01-12 11:26:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:25,039 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-12 11:26:25,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-12 11:26:25,041 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 145 [2019-01-12 11:26:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:25,042 INFO L225 Difference]: With dead ends: 156 [2019-01-12 11:26:25,043 INFO L226 Difference]: Without dead ends: 153 [2019-01-12 11:26:25,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-01-12 11:26:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-12 11:26:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-01-12 11:26:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 11:26:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-01-12 11:26:25,052 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 145 [2019-01-12 11:26:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:25,053 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-01-12 11:26:25,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-12 11:26:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-01-12 11:26:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-12 11:26:25,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:25,054 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:25,054 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1459546250, now seen corresponding path program 2 times [2019-01-12 11:26:25,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:25,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:25,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:26,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:26,020 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 11:26:26,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:26:26,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:26:26,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:26,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:27,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:27,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 76] total 78 [2019-01-12 11:26:27,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-12 11:26:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-12 11:26:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-12 11:26:27,566 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 78 states. [2019-01-12 11:26:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:29,012 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-01-12 11:26:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-12 11:26:29,014 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 151 [2019-01-12 11:26:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:29,016 INFO L225 Difference]: With dead ends: 162 [2019-01-12 11:26:29,016 INFO L226 Difference]: Without dead ends: 159 [2019-01-12 11:26:29,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-12 11:26:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-12 11:26:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-01-12 11:26:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-12 11:26:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-01-12 11:26:29,025 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 151 [2019-01-12 11:26:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:29,025 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-01-12 11:26:29,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-12 11:26:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-01-12 11:26:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 11:26:29,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:29,027 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:29,029 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1601058468, now seen corresponding path program 3 times [2019-01-12 11:26:29,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:29,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:29,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:29,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:29,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:26:29,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 11:26:29,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:29,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:30,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:30,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 79] total 81 [2019-01-12 11:26:30,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-12 11:26:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-12 11:26:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-01-12 11:26:30,868 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 81 states. [2019-01-12 11:26:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:32,055 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-01-12 11:26:32,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-12 11:26:32,057 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 157 [2019-01-12 11:26:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:32,058 INFO L225 Difference]: With dead ends: 168 [2019-01-12 11:26:32,058 INFO L226 Difference]: Without dead ends: 165 [2019-01-12 11:26:32,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-01-12 11:26:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-12 11:26:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-01-12 11:26:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-12 11:26:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-01-12 11:26:32,066 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 157 [2019-01-12 11:26:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:32,066 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-01-12 11:26:32,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-12 11:26:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-01-12 11:26:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 11:26:32,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:32,070 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:32,070 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 849787730, now seen corresponding path program 4 times [2019-01-12 11:26:32,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:32,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:32,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:32,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:33,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:33,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:26:33,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:26:33,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:33,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:34,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 82] total 84 [2019-01-12 11:26:34,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-12 11:26:34,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-12 11:26:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 11:26:34,554 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 84 states. [2019-01-12 11:26:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:35,858 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2019-01-12 11:26:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-12 11:26:35,859 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 163 [2019-01-12 11:26:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:35,861 INFO L225 Difference]: With dead ends: 174 [2019-01-12 11:26:35,861 INFO L226 Difference]: Without dead ends: 171 [2019-01-12 11:26:35,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 11:26:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-12 11:26:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-01-12 11:26:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-12 11:26:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-01-12 11:26:35,870 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 163 [2019-01-12 11:26:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:35,870 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-01-12 11:26:35,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-12 11:26:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-01-12 11:26:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 11:26:35,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:35,873 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:35,873 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1726514560, now seen corresponding path program 5 times [2019-01-12 11:26:35,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:35,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:37,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:37,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:37,777 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:26:37,831 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-01-12 11:26:37,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:37,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:38,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:38,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 85] total 87 [2019-01-12 11:26:38,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-12 11:26:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-12 11:26:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-01-12 11:26:38,855 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 87 states. [2019-01-12 11:26:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:40,504 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2019-01-12 11:26:40,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-12 11:26:40,505 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 169 [2019-01-12 11:26:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:40,507 INFO L225 Difference]: With dead ends: 180 [2019-01-12 11:26:40,507 INFO L226 Difference]: Without dead ends: 177 [2019-01-12 11:26:40,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-01-12 11:26:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-12 11:26:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-01-12 11:26:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-12 11:26:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-12 11:26:40,517 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 169 [2019-01-12 11:26:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:40,517 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-12 11:26:40,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-12 11:26:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-12 11:26:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-12 11:26:40,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:40,520 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:40,521 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -762743506, now seen corresponding path program 6 times [2019-01-12 11:26:40,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:40,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:41,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:41,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:41,626 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:26:41,704 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 11:26:41,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:41,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:42,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:42,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 88] total 90 [2019-01-12 11:26:42,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-12 11:26:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-12 11:26:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-12 11:26:42,684 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 90 states. [2019-01-12 11:26:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:43,750 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2019-01-12 11:26:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-12 11:26:43,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 175 [2019-01-12 11:26:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:43,753 INFO L225 Difference]: With dead ends: 186 [2019-01-12 11:26:43,753 INFO L226 Difference]: Without dead ends: 183 [2019-01-12 11:26:43,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3700 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-12 11:26:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-12 11:26:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-01-12 11:26:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-12 11:26:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-01-12 11:26:43,762 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 175 [2019-01-12 11:26:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:43,762 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-01-12 11:26:43,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-12 11:26:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-01-12 11:26:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-12 11:26:43,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:43,766 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:43,766 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash -336106916, now seen corresponding path program 7 times [2019-01-12 11:26:43,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:43,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:44,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:44,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:44,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:44,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:45,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:45,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 91] total 93 [2019-01-12 11:26:45,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-12 11:26:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-12 11:26:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-01-12 11:26:45,773 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 93 states. [2019-01-12 11:26:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:46,973 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2019-01-12 11:26:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-12 11:26:46,975 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 181 [2019-01-12 11:26:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:46,977 INFO L225 Difference]: With dead ends: 192 [2019-01-12 11:26:46,977 INFO L226 Difference]: Without dead ends: 189 [2019-01-12 11:26:46,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4000 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-01-12 11:26:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-12 11:26:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-01-12 11:26:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-12 11:26:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-01-12 11:26:46,986 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 181 [2019-01-12 11:26:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:46,986 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-01-12 11:26:46,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-12 11:26:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-01-12 11:26:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-12 11:26:46,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:46,988 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:46,988 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1471694090, now seen corresponding path program 8 times [2019-01-12 11:26:46,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:46,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:48,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:48,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:26:48,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:26:48,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:48,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:49,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:49,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 94] total 96 [2019-01-12 11:26:49,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-12 11:26:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-12 11:26:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-12 11:26:49,384 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 96 states. [2019-01-12 11:26:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:50,517 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2019-01-12 11:26:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-12 11:26:50,518 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 187 [2019-01-12 11:26:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:50,520 INFO L225 Difference]: With dead ends: 198 [2019-01-12 11:26:50,520 INFO L226 Difference]: Without dead ends: 195 [2019-01-12 11:26:50,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4300 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-12 11:26:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-12 11:26:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-01-12 11:26:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 11:26:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-01-12 11:26:50,530 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 187 [2019-01-12 11:26:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:50,530 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-01-12 11:26:50,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-12 11:26:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-01-12 11:26:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 11:26:50,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:50,535 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:50,535 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash -160832200, now seen corresponding path program 9 times [2019-01-12 11:26:50,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:50,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:50,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:51,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:51,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:26:51,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-12 11:26:51,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:51,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:53,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 97] total 99 [2019-01-12 11:26:53,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-12 11:26:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-12 11:26:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-01-12 11:26:53,305 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 99 states. [2019-01-12 11:26:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:54,572 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2019-01-12 11:26:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-12 11:26:54,574 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 193 [2019-01-12 11:26:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:54,576 INFO L225 Difference]: With dead ends: 204 [2019-01-12 11:26:54,576 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 11:26:54,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4600 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-01-12 11:26:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 11:26:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-01-12 11:26:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-12 11:26:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-01-12 11:26:54,586 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 193 [2019-01-12 11:26:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:54,586 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-01-12 11:26:54,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-12 11:26:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-01-12 11:26:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-01-12 11:26:54,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:54,591 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:54,591 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1925327590, now seen corresponding path program 10 times [2019-01-12 11:26:54,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:54,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:54,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:55,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:55,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:55,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:26:55,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:26:55,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:55,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:56,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:56,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 100] total 102 [2019-01-12 11:26:56,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-12 11:26:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-12 11:26:56,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 11:26:56,871 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 102 states. [2019-01-12 11:26:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:58,286 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2019-01-12 11:26:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-12 11:26:58,287 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 199 [2019-01-12 11:26:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:58,288 INFO L225 Difference]: With dead ends: 209 [2019-01-12 11:26:58,289 INFO L226 Difference]: Without dead ends: 206 [2019-01-12 11:26:58,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 11:26:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-12 11:26:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-01-12 11:26:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-12 11:26:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-12 11:26:58,298 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 199 [2019-01-12 11:26:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:58,298 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-12 11:26:58,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-12 11:26:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-12 11:26:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 11:26:58,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:58,302 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:58,303 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1334769172, now seen corresponding path program 11 times [2019-01-12 11:26:58,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:58,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:00,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:27:00,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:27:00,523 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:27:00,614 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-01-12 11:27:00,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:27:00,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:27:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:00,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:27:00,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-01-12 11:27:00,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-12 11:27:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-12 11:27:00,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 11:27:00,812 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 54 states. [2019-01-12 11:27:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:02,899 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-01-12 11:27:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-12 11:27:02,901 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 205 [2019-01-12 11:27:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:02,902 INFO L225 Difference]: With dead ends: 212 [2019-01-12 11:27:02,902 INFO L226 Difference]: Without dead ends: 209 [2019-01-12 11:27:02,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 11:27:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-12 11:27:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-01-12 11:27:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-12 11:27:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-01-12 11:27:02,911 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-01-12 11:27:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:02,912 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-01-12 11:27:02,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-12 11:27:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-01-12 11:27:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-12 11:27:02,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:27:02,913 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:02,913 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:27:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:27:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1489572658, now seen corresponding path program 12 times [2019-01-12 11:27:02,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:27:02,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:27:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:02,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:27:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:27:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:27:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:27:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:27:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-01-12 11:27:04,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:27:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:27:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:27:04,328 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 52 states. [2019-01-12 11:27:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:27:04,776 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2019-01-12 11:27:04,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:27:04,778 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2019-01-12 11:27:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:27:04,778 INFO L225 Difference]: With dead ends: 208 [2019-01-12 11:27:04,779 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:27:04,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:27:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:27:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:27:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:27:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:27:04,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-01-12 11:27:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:27:04,781 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:27:04,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:27:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:27:04,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:27:04,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:27:04,996 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 11:27:06,373 WARN L181 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 206 [2019-01-12 11:27:07,064 INFO L444 ceAbstractionStarter]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= 11 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 11) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,064 INFO L444 ceAbstractionStarter]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 22 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 22) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,065 INFO L444 ceAbstractionStarter]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 33) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 33 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,065 INFO L444 ceAbstractionStarter]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 44) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 44 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,065 INFO L444 ceAbstractionStarter]: At program point L598(lines 338 599) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) [2019-01-12 11:27:07,065 INFO L444 ceAbstractionStarter]: At program point L466(lines 404 467) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 66) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,065 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 539) no Hoare annotation was computed. [2019-01-12 11:27:07,066 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 671) no Hoare annotation was computed. [2019-01-12 11:27:07,066 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 803) no Hoare annotation was computed. [2019-01-12 11:27:07,066 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 935) no Hoare annotation was computed. [2019-01-12 11:27:07,066 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 1067) no Hoare annotation was computed. [2019-01-12 11:27:07,066 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 1199) no Hoare annotation was computed. [2019-01-12 11:27:07,066 INFO L444 ceAbstractionStarter]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 8) (<= 8 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,066 INFO L444 ceAbstractionStarter]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 19) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 19 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,066 INFO L444 ceAbstractionStarter]: At program point L898(lines 188 899) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 30) (<= 30 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,066 INFO L444 ceAbstractionStarter]: At program point L766(lines 254 767) the Hoare annotation is: (and (<= 41 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 41) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,067 INFO L444 ceAbstractionStarter]: At program point L634(lines 320 635) the Hoare annotation is: (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) [2019-01-12 11:27:07,067 INFO L444 ceAbstractionStarter]: At program point L502(lines 386 503) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 467) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 599) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 731) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 863) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 995) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 1127) no Hoare annotation was computed. [2019-01-12 11:27:07,067 INFO L444 ceAbstractionStarter]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 5) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 5 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,068 INFO L444 ceAbstractionStarter]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= 16 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 16) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,068 INFO L444 ceAbstractionStarter]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 27) (<= 27 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,068 INFO L444 ceAbstractionStarter]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 38) (<= 38 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,068 INFO L444 ceAbstractionStarter]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= 49 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 49) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,068 INFO L444 ceAbstractionStarter]: At program point L538(lines 368 539) the Hoare annotation is: (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) [2019-01-12 11:27:07,068 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 11:27:07,068 INFO L448 ceAbstractionStarter]: For program point L374(lines 374 527) no Hoare annotation was computed. [2019-01-12 11:27:07,068 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 659) no Hoare annotation was computed. [2019-01-12 11:27:07,068 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 791) no Hoare annotation was computed. [2019-01-12 11:27:07,068 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 923) no Hoare annotation was computed. [2019-01-12 11:27:07,069 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 1055) no Hoare annotation was computed. [2019-01-12 11:27:07,069 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 1187) no Hoare annotation was computed. [2019-01-12 11:27:07,069 INFO L444 ceAbstractionStarter]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 2) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 2 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,069 INFO L444 ceAbstractionStarter]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 13) (<= ULTIMATE.start_main_~main__y~0 50) (<= 13 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,069 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2019-01-12 11:27:07,069 INFO L444 ceAbstractionStarter]: At program point L970(lines 152 971) the Hoare annotation is: (and (<= 24 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 24) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,069 INFO L444 ceAbstractionStarter]: At program point L838(lines 218 839) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 35) (<= 35 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,069 INFO L444 ceAbstractionStarter]: At program point L706(lines 284 707) the Hoare annotation is: (and (<= 46 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 46) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,069 INFO L444 ceAbstractionStarter]: At program point L574(lines 350 575) the Hoare annotation is: (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 455) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 587) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 719) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 851) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 983) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 1115) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 1247) no Hoare annotation was computed. [2019-01-12 11:27:07,070 INFO L444 ceAbstractionStarter]: At program point L1138(lines 68 1139) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 10) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= 10 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,070 INFO L444 ceAbstractionStarter]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 21) (<= 21 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,071 INFO L444 ceAbstractionStarter]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 32) (<= 32 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,071 INFO L444 ceAbstractionStarter]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= 43 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 43) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,071 INFO L444 ceAbstractionStarter]: At program point L610(lines 332 611) the Hoare annotation is: (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) [2019-01-12 11:27:07,071 INFO L444 ceAbstractionStarter]: At program point L478(lines 398 479) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 65)) [2019-01-12 11:27:07,071 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 515) no Hoare annotation was computed. [2019-01-12 11:27:07,071 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 647) no Hoare annotation was computed. [2019-01-12 11:27:07,071 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 779) no Hoare annotation was computed. [2019-01-12 11:27:07,071 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 911) no Hoare annotation was computed. [2019-01-12 11:27:07,071 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 1043) no Hoare annotation was computed. [2019-01-12 11:27:07,071 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 1175) no Hoare annotation was computed. [2019-01-12 11:27:07,072 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-01-12 11:27:07,072 INFO L444 ceAbstractionStarter]: At program point L1174(lines 50 1175) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 7) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 7 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,072 INFO L444 ceAbstractionStarter]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= 18 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 18) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,072 INFO L444 ceAbstractionStarter]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= 29 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 29) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,072 INFO L444 ceAbstractionStarter]: At program point L778(lines 248 779) the Hoare annotation is: (and (<= 40 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 40) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,072 INFO L444 ceAbstractionStarter]: At program point L646(lines 314 647) the Hoare annotation is: (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) [2019-01-12 11:27:07,072 INFO L444 ceAbstractionStarter]: At program point L514(lines 380 515) the Hoare annotation is: (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) [2019-01-12 11:27:07,072 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 575) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 707) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 839) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 971) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 1103) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 1235) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 428) no Hoare annotation was computed. [2019-01-12 11:27:07,073 INFO L444 ceAbstractionStarter]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 4) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 4 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,073 INFO L444 ceAbstractionStarter]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 15) (<= 15 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,074 INFO L444 ceAbstractionStarter]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 26) (<= 26 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,074 INFO L444 ceAbstractionStarter]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= 37 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 37) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,074 INFO L444 ceAbstractionStarter]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= 48 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 48) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,074 INFO L444 ceAbstractionStarter]: At program point L550(lines 362 551) the Hoare annotation is: (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,074 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 503) no Hoare annotation was computed. [2019-01-12 11:27:07,074 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 635) no Hoare annotation was computed. [2019-01-12 11:27:07,074 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 767) no Hoare annotation was computed. [2019-01-12 11:27:07,074 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 899) no Hoare annotation was computed. [2019-01-12 11:27:07,074 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 1031) no Hoare annotation was computed. [2019-01-12 11:27:07,074 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 1163) no Hoare annotation was computed. [2019-01-12 11:27:07,075 INFO L444 ceAbstractionStarter]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 1) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,075 INFO L444 ceAbstractionStarter]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 12) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 12 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,075 INFO L444 ceAbstractionStarter]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 23) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 23 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,075 INFO L444 ceAbstractionStarter]: At program point L850(lines 212 851) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 34) (<= ULTIMATE.start_main_~main__y~0 50) (<= 34 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,075 INFO L444 ceAbstractionStarter]: At program point L718(lines 278 719) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 45) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 45 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,075 INFO L444 ceAbstractionStarter]: At program point L586(lines 344 587) the Hoare annotation is: (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) [2019-01-12 11:27:07,076 INFO L444 ceAbstractionStarter]: At program point L454(lines 410 455) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~main__y~0 73) (<= 73 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 73) (<= 73 ULTIMATE.start_main_~main__y~0)) (and (<= 76 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 76) (<= 76 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 76)) (and (<= 91 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 91) (<= ULTIMATE.start_main_~main__y~0 91) (<= 91 ULTIMATE.start_main_~main__y~0)) (and (<= 71 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 71) (<= ULTIMATE.start_main_~main__x~0 71) (<= 71 ULTIMATE.start_main_~main__y~0)) (and (<= 77 ULTIMATE.start_main_~main__y~0) (<= 77 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 77) (<= ULTIMATE.start_main_~main__y~0 77)) (and (<= ULTIMATE.start_main_~main__x~0 70) (<= ULTIMATE.start_main_~main__y~0 70) (<= 70 ULTIMATE.start_main_~main__y~0) (<= 70 ULTIMATE.start_main_~main__x~0)) (and (<= 99 ULTIMATE.start_main_~main__x~0) (<= 99 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 99) (<= ULTIMATE.start_main_~main__y~0 99)) (and (<= 82 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 82) (<= 82 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 82)) (and (<= ULTIMATE.start_main_~main__y~0 86) (<= 86 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 86) (<= 86 ULTIMATE.start_main_~main__y~0)) (and (<= 88 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 88) (<= ULTIMATE.start_main_~main__y~0 88) (<= 88 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 98) (<= 98 ULTIMATE.start_main_~main__x~0) (<= 98 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 98)) (and (<= ULTIMATE.start_main_~main__y~0 75) (<= 75 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 75) (<= 75 ULTIMATE.start_main_~main__x~0)) (and (<= 90 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 90) (<= 90 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 90)) (and (<= ULTIMATE.start_main_~main__y~0 69) (<= 69 ULTIMATE.start_main_~main__x~0) (<= 69 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 69)) (and (<= ULTIMATE.start_main_~main__y~0 93) (<= 93 ULTIMATE.start_main_~main__x~0) (<= 93 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 93)) (and (<= 87 ULTIMATE.start_main_~main__y~0) (<= 87 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 87) (<= ULTIMATE.start_main_~main__y~0 87)) (and (<= 81 ULTIMATE.start_main_~main__x~0) (<= 81 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 81) (<= ULTIMATE.start_main_~main__x~0 81)) (and (<= ULTIMATE.start_main_~main__y~0 85) (<= ULTIMATE.start_main_~main__x~0 85) (<= 85 ULTIMATE.start_main_~main__y~0) (<= 85 ULTIMATE.start_main_~main__x~0)) (and (<= 68 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 68) (<= 68 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 68)) (and (<= 79 ULTIMATE.start_main_~main__x~0) (<= 79 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 79) (<= ULTIMATE.start_main_~main__y~0 79)) (and (<= 94 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 94) (<= 94 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 94)) (and (<= ULTIMATE.start_main_~main__x~0 95) (<= 95 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 95) (<= 95 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 84) (<= 84 ULTIMATE.start_main_~main__y~0) (<= 84 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 84)) (and (<= 83 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 83) (<= 83 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 83)) (and (<= ULTIMATE.start_main_~main__x~0 67) (<= 67 ULTIMATE.start_main_~main__y~0) (<= 67 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 67)) (and (<= 89 ULTIMATE.start_main_~main__x~0) (<= 89 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 89) (<= ULTIMATE.start_main_~main__x~0 89)) (and (<= 100 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 100) (<= 100 ULTIMATE.start_main_~main__y~0)) (and (<= 92 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 92) (<= 92 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 92)) (and (<= 72 ULTIMATE.start_main_~main__y~0) (<= 72 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 72) (<= ULTIMATE.start_main_~main__y~0 72)) (and (<= ULTIMATE.start_main_~main__y~0 97) (<= 97 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 97) (<= 97 ULTIMATE.start_main_~main__y~0)) (and (<= 74 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 74) (<= 74 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 74)) (and (<= ULTIMATE.start_main_~main__x~0 96) (<= 96 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 96) (<= 96 ULTIMATE.start_main_~main__x~0)) (and (<= 78 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 78) (<= 78 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 78)) (and (<= 80 ULTIMATE.start_main_~main__y~0) (<= 80 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 80) (<= ULTIMATE.start_main_~main__y~0 80))) [2019-01-12 11:27:07,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:27:07,076 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 563) no Hoare annotation was computed. [2019-01-12 11:27:07,076 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 695) no Hoare annotation was computed. [2019-01-12 11:27:07,076 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 827) no Hoare annotation was computed. [2019-01-12 11:27:07,076 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 959) no Hoare annotation was computed. [2019-01-12 11:27:07,076 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 1091) no Hoare annotation was computed. [2019-01-12 11:27:07,077 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 1223) no Hoare annotation was computed. [2019-01-12 11:27:07,077 INFO L444 ceAbstractionStarter]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= 9 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 9) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,077 INFO L444 ceAbstractionStarter]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 20) (<= 20 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,077 INFO L444 ceAbstractionStarter]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 31) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= 31 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,077 INFO L444 ceAbstractionStarter]: At program point L754(lines 260 755) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 42) (<= 42 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,077 INFO L444 ceAbstractionStarter]: At program point L622(lines 326 623) the Hoare annotation is: (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) [2019-01-12 11:27:07,077 INFO L444 ceAbstractionStarter]: At program point L490(lines 392 491) the Hoare annotation is: (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) [2019-01-12 11:27:07,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:27:07,077 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 491) no Hoare annotation was computed. [2019-01-12 11:27:07,077 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 623) no Hoare annotation was computed. [2019-01-12 11:27:07,078 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 755) no Hoare annotation was computed. [2019-01-12 11:27:07,078 INFO L451 ceAbstractionStarter]: At program point L1251(lines 8 1253) the Hoare annotation is: true [2019-01-12 11:27:07,078 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 887) no Hoare annotation was computed. [2019-01-12 11:27:07,078 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 1019) no Hoare annotation was computed. [2019-01-12 11:27:07,078 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 1151) no Hoare annotation was computed. [2019-01-12 11:27:07,078 INFO L444 ceAbstractionStarter]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= 6 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 6) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,078 INFO L444 ceAbstractionStarter]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (<= 17 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= ULTIMATE.start_main_~main__x~0 17)) [2019-01-12 11:27:07,078 INFO L444 ceAbstractionStarter]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 28) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 28 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,078 INFO L444 ceAbstractionStarter]: At program point L790(lines 242 791) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 39) (<= 39 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,079 INFO L444 ceAbstractionStarter]: At program point L658(lines 308 659) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 50 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,079 INFO L444 ceAbstractionStarter]: At program point L526(lines 374 527) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 551) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 683) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 815) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 947) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 1079) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 1211) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:27:07,079 INFO L444 ceAbstractionStarter]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (<= 3 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 3) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,079 INFO L444 ceAbstractionStarter]: At program point L1090(lines 92 1091) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 14) (<= 14 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,080 INFO L444 ceAbstractionStarter]: At program point L958(lines 158 959) the Hoare annotation is: (and (<= 25 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 25) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,080 INFO L444 ceAbstractionStarter]: At program point L826(lines 224 827) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 36) (<= 36 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,080 INFO L444 ceAbstractionStarter]: At program point L694(lines 290 695) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 47) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 47 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:27:07,080 INFO L444 ceAbstractionStarter]: At program point L562(lines 356 563) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) [2019-01-12 11:27:07,080 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 479) no Hoare annotation was computed. [2019-01-12 11:27:07,080 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 611) no Hoare annotation was computed. [2019-01-12 11:27:07,080 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 743) no Hoare annotation was computed. [2019-01-12 11:27:07,080 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 875) no Hoare annotation was computed. [2019-01-12 11:27:07,080 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 1007) no Hoare annotation was computed. [2019-01-12 11:27:07,080 INFO L448 ceAbstractionStarter]: For program point L68(lines 68 1139) no Hoare annotation was computed. [2019-01-12 11:27:07,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:27:07 BoogieIcfgContainer [2019-01-12 11:27:07,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:27:07,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:27:07,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:27:07,138 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:27:07,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:25:16" (3/4) ... [2019-01-12 11:27:07,149 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:27:07,189 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:27:07,190 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:27:07,342 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:27:07,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:27:07,343 INFO L168 Benchmark]: Toolchain (without parser) took 113631.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 387.4 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -58.7 MB). Peak memory consumption was 328.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:27:07,344 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:27:07,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.39 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:27:07,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:27:07,347 INFO L168 Benchmark]: Boogie Preprocessor took 37.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:27:07,347 INFO L168 Benchmark]: RCFGBuilder took 1734.95 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: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:27:07,347 INFO L168 Benchmark]: TraceAbstraction took 110980.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:27:07,348 INFO L168 Benchmark]: Witness Printer took 207.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-01-12 11:27:07,355 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 528.39 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1734.95 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: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110980.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. * Witness Printer took 207.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: 182]: Loop Invariant Derived loop invariant: ((29 <= main__x && main__x <= 29) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((50 <= main__y && 22 <= main__x) && main__x <= 22) && main__y <= 50 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((main__x <= 47 && 50 <= main__y) && 47 <= main__x) && main__y <= 50 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((main__x <= 15 && 15 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((40 <= main__x && main__x <= 40) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((main__x <= 8 && 8 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((25 <= main__x && 50 <= main__y) && main__x <= 25) && main__y <= 50 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57 - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((main__x <= 50 && 50 <= main__y) && 50 <= main__x) && main__y <= 50 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((18 <= main__x && main__x <= 18) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((43 <= main__x && 50 <= main__y) && main__x <= 43) && main__y <= 50 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((11 <= main__x && 50 <= main__y) && main__x <= 11) && main__y <= 50 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((main__x <= 36 && 36 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__x <= 4 && 50 <= main__y) && 4 <= main__x) && main__y <= 50 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((main__x <= 21 && 21 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((46 <= main__x && main__x <= 46) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 14) && 14 <= main__x) && main__y <= 50 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((main__x <= 39 && 39 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((main__x <= 7 && 50 <= main__y) && 7 <= main__x) && main__y <= 50 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((main__x <= 32 && 32 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((49 <= main__x && 50 <= main__y) && main__x <= 49) && main__y <= 50 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((17 <= main__x && 50 <= main__y) && main__y <= 50) && main__x <= 17 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 42) && 42 <= main__x) && main__y <= 50 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((main__x <= 10 && 50 <= main__y) && main__y <= 50) && 10 <= main__x - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((main__x <= 35 && 35 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((main__y <= 73 && 73 <= main__x) && main__x <= 73) && 73 <= main__y) || (((76 <= main__x && main__x <= 76) && 76 <= main__y) && main__y <= 76)) || (((91 <= main__x && main__x <= 91) && main__y <= 91) && 91 <= main__y)) || (((71 <= main__x && main__y <= 71) && main__x <= 71) && 71 <= main__y)) || (((77 <= main__y && 77 <= main__x) && main__x <= 77) && main__y <= 77)) || (((main__x <= 70 && main__y <= 70) && 70 <= main__y) && 70 <= main__x)) || (((99 <= main__x && 99 <= main__y) && main__x <= 99) && main__y <= 99)) || (((82 <= main__y && main__y <= 82) && 82 <= main__x) && main__x <= 82)) || (((main__y <= 86 && 86 <= main__x) && main__x <= 86) && 86 <= main__y)) || (((88 <= main__x && main__x <= 88) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 98 && 98 <= main__x) && 98 <= main__y) && main__x <= 98)) || (((main__y <= 75 && 75 <= main__y) && main__x <= 75) && 75 <= main__x)) || (((90 <= main__y && main__x <= 90) && 90 <= main__x) && main__y <= 90)) || (((main__y <= 69 && 69 <= main__x) && 69 <= main__y) && main__x <= 69)) || (((main__y <= 93 && 93 <= main__x) && 93 <= main__y) && main__x <= 93)) || (((87 <= main__y && 87 <= main__x) && main__x <= 87) && main__y <= 87)) || (((81 <= main__x && 81 <= main__y) && main__y <= 81) && main__x <= 81)) || (((main__y <= 85 && main__x <= 85) && 85 <= main__y) && 85 <= main__x)) || (((68 <= main__y && main__x <= 68) && 68 <= main__x) && main__y <= 68)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((94 <= main__x && main__x <= 94) && 94 <= main__y) && main__y <= 94)) || (((main__x <= 95 && 95 <= main__x) && main__y <= 95) && 95 <= main__y)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((83 <= main__x && main__y <= 83) && 83 <= main__y) && main__x <= 83)) || (((main__x <= 67 && 67 <= main__y) && 67 <= main__x) && main__y <= 67)) || (((89 <= main__x && 89 <= main__y) && main__y <= 89) && main__x <= 89)) || ((100 <= main__x && main__y <= 100) && 100 <= main__y)) || (((92 <= main__y && main__y <= 92) && 92 <= main__x) && main__x <= 92)) || (((72 <= main__y && 72 <= main__x) && main__x <= 72) && main__y <= 72)) || (((main__y <= 97 && 97 <= main__x) && main__x <= 97) && 97 <= main__y)) || (((74 <= main__y && main__y <= 74) && 74 <= main__x) && main__x <= 74)) || (((main__x <= 96 && 96 <= main__y) && main__y <= 96) && 96 <= main__x)) || (((78 <= main__x && main__x <= 78) && 78 <= main__y) && main__y <= 78)) || (((80 <= main__y && 80 <= main__x) && main__x <= 80) && main__y <= 80) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((3 <= main__x && 50 <= main__y) && main__x <= 3) && main__y <= 50 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((main__x <= 28 && 50 <= main__y) && 28 <= main__x) && main__y <= 50 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__x <= 45 && 50 <= main__y) && 45 <= main__x) && main__y <= 50 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 13) && main__y <= 50) && 13 <= main__x - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((main__x <= 38 && 38 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((6 <= main__x && 50 <= main__y) && main__x <= 6) && main__y <= 50 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((main__x <= 31 && 50 <= main__y) && main__y <= 50) && 31 <= main__x - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((24 <= main__x && 50 <= main__y) && main__x <= 24) && main__y <= 50 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56 - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((41 <= main__x && main__x <= 41) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((9 <= main__x && 50 <= main__y) && main__x <= 9) && main__y <= 50 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 34) && main__y <= 50) && 34 <= main__x - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((main__y <= 66 && 66 <= main__y) && main__x <= 66) && 66 <= main__x - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((main__x <= 2 && 50 <= main__y) && 2 <= main__x) && main__y <= 50 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((main__x <= 27 && 27 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((main__x <= 20 && 20 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((37 <= main__x && 50 <= main__y) && main__x <= 37) && main__y <= 50 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((main__x <= 5 && 50 <= main__y) && 5 <= main__x) && main__y <= 50 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((main__x <= 30 && 30 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((main__x <= 23 && 50 <= main__y) && 23 <= main__x) && main__y <= 50 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((48 <= main__x && 50 <= main__y) && main__x <= 48) && main__y <= 50 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((16 <= main__x && main__x <= 16) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((main__x <= 33 && 50 <= main__y) && 33 <= main__x) && main__y <= 50 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x <= 65 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 1) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((main__x <= 26 && 26 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((main__x <= 19 && 50 <= main__y) && 19 <= main__x) && main__y <= 50 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((main__x <= 44 && 50 <= main__y) && 44 <= main__x) && main__y <= 50 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((main__x <= 12 && 50 <= main__y) && 12 <= main__x) && main__y <= 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. SAFE Result, 110.8s OverallTime, 35 OverallIterations, 34 TraceHistogramMax, 60.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3089 SDtfs, 4889 SDslu, 10334 SDs, 0 SdLazy, 84072 SolverSat, 4829 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3037 GetRequests, 1482 SyntacticMatches, 2 SemanticMatches, 1553 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35500 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=2, 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, 35 MinimizatonAttempts, 13 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 169 NumberOfFragments, 1299 HoareAnnotationTreeSize, 68 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 68 FomulaSimplificationsInter, 444 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 44.4s InterpolantComputationTime, 7258 NumberOfCodeBlocks, 7258 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 7212 ConstructedInterpolants, 0 QuantifiedInterpolants, 2845336 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4708 ConjunctsInSsa, 963 ConjunctsInUnsatCore, 46 InterpolantComputations, 24 PerfectInterpolantSequences, 1160/10268 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...