./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.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/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.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 26d2d88b107593355990b3892c0d3e9a5490a1a3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 26d2d88b107593355990b3892c0d3e9a5490a1a3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:08:52,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:08:52,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:08:52,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:08:52,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:08:52,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:08:52,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:08:52,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:08:52,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:08:52,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:08:52,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:08:52,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:08:52,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:08:52,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:08:52,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:08:52,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:08:52,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:08:52,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:08:52,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:08:52,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:08:52,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:08:52,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:08:52,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:08:52,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:08:52,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:08:52,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:08:52,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:08:52,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:08:52,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:08:52,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:08:52,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:08:52,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:08:52,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:08:52,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:08:52,859 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:08:52,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:08:52,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:08:52,895 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:08:52,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:08:52,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:08:52,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:08:52,898 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:08:52,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:08:52,899 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:08:52,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:08:52,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:08:52,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:08:52,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:08:52,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:08:52,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:08:52,900 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:08:52,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:08:52,902 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:08:52,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:08:52,903 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:08:52,903 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:08:52,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:08:52,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:08:52,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:08:52,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:08:52,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:08:52,904 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:08:52,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:08:52,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:08:52,905 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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2019-01-14 15:08:52,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:08:52,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:08:52,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:08:52,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:08:52,974 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:08:52,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2019-01-14 15:08:53,040 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2161cbd99/1899814e86db47c08ffa8edfffe93e05/FLAG75c2f1cfa [2019-01-14 15:08:53,616 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:08:53,617 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2019-01-14 15:08:53,652 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2161cbd99/1899814e86db47c08ffa8edfffe93e05/FLAG75c2f1cfa [2019-01-14 15:08:53,817 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2161cbd99/1899814e86db47c08ffa8edfffe93e05 [2019-01-14 15:08:53,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:08:53,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:08:53,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:53,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:08:53,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:08:53,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:53" (1/1) ... [2019-01-14 15:08:53,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233505cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:53, skipping insertion in model container [2019-01-14 15:08:53,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:08:53" (1/1) ... [2019-01-14 15:08:53,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:08:53,926 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:08:54,505 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:54,526 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:08:54,737 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:08:54,770 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:08:54,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54 WrapperNode [2019-01-14 15:08:54,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:08:54,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:54,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:08:54,773 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:08:54,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:54,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:54,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:08:54,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:08:54,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:08:54,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:08:54,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:54,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:54,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:54,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:55,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:55,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:55,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (1/1) ... [2019-01-14 15:08:55,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:08:55,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:08:55,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:08:55,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:08:55,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (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-14 15:08:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:08:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:08:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:08:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:08:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:08:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:08:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:08:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:08:55,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:08:55,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:08:55,444 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:08:57,223 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-01-14 15:08:57,223 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-01-14 15:08:57,225 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:08:57,225 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:08:57,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:57 BoogieIcfgContainer [2019-01-14 15:08:57,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:08:57,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:08:57,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:08:57,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:08:57,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:08:53" (1/3) ... [2019-01-14 15:08:57,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a9e147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:57, skipping insertion in model container [2019-01-14 15:08:57,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:08:54" (2/3) ... [2019-01-14 15:08:57,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a9e147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:08:57, skipping insertion in model container [2019-01-14 15:08:57,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:57" (3/3) ... [2019-01-14 15:08:57,236 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2019-01-14 15:08:57,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:08:57,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:08:57,274 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:08:57,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:08:57,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:08:57,308 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:08:57,308 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:08:57,308 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:08:57,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:08:57,309 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:08:57,309 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:08:57,309 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:08:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-01-14 15:08:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 15:08:57,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:57,341 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] [2019-01-14 15:08:57,344 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-01-14 15:08:57,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:57,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:58,047 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-14 15:08:58,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:58,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:58,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:58,075 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-01-14 15:08:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:59,091 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-01-14 15:08:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:59,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-14 15:08:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:59,106 INFO L225 Difference]: With dead ends: 323 [2019-01-14 15:08:59,107 INFO L226 Difference]: Without dead ends: 163 [2019-01-14 15:08:59,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-14 15:08:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-01-14 15:08:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:08:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-01-14 15:08:59,160 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-01-14 15:08:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:59,160 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-01-14 15:08:59,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-01-14 15:08:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 15:08:59,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:59,163 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:08:59,164 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-01-14 15:08:59,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:08:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:08:59,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:08:59,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:08:59,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:08:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:08:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:08:59,425 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-01-14 15:08:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:08:59,923 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-01-14 15:08:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:08:59,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-01-14 15:08:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:08:59,927 INFO L225 Difference]: With dead ends: 290 [2019-01-14 15:08:59,927 INFO L226 Difference]: Without dead ends: 163 [2019-01-14 15:08:59,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:08:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-14 15:08:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-01-14 15:08:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:08:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-01-14 15:08:59,944 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-01-14 15:08:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:08:59,945 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-01-14 15:08:59,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:08:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-01-14 15:08:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 15:08:59,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:08:59,947 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] [2019-01-14 15:08:59,948 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:08:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:08:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-01-14 15:08:59,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:08:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:08:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:59,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:08:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:08:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:00,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:00,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:00,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:00,212 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-01-14 15:09:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:00,638 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-01-14 15:09:00,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:00,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-01-14 15:09:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:00,642 INFO L225 Difference]: With dead ends: 289 [2019-01-14 15:09:00,642 INFO L226 Difference]: Without dead ends: 162 [2019-01-14 15:09:00,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-14 15:09:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-01-14 15:09:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-01-14 15:09:00,670 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-01-14 15:09:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:00,671 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-01-14 15:09:00,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-01-14 15:09:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 15:09:00,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:00,676 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:00,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-01-14 15:09:00,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:00,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:00,926 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-01-14 15:09:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:01,405 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-01-14 15:09:01,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:01,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-01-14 15:09:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:01,408 INFO L225 Difference]: With dead ends: 287 [2019-01-14 15:09:01,408 INFO L226 Difference]: Without dead ends: 160 [2019-01-14 15:09:01,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-14 15:09:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-01-14 15:09:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-01-14 15:09:01,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-01-14 15:09:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:01,430 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-01-14 15:09:01,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-01-14 15:09:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 15:09:01,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:01,432 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:01,432 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-01-14 15:09:01,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:01,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:01,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:01,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:01,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:01,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:01,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:01,687 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-01-14 15:09:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:02,269 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-01-14 15:09:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:02,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-01-14 15:09:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:02,274 INFO L225 Difference]: With dead ends: 286 [2019-01-14 15:09:02,275 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 15:09:02,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 15:09:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-01-14 15:09:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-01-14 15:09:02,282 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-01-14 15:09:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:02,283 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-01-14 15:09:02,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-01-14 15:09:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 15:09:02,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:02,284 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:02,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-01-14 15:09:02,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:02,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:02,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:02,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:02,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:02,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:02,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:02,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:02,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:02,642 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-01-14 15:09:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:03,224 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-01-14 15:09:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:03,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-01-14 15:09:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:03,227 INFO L225 Difference]: With dead ends: 286 [2019-01-14 15:09:03,227 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 15:09:03,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 15:09:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-01-14 15:09:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-01-14 15:09:03,234 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-01-14 15:09:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:03,234 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-01-14 15:09:03,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-01-14 15:09:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 15:09:03,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:03,235 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:03,236 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:03,238 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-01-14 15:09:03,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:03,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:03,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:03,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:03,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:03,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:03,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:03,623 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-01-14 15:09:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:04,278 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-01-14 15:09:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:04,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-01-14 15:09:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:04,282 INFO L225 Difference]: With dead ends: 286 [2019-01-14 15:09:04,282 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 15:09:04,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 15:09:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-01-14 15:09:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-01-14 15:09:04,289 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-01-14 15:09:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:04,289 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-01-14 15:09:04,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-01-14 15:09:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 15:09:04,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:04,290 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:04,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-01-14 15:09:04,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:04,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:04,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:04,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:04,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:04,424 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-01-14 15:09:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:04,834 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-01-14 15:09:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:04,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-01-14 15:09:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:04,837 INFO L225 Difference]: With dead ends: 286 [2019-01-14 15:09:04,837 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 15:09:04,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 15:09:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-01-14 15:09:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-01-14 15:09:04,843 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-01-14 15:09:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-01-14 15:09:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-01-14 15:09:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 15:09:04,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:04,845 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:04,845 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-01-14 15:09:04,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:04,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:04,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:05,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:05,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:05,109 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-01-14 15:09:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:05,454 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-01-14 15:09:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:05,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-14 15:09:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:05,457 INFO L225 Difference]: With dead ends: 276 [2019-01-14 15:09:05,457 INFO L226 Difference]: Without dead ends: 149 [2019-01-14 15:09:05,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-14 15:09:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-14 15:09:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 15:09:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-01-14 15:09:05,463 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-01-14 15:09:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:05,463 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-01-14 15:09:05,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-01-14 15:09:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 15:09:05,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:05,464 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:05,465 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-01-14 15:09:05,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:05,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:05,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:05,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:05,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:05,790 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-01-14 15:09:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:06,776 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-01-14 15:09:06,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:06,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-14 15:09:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:06,782 INFO L225 Difference]: With dead ends: 316 [2019-01-14 15:09:06,783 INFO L226 Difference]: Without dead ends: 189 [2019-01-14 15:09:06,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-14 15:09:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-01-14 15:09:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-01-14 15:09:06,795 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-01-14 15:09:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:06,795 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-01-14 15:09:06,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-01-14 15:09:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 15:09:06,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:06,799 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:06,799 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-01-14 15:09:06,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:06,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:06,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:06,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:07,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:07,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:07,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:07,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:07,036 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-01-14 15:09:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:07,600 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-01-14 15:09:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:07,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-14 15:09:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:07,603 INFO L225 Difference]: With dead ends: 338 [2019-01-14 15:09:07,604 INFO L226 Difference]: Without dead ends: 189 [2019-01-14 15:09:07,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-14 15:09:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-01-14 15:09:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-01-14 15:09:07,611 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-01-14 15:09:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:07,611 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-01-14 15:09:07,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-01-14 15:09:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 15:09:07,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:07,613 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:07,613 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-01-14 15:09:07,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:07,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:07,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:07,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:07,798 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-01-14 15:09:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:08,811 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-01-14 15:09:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:08,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-14 15:09:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:08,815 INFO L225 Difference]: With dead ends: 337 [2019-01-14 15:09:08,815 INFO L226 Difference]: Without dead ends: 188 [2019-01-14 15:09:08,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-14 15:09:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-01-14 15:09:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-01-14 15:09:08,823 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-01-14 15:09:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:08,823 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-01-14 15:09:08,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-01-14 15:09:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 15:09:08,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:08,824 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:08,824 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-01-14 15:09:08,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:08,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:08,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:08,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:08,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:08,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:08,963 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-01-14 15:09:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:09,588 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-01-14 15:09:09,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:09,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-14 15:09:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:09,592 INFO L225 Difference]: With dead ends: 335 [2019-01-14 15:09:09,592 INFO L226 Difference]: Without dead ends: 186 [2019-01-14 15:09:09,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-14 15:09:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-01-14 15:09:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-01-14 15:09:09,598 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-01-14 15:09:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:09,599 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-01-14 15:09:09,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-01-14 15:09:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 15:09:09,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:09,600 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:09,600 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-01-14 15:09:09,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:09,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:09,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:09,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:09,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:09,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:09,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:09,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:09,898 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-01-14 15:09:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:10,453 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-01-14 15:09:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:10,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-14 15:09:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:10,457 INFO L225 Difference]: With dead ends: 334 [2019-01-14 15:09:10,457 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 15:09:10,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 15:09:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-01-14 15:09:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-01-14 15:09:10,463 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-01-14 15:09:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:10,463 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-01-14 15:09:10,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-01-14 15:09:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 15:09:10,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:10,464 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:10,465 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-01-14 15:09:10,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:10,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:10,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:10,699 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-01-14 15:09:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:11,064 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-01-14 15:09:11,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:11,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-14 15:09:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:11,067 INFO L225 Difference]: With dead ends: 334 [2019-01-14 15:09:11,067 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 15:09:11,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 15:09:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-01-14 15:09:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-01-14 15:09:11,077 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-01-14 15:09:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:11,077 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-01-14 15:09:11,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-01-14 15:09:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 15:09:11,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:11,078 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:11,081 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-01-14 15:09:11,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:11,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:11,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:11,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:11,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:11,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:11,227 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-01-14 15:09:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:11,561 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-01-14 15:09:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:11,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-14 15:09:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:11,564 INFO L225 Difference]: With dead ends: 334 [2019-01-14 15:09:11,564 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 15:09:11,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 15:09:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-01-14 15:09:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-01-14 15:09:11,570 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-01-14 15:09:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-01-14 15:09:11,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-01-14 15:09:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 15:09:11,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:11,571 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:11,571 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-01-14 15:09:11,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:11,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:11,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:11,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:11,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:11,691 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-01-14 15:09:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:11,974 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-01-14 15:09:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:11,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-14 15:09:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:11,977 INFO L225 Difference]: With dead ends: 334 [2019-01-14 15:09:11,977 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 15:09:11,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 15:09:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-01-14 15:09:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-01-14 15:09:11,989 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-01-14 15:09:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:11,990 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-01-14 15:09:11,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-01-14 15:09:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 15:09:11,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:11,993 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:11,993 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-01-14 15:09:11,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:11,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:11,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:11,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:11,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:12,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:12,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:12,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:12,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:12,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:12,174 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-01-14 15:09:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:13,293 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-01-14 15:09:13,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:13,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-01-14 15:09:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:13,295 INFO L225 Difference]: With dead ends: 324 [2019-01-14 15:09:13,295 INFO L226 Difference]: Without dead ends: 175 [2019-01-14 15:09:13,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-14 15:09:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-01-14 15:09:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 15:09:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-01-14 15:09:13,304 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-01-14 15:09:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:13,304 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-01-14 15:09:13,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-01-14 15:09:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 15:09:13,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:13,305 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:13,306 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-01-14 15:09:13,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:13,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:13,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:13,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:13,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:13,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:13,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:13,682 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-01-14 15:09:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:14,257 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2019-01-14 15:09:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:14,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-01-14 15:09:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:14,261 INFO L225 Difference]: With dead ends: 422 [2019-01-14 15:09:14,261 INFO L226 Difference]: Without dead ends: 273 [2019-01-14 15:09:14,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-14 15:09:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2019-01-14 15:09:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-14 15:09:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-01-14 15:09:14,267 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-01-14 15:09:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:14,268 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-01-14 15:09:14,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-01-14 15:09:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 15:09:14,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:14,269 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:14,269 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-01-14 15:09:14,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:14,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:14,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:14,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:14,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:14,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:14,419 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-01-14 15:09:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:14,803 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-01-14 15:09:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:14,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-01-14 15:09:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:14,807 INFO L225 Difference]: With dead ends: 427 [2019-01-14 15:09:14,807 INFO L226 Difference]: Without dead ends: 248 [2019-01-14 15:09:14,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-14 15:09:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-01-14 15:09:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 15:09:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-01-14 15:09:14,814 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-01-14 15:09:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:14,815 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-01-14 15:09:14,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-01-14 15:09:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-14 15:09:14,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:14,816 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:14,816 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-01-14 15:09:14,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:14,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:14,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:14,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:14,985 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-01-14 15:09:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:15,427 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-01-14 15:09:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:15,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-01-14 15:09:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:15,431 INFO L225 Difference]: With dead ends: 492 [2019-01-14 15:09:15,431 INFO L226 Difference]: Without dead ends: 289 [2019-01-14 15:09:15,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-14 15:09:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2019-01-14 15:09:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-01-14 15:09:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-01-14 15:09:15,438 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-01-14 15:09:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:15,439 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-01-14 15:09:15,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-01-14 15:09:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-14 15:09:15,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:15,440 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:15,440 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-01-14 15:09:15,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:15,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:15,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:15,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:15,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:15,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:15,741 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-01-14 15:09:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:16,223 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2019-01-14 15:09:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:16,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-14 15:09:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:16,228 INFO L225 Difference]: With dead ends: 493 [2019-01-14 15:09:16,228 INFO L226 Difference]: Without dead ends: 289 [2019-01-14 15:09:16,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-14 15:09:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2019-01-14 15:09:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-14 15:09:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-01-14 15:09:16,235 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-01-14 15:09:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:16,235 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-01-14 15:09:16,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-01-14 15:09:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 15:09:16,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:16,236 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:16,236 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-01-14 15:09:16,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:16,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:16,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:16,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:16,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:16,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:16,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:16,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:16,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:16,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:16,514 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-01-14 15:09:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:17,374 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-01-14 15:09:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:17,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-01-14 15:09:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:17,378 INFO L225 Difference]: With dead ends: 497 [2019-01-14 15:09:17,378 INFO L226 Difference]: Without dead ends: 283 [2019-01-14 15:09:17,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-01-14 15:09:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-01-14 15:09:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 15:09:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-01-14 15:09:17,384 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-01-14 15:09:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:17,384 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-01-14 15:09:17,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-01-14 15:09:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-14 15:09:17,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:17,385 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:17,385 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:17,386 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-01-14 15:09:17,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:17,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:17,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:17,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:17,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:17,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:17,685 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-01-14 15:09:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:18,106 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-01-14 15:09:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:18,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-01-14 15:09:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:18,109 INFO L225 Difference]: With dead ends: 498 [2019-01-14 15:09:18,109 INFO L226 Difference]: Without dead ends: 283 [2019-01-14 15:09:18,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-01-14 15:09:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-01-14 15:09:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 15:09:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-01-14 15:09:18,118 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-01-14 15:09:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:18,119 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-01-14 15:09:18,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-01-14 15:09:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-14 15:09:18,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:18,122 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:18,123 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:18,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-01-14 15:09:18,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:18,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:18,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:18,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:18,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:18,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:18,353 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-01-14 15:09:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:18,704 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-01-14 15:09:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:18,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-01-14 15:09:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:18,708 INFO L225 Difference]: With dead ends: 475 [2019-01-14 15:09:18,708 INFO L226 Difference]: Without dead ends: 260 [2019-01-14 15:09:18,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-14 15:09:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-01-14 15:09:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 15:09:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-01-14 15:09:18,714 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-01-14 15:09:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:18,714 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-01-14 15:09:18,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-01-14 15:09:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 15:09:18,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:18,715 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:18,715 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-01-14 15:09:18,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:18,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:18,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:18,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:18,868 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-01-14 15:09:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:19,262 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-01-14 15:09:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:19,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-01-14 15:09:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:19,266 INFO L225 Difference]: With dead ends: 497 [2019-01-14 15:09:19,266 INFO L226 Difference]: Without dead ends: 282 [2019-01-14 15:09:19,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-14 15:09:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-01-14 15:09:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 15:09:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-01-14 15:09:19,274 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-01-14 15:09:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:19,274 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-01-14 15:09:19,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-01-14 15:09:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 15:09:19,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:19,276 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:19,276 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-01-14 15:09:19,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:19,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:19,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:19,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:19,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:19,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:19,635 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-01-14 15:09:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:20,150 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-01-14 15:09:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:20,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-01-14 15:09:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:20,154 INFO L225 Difference]: With dead ends: 495 [2019-01-14 15:09:20,154 INFO L226 Difference]: Without dead ends: 280 [2019-01-14 15:09:20,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-14 15:09:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-01-14 15:09:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 15:09:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-01-14 15:09:20,163 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-01-14 15:09:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:20,163 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-01-14 15:09:20,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-01-14 15:09:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 15:09:20,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:20,166 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:20,167 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:20,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:20,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-01-14 15:09:20,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:20,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:20,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:20,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:20,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:20,536 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-01-14 15:09:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:21,250 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-01-14 15:09:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:21,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-01-14 15:09:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:21,254 INFO L225 Difference]: With dead ends: 494 [2019-01-14 15:09:21,254 INFO L226 Difference]: Without dead ends: 279 [2019-01-14 15:09:21,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-14 15:09:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-01-14 15:09:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-14 15:09:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-01-14 15:09:21,264 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-01-14 15:09:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:21,264 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-01-14 15:09:21,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-01-14 15:09:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 15:09:21,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:21,268 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:21,268 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-01-14 15:09:21,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:21,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:21,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 15:09:21,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:21,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:09:21,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:09:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:09:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:21,438 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-01-14 15:09:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:22,386 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-01-14 15:09:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:09:22,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-01-14 15:09:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:22,389 INFO L225 Difference]: With dead ends: 470 [2019-01-14 15:09:22,389 INFO L226 Difference]: Without dead ends: 255 [2019-01-14 15:09:22,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:09:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-14 15:09:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-01-14 15:09:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-01-14 15:09:22,398 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-01-14 15:09:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:22,398 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-01-14 15:09:22,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:09:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-01-14 15:09:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 15:09:22,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:22,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:22,399 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-01-14 15:09:22,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:22,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:22,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:22,746 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-01-14 15:09:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:23,086 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-01-14 15:09:23,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:23,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-01-14 15:09:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:23,089 INFO L225 Difference]: With dead ends: 512 [2019-01-14 15:09:23,090 INFO L226 Difference]: Without dead ends: 277 [2019-01-14 15:09:23,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-14 15:09:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-01-14 15:09:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-01-14 15:09:23,099 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-01-14 15:09:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-01-14 15:09:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-01-14 15:09:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 15:09:23,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:23,100 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:23,101 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-01-14 15:09:23,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:23,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:23,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:23,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:23,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:23,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:23,437 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-01-14 15:09:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:24,241 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-01-14 15:09:24,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:24,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-01-14 15:09:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:24,245 INFO L225 Difference]: With dead ends: 511 [2019-01-14 15:09:24,245 INFO L226 Difference]: Without dead ends: 276 [2019-01-14 15:09:24,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-14 15:09:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-01-14 15:09:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-01-14 15:09:24,254 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-01-14 15:09:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:24,254 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-01-14 15:09:24,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-01-14 15:09:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 15:09:24,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:24,258 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:24,258 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:24,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:24,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-01-14 15:09:24,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:24,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:24,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:24,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:24,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:24,595 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-01-14 15:09:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:25,173 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-01-14 15:09:25,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:25,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-14 15:09:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:25,177 INFO L225 Difference]: With dead ends: 534 [2019-01-14 15:09:25,177 INFO L226 Difference]: Without dead ends: 299 [2019-01-14 15:09:25,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-14 15:09:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-01-14 15:09:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-01-14 15:09:25,186 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-01-14 15:09:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:25,186 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-01-14 15:09:25,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-01-14 15:09:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 15:09:25,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:25,187 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:25,187 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-01-14 15:09:25,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:25,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:25,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:25,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:25,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:25,533 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-01-14 15:09:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:26,042 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-01-14 15:09:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:26,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-14 15:09:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:26,045 INFO L225 Difference]: With dead ends: 511 [2019-01-14 15:09:26,045 INFO L226 Difference]: Without dead ends: 276 [2019-01-14 15:09:26,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-14 15:09:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-01-14 15:09:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-01-14 15:09:26,057 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-01-14 15:09:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:26,057 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-01-14 15:09:26,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-01-14 15:09:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 15:09:26,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:26,058 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:26,059 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-01-14 15:09:26,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:26,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:26,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:26,529 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 15:09:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:26,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:26,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:26,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:26,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:26,602 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-01-14 15:09:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:27,549 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-01-14 15:09:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:27,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-14 15:09:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:27,552 INFO L225 Difference]: With dead ends: 534 [2019-01-14 15:09:27,553 INFO L226 Difference]: Without dead ends: 299 [2019-01-14 15:09:27,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-14 15:09:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-01-14 15:09:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-01-14 15:09:27,564 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-01-14 15:09:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:27,564 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-01-14 15:09:27,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-01-14 15:09:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 15:09:27,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:27,565 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:27,565 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-01-14 15:09:27,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:27,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:27,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:27,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:27,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:27,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:27,716 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-01-14 15:09:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:28,019 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-01-14 15:09:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:28,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-14 15:09:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:28,023 INFO L225 Difference]: With dead ends: 511 [2019-01-14 15:09:28,023 INFO L226 Difference]: Without dead ends: 276 [2019-01-14 15:09:28,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-14 15:09:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-01-14 15:09:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-01-14 15:09:28,031 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-01-14 15:09:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:28,031 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-01-14 15:09:28,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-01-14 15:09:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:09:28,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:28,032 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:28,032 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:28,033 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-01-14 15:09:28,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:28,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:28,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:28,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:28,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:28,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:28,413 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-01-14 15:09:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:29,036 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-01-14 15:09:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:29,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:09:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:29,039 INFO L225 Difference]: With dead ends: 534 [2019-01-14 15:09:29,039 INFO L226 Difference]: Without dead ends: 299 [2019-01-14 15:09:29,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-14 15:09:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-01-14 15:09:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-01-14 15:09:29,049 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-01-14 15:09:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:29,049 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-01-14 15:09:29,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-01-14 15:09:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 15:09:29,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:29,052 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:29,053 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-01-14 15:09:29,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:29,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:29,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:29,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:29,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:29,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:29,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:29,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:29,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:29,175 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-01-14 15:09:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:29,503 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-01-14 15:09:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:29,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-14 15:09:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:29,506 INFO L225 Difference]: With dead ends: 511 [2019-01-14 15:09:29,507 INFO L226 Difference]: Without dead ends: 276 [2019-01-14 15:09:29,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-14 15:09:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-01-14 15:09:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-01-14 15:09:29,516 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-01-14 15:09:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:29,516 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-01-14 15:09:29,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-01-14 15:09:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:09:29,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:29,520 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:29,521 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:29,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:29,521 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-01-14 15:09:29,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:29,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:29,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:29,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:29,940 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 15:09:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:30,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:30,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:30,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:30,001 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-01-14 15:09:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:30,448 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-01-14 15:09:30,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:30,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:09:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:30,451 INFO L225 Difference]: With dead ends: 524 [2019-01-14 15:09:30,451 INFO L226 Difference]: Without dead ends: 289 [2019-01-14 15:09:30,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-14 15:09:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-01-14 15:09:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-01-14 15:09:30,462 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-01-14 15:09:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:30,463 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-01-14 15:09:30,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-01-14 15:09:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 15:09:30,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:30,467 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:30,467 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-01-14 15:09:30,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:30,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:30,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:30,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:30,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:30,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:30,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:30,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:30,664 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-01-14 15:09:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:30,982 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-01-14 15:09:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:30,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 15:09:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:30,985 INFO L225 Difference]: With dead ends: 501 [2019-01-14 15:09:30,985 INFO L226 Difference]: Without dead ends: 266 [2019-01-14 15:09:30,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-14 15:09:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-01-14 15:09:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-01-14 15:09:30,994 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-01-14 15:09:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:30,994 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-01-14 15:09:30,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-01-14 15:09:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 15:09:30,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:30,998 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:30,999 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-01-14 15:09:30,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:30,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:31,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:31,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:31,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:09:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:31,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:31,297 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-01-14 15:09:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:32,461 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-01-14 15:09:32,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:32,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-14 15:09:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:32,466 INFO L225 Difference]: With dead ends: 524 [2019-01-14 15:09:32,466 INFO L226 Difference]: Without dead ends: 289 [2019-01-14 15:09:32,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-14 15:09:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-01-14 15:09:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 15:09:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-01-14 15:09:32,475 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-01-14 15:09:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:32,478 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-01-14 15:09:32,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-01-14 15:09:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 15:09:32,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:32,481 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:32,482 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-01-14 15:09:32,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:32,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:32,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:32,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 15:09:32,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:32,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:09:32,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:09:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:09:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:09:32,609 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-01-14 15:09:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:32,729 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-01-14 15:09:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:09:32,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-14 15:09:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:32,734 INFO L225 Difference]: With dead ends: 722 [2019-01-14 15:09:32,734 INFO L226 Difference]: Without dead ends: 487 [2019-01-14 15:09:32,735 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-14 15:09:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-01-14 15:09:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-01-14 15:09:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 15:09:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-01-14 15:09:32,751 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-01-14 15:09:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:32,751 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-01-14 15:09:32,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:09:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-01-14 15:09:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:09:32,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:32,755 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:32,755 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-01-14 15:09:32,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:32,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:32,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:32,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:32,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:09:32,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:32,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:09:32,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:09:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:09:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:09:32,849 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-01-14 15:09:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:33,036 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-01-14 15:09:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:09:33,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 15:09:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:33,040 INFO L225 Difference]: With dead ends: 1190 [2019-01-14 15:09:33,040 INFO L226 Difference]: Without dead ends: 722 [2019-01-14 15:09:33,041 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-14 15:09:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-01-14 15:09:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-01-14 15:09:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 15:09:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-01-14 15:09:33,064 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-01-14 15:09:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:33,065 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-01-14 15:09:33,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:09:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-01-14 15:09:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 15:09:33,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:33,069 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:33,069 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-01-14 15:09:33,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:09:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:09:33,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:09:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:09:33,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:09:33,175 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-01-14 15:09:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:33,375 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-01-14 15:09:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:09:33,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 15:09:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:33,380 INFO L225 Difference]: With dead ends: 1656 [2019-01-14 15:09:33,381 INFO L226 Difference]: Without dead ends: 955 [2019-01-14 15:09:33,383 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-14 15:09:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-01-14 15:09:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-01-14 15:09:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-01-14 15:09:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-01-14 15:09:33,419 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-01-14 15:09:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:33,419 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-01-14 15:09:33,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:09:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-01-14 15:09:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 15:09:33,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:33,424 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-14 15:09:33,424 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2019-01-14 15:09:33,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:33,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:09:33,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:33,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:09:33,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:09:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:09:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:09:33,540 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-01-14 15:09:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:33,918 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-01-14 15:09:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:09:33,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 15:09:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:33,925 INFO L225 Difference]: With dead ends: 2120 [2019-01-14 15:09:33,925 INFO L226 Difference]: Without dead ends: 1186 [2019-01-14 15:09:33,927 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-14 15:09:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-01-14 15:09:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-01-14 15:09:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-01-14 15:09:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-01-14 15:09:33,963 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-01-14 15:09:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:33,963 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-01-14 15:09:33,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:09:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-01-14 15:09:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-14 15:09:33,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:33,994 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:33,998 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-01-14 15:09:33,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:33,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:34,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:34,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:34,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:09:34,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:34,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:09:34,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:09:34,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:09:34,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:09:34,077 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-01-14 15:09:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:34,235 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-01-14 15:09:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:09:34,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-01-14 15:09:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:34,242 INFO L225 Difference]: With dead ends: 1423 [2019-01-14 15:09:34,242 INFO L226 Difference]: Without dead ends: 1421 [2019-01-14 15:09:34,243 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-14 15:09:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-01-14 15:09:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-01-14 15:09:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-01-14 15:09:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-01-14 15:09:34,275 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-01-14 15:09:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:34,276 INFO L480 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-01-14 15:09:34,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:09:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-01-14 15:09:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-14 15:09:34,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:34,279 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:34,279 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-01-14 15:09:34,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:34,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:34,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:34,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:09:34,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:09:34,936 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-14 15:09:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:35,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:09:35,507 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 15:09:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:35,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2019-01-14 15:09:35,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-14 15:09:35,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:35,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:35,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:35,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 15:09:35,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:35,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:35,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,336 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,342 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,383 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,388 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:36,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2019-01-14 15:09:36,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2019-01-14 15:09:36,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 54 [2019-01-14 15:09:36,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-14 15:09:36,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 98 [2019-01-14 15:09:36,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 132 [2019-01-14 15:09:36,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 117 [2019-01-14 15:09:36,679 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,710 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,734 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,755 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,779 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,795 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,808 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:36,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2019-01-14 15:09:36,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2019-01-14 15:09:36,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 54 [2019-01-14 15:09:36,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-14 15:09:36,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:36,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,026 INFO L303 Elim1Store]: Index analysis took 139 ms [2019-01-14 15:09:37,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-01-14 15:09:37,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 156 [2019-01-14 15:09:37,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 149 [2019-01-14 15:09:37,115 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,146 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,164 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,178 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,190 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,201 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,212 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,247 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 13 variables, input treesize:173, output treesize:65 [2019-01-14 15:09:37,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 15:09:37,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:09:37,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2019-01-14 15:09:37,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2019-01-14 15:09:37,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-01-14 15:09:37,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 15:09:37,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:09:37,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2019-01-14 15:09:37,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2019-01-14 15:09:37,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-01-14 15:09:37,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2019-01-14 15:09:37,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2019-01-14 15:09:37,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2019-01-14 15:09:37,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,911 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-14 15:09:37,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2019-01-14 15:09:37,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:37,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 15:09:37,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:37,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:09:37,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 15:09:38,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:09:38,077 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,084 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,098 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-01-14 15:09:38,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2019-01-14 15:09:38,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,283 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-14 15:09:38,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2019-01-14 15:09:38,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 15:09:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:09:38,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-01-14 15:09:38,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 15:09:38,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:09:38,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2019-01-14 15:09:38,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2019-01-14 15:09:38,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-01-14 15:09:38,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 148 [2019-01-14 15:09:38,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-14 15:09:38,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 125 [2019-01-14 15:09:38,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-14 15:09:38,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:163, output treesize:143 [2019-01-14 15:09:38,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 130 [2019-01-14 15:09:38,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 112 [2019-01-14 15:09:38,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 133 [2019-01-14 15:09:38,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:38,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 179 [2019-01-14 15:09:38,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:38,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 130 [2019-01-14 15:09:39,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 112 [2019-01-14 15:09:39,046 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 133 [2019-01-14 15:09:39,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 179 [2019-01-14 15:09:39,172 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,207 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,273 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:219, output treesize:143 [2019-01-14 15:09:39,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 130 [2019-01-14 15:09:39,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 112 [2019-01-14 15:09:39,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:09:39,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:09:39,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 133 [2019-01-14 15:09:39,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 179 [2019-01-14 15:09:39,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,553 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:194, output treesize:152 [2019-01-14 15:09:39,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2019-01-14 15:09:39,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-14 15:09:39,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 132 [2019-01-14 15:09:39,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2019-01-14 15:09:39,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2019-01-14 15:09:39,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:39,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:39,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2019-01-14 15:09:39,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-14 15:09:39,796 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:39,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 15:09:39,822 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:39,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:39,853 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:183, output treesize:29 [2019-01-14 15:09:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-14 15:09:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:09:39,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:09:39,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:09:39,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:09:39,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-01-14 15:09:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 78 proven. 82 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:09:40,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:09:40,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-01-14 15:09:40,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 15:09:40,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 15:09:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-01-14 15:09:40,492 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 16 states. [2019-01-14 15:09:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:49,373 INFO L93 Difference]: Finished difference Result 6768 states and 10080 transitions. [2019-01-14 15:09:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 15:09:49,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2019-01-14 15:09:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:49,397 INFO L225 Difference]: With dead ends: 6768 [2019-01-14 15:09:49,397 INFO L226 Difference]: Without dead ends: 5368 [2019-01-14 15:09:49,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 159 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2019-01-14 15:09:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2019-01-14 15:09:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 3081. [2019-01-14 15:09:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-01-14 15:09:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4683 transitions. [2019-01-14 15:09:49,567 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4683 transitions. Word has length 164 [2019-01-14 15:09:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:49,567 INFO L480 AbstractCegarLoop]: Abstraction has 3081 states and 4683 transitions. [2019-01-14 15:09:49,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 15:09:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4683 transitions. [2019-01-14 15:09:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-14 15:09:49,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:49,578 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:49,580 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:49,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2019-01-14 15:09:49,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:49,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:09:49,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:49,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:49,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:49,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:49,956 INFO L87 Difference]: Start difference. First operand 3081 states and 4683 transitions. Second operand 4 states. [2019-01-14 15:09:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:50,470 INFO L93 Difference]: Finished difference Result 6839 states and 10430 transitions. [2019-01-14 15:09:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:50,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-01-14 15:09:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:50,486 INFO L225 Difference]: With dead ends: 6839 [2019-01-14 15:09:50,487 INFO L226 Difference]: Without dead ends: 3777 [2019-01-14 15:09:50,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-01-14 15:09:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3417. [2019-01-14 15:09:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-01-14 15:09:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-01-14 15:09:50,610 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 170 [2019-01-14 15:09:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:50,611 INFO L480 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-01-14 15:09:50,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-01-14 15:09:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-14 15:09:50,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:50,619 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:09:50,619 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2019-01-14 15:09:50,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:50,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:50,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:50,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:50,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-14 15:09:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:51,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:51,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:51,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:51,010 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-01-14 15:09:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:51,907 INFO L93 Difference]: Finished difference Result 7957 states and 12273 transitions. [2019-01-14 15:09:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:51,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-01-14 15:09:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:51,930 INFO L225 Difference]: With dead ends: 7957 [2019-01-14 15:09:51,930 INFO L226 Difference]: Without dead ends: 4559 [2019-01-14 15:09:51,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2019-01-14 15:09:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3885. [2019-01-14 15:09:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-01-14 15:09:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6123 transitions. [2019-01-14 15:09:52,080 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6123 transitions. Word has length 178 [2019-01-14 15:09:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:52,080 INFO L480 AbstractCegarLoop]: Abstraction has 3885 states and 6123 transitions. [2019-01-14 15:09:52,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6123 transitions. [2019-01-14 15:09:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-14 15:09:52,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:52,086 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:09:52,086 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2019-01-14 15:09:52,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:52,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:52,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-14 15:09:52,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:52,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:52,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:52,387 INFO L87 Difference]: Start difference. First operand 3885 states and 6123 transitions. Second operand 4 states. [2019-01-14 15:09:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:53,344 INFO L93 Difference]: Finished difference Result 8375 states and 13050 transitions. [2019-01-14 15:09:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:53,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-01-14 15:09:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:53,356 INFO L225 Difference]: With dead ends: 8375 [2019-01-14 15:09:53,357 INFO L226 Difference]: Without dead ends: 4509 [2019-01-14 15:09:53,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2019-01-14 15:09:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 3765. [2019-01-14 15:09:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-01-14 15:09:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5895 transitions. [2019-01-14 15:09:53,490 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5895 transitions. Word has length 179 [2019-01-14 15:09:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:53,491 INFO L480 AbstractCegarLoop]: Abstraction has 3765 states and 5895 transitions. [2019-01-14 15:09:53,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5895 transitions. [2019-01-14 15:09:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-14 15:09:53,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:53,501 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:09:53,502 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2019-01-14 15:09:53,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:53,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:53,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:53,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-01-14 15:09:53,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:53,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:09:53,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:09:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:09:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:53,726 INFO L87 Difference]: Start difference. First operand 3765 states and 5895 transitions. Second operand 5 states. [2019-01-14 15:09:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:54,440 INFO L93 Difference]: Finished difference Result 9025 states and 14137 transitions. [2019-01-14 15:09:54,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:54,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-01-14 15:09:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:54,451 INFO L225 Difference]: With dead ends: 9025 [2019-01-14 15:09:54,451 INFO L226 Difference]: Without dead ends: 5279 [2019-01-14 15:09:54,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:09:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2019-01-14 15:09:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 4239. [2019-01-14 15:09:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-01-14 15:09:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6753 transitions. [2019-01-14 15:09:54,584 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6753 transitions. Word has length 179 [2019-01-14 15:09:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:54,585 INFO L480 AbstractCegarLoop]: Abstraction has 4239 states and 6753 transitions. [2019-01-14 15:09:54,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:09:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6753 transitions. [2019-01-14 15:09:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-14 15:09:54,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:54,591 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:09:54,591 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2019-01-14 15:09:54,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:54,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:54,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:54,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:54,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-14 15:09:54,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:54,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:54,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:54,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:54,728 INFO L87 Difference]: Start difference. First operand 4239 states and 6753 transitions. Second operand 4 states. [2019-01-14 15:09:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:55,362 INFO L93 Difference]: Finished difference Result 7555 states and 11938 transitions. [2019-01-14 15:09:55,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:55,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-01-14 15:09:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:55,378 INFO L225 Difference]: With dead ends: 7555 [2019-01-14 15:09:55,378 INFO L226 Difference]: Without dead ends: 5381 [2019-01-14 15:09:55,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-01-14 15:09:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4383. [2019-01-14 15:09:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-01-14 15:09:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6957 transitions. [2019-01-14 15:09:55,607 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6957 transitions. Word has length 179 [2019-01-14 15:09:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:55,607 INFO L480 AbstractCegarLoop]: Abstraction has 4383 states and 6957 transitions. [2019-01-14 15:09:55,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6957 transitions. [2019-01-14 15:09:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-14 15:09:55,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:55,619 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:09:55,619 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2019-01-14 15:09:55,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:55,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:09:55,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-14 15:09:55,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:55,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:55,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:55,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:55,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:55,936 INFO L87 Difference]: Start difference. First operand 4383 states and 6957 transitions. Second operand 4 states. [2019-01-14 15:09:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:56,750 INFO L93 Difference]: Finished difference Result 7627 states and 12028 transitions. [2019-01-14 15:09:56,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:56,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-01-14 15:09:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:56,763 INFO L225 Difference]: With dead ends: 7627 [2019-01-14 15:09:56,764 INFO L226 Difference]: Without dead ends: 5381 [2019-01-14 15:09:56,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-01-14 15:09:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4395. [2019-01-14 15:09:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-01-14 15:09:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6969 transitions. [2019-01-14 15:09:57,006 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6969 transitions. Word has length 180 [2019-01-14 15:09:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:57,006 INFO L480 AbstractCegarLoop]: Abstraction has 4395 states and 6969 transitions. [2019-01-14 15:09:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:09:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6969 transitions. [2019-01-14 15:09:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-14 15:09:57,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:57,021 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:09:57,022 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2019-01-14 15:09:57,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:57,259 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-14 15:09:57,471 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 15:09:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-01-14 15:09:57,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:57,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:09:57,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:09:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:09:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:09:57,672 INFO L87 Difference]: Start difference. First operand 4395 states and 6969 transitions. Second operand 5 states. [2019-01-14 15:09:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:09:58,627 INFO L93 Difference]: Finished difference Result 9949 states and 15739 transitions. [2019-01-14 15:09:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:09:58,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-01-14 15:09:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:09:58,638 INFO L225 Difference]: With dead ends: 9949 [2019-01-14 15:09:58,638 INFO L226 Difference]: Without dead ends: 5573 [2019-01-14 15:09:58,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:09:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2019-01-14 15:09:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 4263. [2019-01-14 15:09:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-01-14 15:09:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6789 transitions. [2019-01-14 15:09:58,888 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6789 transitions. Word has length 180 [2019-01-14 15:09:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:09:58,889 INFO L480 AbstractCegarLoop]: Abstraction has 4263 states and 6789 transitions. [2019-01-14 15:09:58,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:09:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6789 transitions. [2019-01-14 15:09:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-14 15:09:58,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:09:58,900 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:09:58,903 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:09:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:09:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2019-01-14 15:09:58,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:09:58,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:09:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:09:58,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:09:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:09:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-14 15:09:59,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:09:59,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:09:59,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:09:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:09:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:09:59,235 INFO L87 Difference]: Start difference. First operand 4263 states and 6789 transitions. Second operand 4 states. [2019-01-14 15:10:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:00,305 INFO L93 Difference]: Finished difference Result 7385 states and 11677 transitions. [2019-01-14 15:10:00,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:00,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-01-14 15:10:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:00,312 INFO L225 Difference]: With dead ends: 7385 [2019-01-14 15:10:00,312 INFO L226 Difference]: Without dead ends: 5199 [2019-01-14 15:10:00,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2019-01-14 15:10:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4275. [2019-01-14 15:10:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-01-14 15:10:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6801 transitions. [2019-01-14 15:10:00,459 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6801 transitions. Word has length 181 [2019-01-14 15:10:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:00,459 INFO L480 AbstractCegarLoop]: Abstraction has 4275 states and 6801 transitions. [2019-01-14 15:10:00,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6801 transitions. [2019-01-14 15:10:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 15:10:00,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:00,466 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 15:10:00,466 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2019-01-14 15:10:00,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:00,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:00,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:00,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:00,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-14 15:10:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:00,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:00,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:00,688 INFO L87 Difference]: Start difference. First operand 4275 states and 6801 transitions. Second operand 4 states. [2019-01-14 15:10:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:01,325 INFO L93 Difference]: Finished difference Result 7331 states and 11599 transitions. [2019-01-14 15:10:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:01,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-01-14 15:10:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:01,332 INFO L225 Difference]: With dead ends: 7331 [2019-01-14 15:10:01,332 INFO L226 Difference]: Without dead ends: 5139 [2019-01-14 15:10:01,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-01-14 15:10:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4287. [2019-01-14 15:10:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-01-14 15:10:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6813 transitions. [2019-01-14 15:10:01,522 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6813 transitions. Word has length 182 [2019-01-14 15:10:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 4287 states and 6813 transitions. [2019-01-14 15:10:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6813 transitions. [2019-01-14 15:10:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-14 15:10:01,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:01,528 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:01,529 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2019-01-14 15:10:01,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:01,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:01,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:01,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:01,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:01,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:01,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:01,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:01,870 INFO L87 Difference]: Start difference. First operand 4287 states and 6813 transitions. Second operand 4 states. [2019-01-14 15:10:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:02,564 INFO L93 Difference]: Finished difference Result 8903 states and 14078 transitions. [2019-01-14 15:10:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:02,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-01-14 15:10:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:02,570 INFO L225 Difference]: With dead ends: 8903 [2019-01-14 15:10:02,570 INFO L226 Difference]: Without dead ends: 4635 [2019-01-14 15:10:02,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-01-14 15:10:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-01-14 15:10:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-01-14 15:10:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6801 transitions. [2019-01-14 15:10:02,715 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6801 transitions. Word has length 184 [2019-01-14 15:10:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:02,715 INFO L480 AbstractCegarLoop]: Abstraction has 4287 states and 6801 transitions. [2019-01-14 15:10:02,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6801 transitions. [2019-01-14 15:10:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-14 15:10:02,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:02,722 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:02,722 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2019-01-14 15:10:02,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:02,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:03,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:03,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:03,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:03,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:03,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:03,058 INFO L87 Difference]: Start difference. First operand 4287 states and 6801 transitions. Second operand 4 states. [2019-01-14 15:10:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:03,642 INFO L93 Difference]: Finished difference Result 6833 states and 10743 transitions. [2019-01-14 15:10:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:03,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-01-14 15:10:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:03,648 INFO L225 Difference]: With dead ends: 6833 [2019-01-14 15:10:03,649 INFO L226 Difference]: Without dead ends: 4635 [2019-01-14 15:10:03,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-01-14 15:10:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-01-14 15:10:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-01-14 15:10:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6789 transitions. [2019-01-14 15:10:03,797 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6789 transitions. Word has length 185 [2019-01-14 15:10:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:03,797 INFO L480 AbstractCegarLoop]: Abstraction has 4287 states and 6789 transitions. [2019-01-14 15:10:03,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6789 transitions. [2019-01-14 15:10:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-14 15:10:03,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:03,803 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:03,803 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2019-01-14 15:10:03,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:03,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:03,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:04,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:04,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:04,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:04,015 INFO L87 Difference]: Start difference. First operand 4287 states and 6789 transitions. Second operand 4 states. [2019-01-14 15:10:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:04,586 INFO L93 Difference]: Finished difference Result 6833 states and 10725 transitions. [2019-01-14 15:10:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:04,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-01-14 15:10:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:04,594 INFO L225 Difference]: With dead ends: 6833 [2019-01-14 15:10:04,594 INFO L226 Difference]: Without dead ends: 4635 [2019-01-14 15:10:04,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-01-14 15:10:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-01-14 15:10:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-01-14 15:10:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6777 transitions. [2019-01-14 15:10:04,794 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6777 transitions. Word has length 186 [2019-01-14 15:10:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:04,794 INFO L480 AbstractCegarLoop]: Abstraction has 4287 states and 6777 transitions. [2019-01-14 15:10:04,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6777 transitions. [2019-01-14 15:10:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-14 15:10:04,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:04,800 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:04,801 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2019-01-14 15:10:04,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:04,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:04,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:05,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:05,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:05,130 INFO L87 Difference]: Start difference. First operand 4287 states and 6777 transitions. Second operand 4 states. [2019-01-14 15:10:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:05,813 INFO L93 Difference]: Finished difference Result 6833 states and 10707 transitions. [2019-01-14 15:10:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:05,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-01-14 15:10:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:05,819 INFO L225 Difference]: With dead ends: 6833 [2019-01-14 15:10:05,819 INFO L226 Difference]: Without dead ends: 4635 [2019-01-14 15:10:05,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-01-14 15:10:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-01-14 15:10:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-01-14 15:10:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6765 transitions. [2019-01-14 15:10:05,967 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6765 transitions. Word has length 187 [2019-01-14 15:10:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:05,968 INFO L480 AbstractCegarLoop]: Abstraction has 4287 states and 6765 transitions. [2019-01-14 15:10:05,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6765 transitions. [2019-01-14 15:10:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-14 15:10:05,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:05,975 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:05,975 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2019-01-14 15:10:05,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:05,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:05,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:06,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:06,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:06,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:06,152 INFO L87 Difference]: Start difference. First operand 4287 states and 6765 transitions. Second operand 4 states. [2019-01-14 15:10:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:06,674 INFO L93 Difference]: Finished difference Result 6773 states and 10617 transitions. [2019-01-14 15:10:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:06,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-01-14 15:10:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:06,680 INFO L225 Difference]: With dead ends: 6773 [2019-01-14 15:10:06,680 INFO L226 Difference]: Without dead ends: 4575 [2019-01-14 15:10:06,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-01-14 15:10:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-01-14 15:10:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-01-14 15:10:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-01-14 15:10:06,841 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 188 [2019-01-14 15:10:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:06,841 INFO L480 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-01-14 15:10:06,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-01-14 15:10:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:10:06,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:06,847 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:06,847 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2019-01-14 15:10:06,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 15:10:06,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:06,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:06,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:06,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:06,974 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-01-14 15:10:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:07,678 INFO L93 Difference]: Finished difference Result 7097 states and 11097 transitions. [2019-01-14 15:10:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:07,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-14 15:10:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:07,683 INFO L225 Difference]: With dead ends: 7097 [2019-01-14 15:10:07,683 INFO L226 Difference]: Without dead ends: 4899 [2019-01-14 15:10:07,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2019-01-14 15:10:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4359. [2019-01-14 15:10:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-01-14 15:10:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6849 transitions. [2019-01-14 15:10:07,839 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6849 transitions. Word has length 192 [2019-01-14 15:10:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:07,840 INFO L480 AbstractCegarLoop]: Abstraction has 4359 states and 6849 transitions. [2019-01-14 15:10:07,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6849 transitions. [2019-01-14 15:10:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:10:07,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:07,845 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:07,845 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2019-01-14 15:10:07,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:07,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:07,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:07,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:08,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:08,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:08,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:08,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:08,028 INFO L87 Difference]: Start difference. First operand 4359 states and 6849 transitions. Second operand 4 states. [2019-01-14 15:10:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:08,581 INFO L93 Difference]: Finished difference Result 8987 states and 14078 transitions. [2019-01-14 15:10:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:08,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-14 15:10:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:08,587 INFO L225 Difference]: With dead ends: 8987 [2019-01-14 15:10:08,587 INFO L226 Difference]: Without dead ends: 4647 [2019-01-14 15:10:08,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2019-01-14 15:10:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4359. [2019-01-14 15:10:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-01-14 15:10:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6837 transitions. [2019-01-14 15:10:08,762 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6837 transitions. Word has length 192 [2019-01-14 15:10:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:08,762 INFO L480 AbstractCegarLoop]: Abstraction has 4359 states and 6837 transitions. [2019-01-14 15:10:08,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6837 transitions. [2019-01-14 15:10:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:10:08,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:08,768 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:08,768 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2019-01-14 15:10:08,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:08,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:08,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:08,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:08,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:08,929 INFO L87 Difference]: Start difference. First operand 4359 states and 6837 transitions. Second operand 4 states. [2019-01-14 15:10:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:09,480 INFO L93 Difference]: Finished difference Result 8987 states and 14054 transitions. [2019-01-14 15:10:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:09,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-14 15:10:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:09,487 INFO L225 Difference]: With dead ends: 8987 [2019-01-14 15:10:09,487 INFO L226 Difference]: Without dead ends: 4647 [2019-01-14 15:10:09,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2019-01-14 15:10:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4359. [2019-01-14 15:10:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-01-14 15:10:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6825 transitions. [2019-01-14 15:10:09,654 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6825 transitions. Word has length 192 [2019-01-14 15:10:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 4359 states and 6825 transitions. [2019-01-14 15:10:09,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6825 transitions. [2019-01-14 15:10:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:10:09,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:09,659 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:09,660 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -383895469, now seen corresponding path program 1 times [2019-01-14 15:10:09,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:09,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:09,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 15:10:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:09,964 INFO L87 Difference]: Start difference. First operand 4359 states and 6825 transitions. Second operand 4 states. [2019-01-14 15:10:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:10,612 INFO L93 Difference]: Finished difference Result 7097 states and 11043 transitions. [2019-01-14 15:10:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:10,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-14 15:10:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:10,620 INFO L225 Difference]: With dead ends: 7097 [2019-01-14 15:10:10,621 INFO L226 Difference]: Without dead ends: 4899 [2019-01-14 15:10:10,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2019-01-14 15:10:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4365. [2019-01-14 15:10:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-01-14 15:10:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6825 transitions. [2019-01-14 15:10:10,864 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6825 transitions. Word has length 193 [2019-01-14 15:10:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:10,864 INFO L480 AbstractCegarLoop]: Abstraction has 4365 states and 6825 transitions. [2019-01-14 15:10:10,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6825 transitions. [2019-01-14 15:10:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:10:10,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:10,869 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:10,870 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2019-01-14 15:10:10,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:10,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:10,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:10:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:10:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:10:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:10:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:10:11,182 INFO L87 Difference]: Start difference. First operand 4365 states and 6825 transitions. Second operand 4 states. [2019-01-14 15:10:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:11,899 INFO L93 Difference]: Finished difference Result 7655 states and 11911 transitions. [2019-01-14 15:10:11,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:10:11,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-14 15:10:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:11,907 INFO L225 Difference]: With dead ends: 7655 [2019-01-14 15:10:11,908 INFO L226 Difference]: Without dead ends: 5457 [2019-01-14 15:10:11,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:10:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2019-01-14 15:10:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 4509. [2019-01-14 15:10:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4509 states. [2019-01-14 15:10:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 7029 transitions. [2019-01-14 15:10:12,091 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 7029 transitions. Word has length 193 [2019-01-14 15:10:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:12,092 INFO L480 AbstractCegarLoop]: Abstraction has 4509 states and 7029 transitions. [2019-01-14 15:10:12,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:10:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 7029 transitions. [2019-01-14 15:10:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:10:12,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:12,099 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:12,099 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-01-14 15:10:12,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:10:12,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:10:12,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:12,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:12,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:10:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:10:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:10:12,518 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:10:12,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:10:12 BoogieIcfgContainer [2019-01-14 15:10:12,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:10:12,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:10:12,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:10:12,729 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:10:12,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:08:57" (3/4) ... [2019-01-14 15:10:12,739 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 15:10:12,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:10:12,742 INFO L168 Benchmark]: Toolchain (without parser) took 78919.92 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 846.2 MB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -319.0 MB). Peak memory consumption was 527.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:10:12,743 INFO L168 Benchmark]: CDTParser took 0.18 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-14 15:10:12,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 948.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:10:12,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:10:12,747 INFO L168 Benchmark]: Boogie Preprocessor took 147.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:10:12,747 INFO L168 Benchmark]: RCFGBuilder took 2148.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:10:12,748 INFO L168 Benchmark]: TraceAbstraction took 75500.84 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 690.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -229.9 MB). Peak memory consumption was 460.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:10:12,748 INFO L168 Benchmark]: Witness Printer took 12.15 ms. Allocated memory is still 1.9 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:10:12,756 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.18 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 948.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 147.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2148.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75500.84 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 690.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -229.9 MB). Peak memory consumption was 460.6 MB. Max. memory is 11.5 GB. * Witness Printer took 12.15 ms. Allocated memory is still 1.9 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-8:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-8:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-8:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-8:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-8:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-8:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-8:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={-8:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={-8:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={-8:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={-8:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-8:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-8:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. UNSAFE Result, 75.4s OverallTime, 66 OverallIterations, 7 TraceHistogramMax, 47.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14143 SDtfs, 5556 SDslu, 21851 SDs, 0 SdLazy, 15454 SolverSat, 914 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 596 GetRequests, 287 SyntacticMatches, 101 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4509occurred in iteration=65, 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: 3.8s AutomataMinimizationTime, 65 MinimizatonAttempts, 15548 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 7490 NumberOfCodeBlocks, 7490 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7231 ConstructedInterpolants, 28 QuantifiedInterpolants, 4478005 SizeOfPredicates, 13 NumberOfNonLiveVariables, 698 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 66 InterpolantComputations, 64 PerfectInterpolantSequences, 7502/7769 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:10:15,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:10:15,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:10:15,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:10:15,267 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:10:15,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:10:15,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:10:15,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:10:15,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:10:15,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:10:15,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:10:15,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:10:15,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:10:15,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:10:15,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:10:15,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:10:15,294 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:10:15,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:10:15,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:10:15,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:10:15,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:10:15,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:10:15,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:10:15,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:10:15,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:10:15,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:10:15,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:10:15,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:10:15,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:10:15,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:10:15,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:10:15,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:10:15,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:10:15,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:10:15,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:10:15,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:10:15,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-14 15:10:15,327 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:10:15,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:10:15,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:10:15,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:10:15,329 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:10:15,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:10:15,329 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:10:15,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:10:15,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:10:15,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:10:15,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:10:15,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:10:15,333 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 15:10:15,333 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 15:10:15,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:10:15,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:10:15,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:10:15,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:10:15,334 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:10:15,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:10:15,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:10:15,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:10:15,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:10:15,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:10:15,335 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:10:15,336 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 15:10:15,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:10:15,336 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 15:10:15,336 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-14 15:10:15,336 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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2019-01-14 15:10:15,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:10:15,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:10:15,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:10:15,389 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:10:15,390 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:10:15,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2019-01-14 15:10:15,447 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63714ca7/c851700c7da74b76ab394a5e14ae38fc/FLAG2a28d3bda [2019-01-14 15:10:16,057 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:10:16,059 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2019-01-14 15:10:16,094 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63714ca7/c851700c7da74b76ab394a5e14ae38fc/FLAG2a28d3bda [2019-01-14 15:10:16,233 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63714ca7/c851700c7da74b76ab394a5e14ae38fc [2019-01-14 15:10:16,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:10:16,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:10:16,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:10:16,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:10:16,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:10:16,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:10:16" (1/1) ... [2019-01-14 15:10:16,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73631881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:16, skipping insertion in model container [2019-01-14 15:10:16,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:10:16" (1/1) ... [2019-01-14 15:10:16,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:10:16,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:10:16,924 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:10:16,945 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:10:17,245 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:10:17,284 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:10:17,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17 WrapperNode [2019-01-14 15:10:17,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:10:17,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:10:17,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:10:17,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:10:17,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:10:17,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:10:17,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:10:17,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:10:17,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (1/1) ... [2019-01-14 15:10:17,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:10:17,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:10:17,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:10:17,590 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:10:17,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (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-14 15:10:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 15:10:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-01-14 15:10:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:10:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:10:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 15:10:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:10:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:10:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:10:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:10:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 15:10:17,993 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 15:10:22,913 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-01-14 15:10:22,913 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-01-14 15:10:22,915 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:10:22,915 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:10:22,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:10:22 BoogieIcfgContainer [2019-01-14 15:10:22,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:10:22,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:10:22,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:10:22,922 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:10:22,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:10:16" (1/3) ... [2019-01-14 15:10:22,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a614b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:10:22, skipping insertion in model container [2019-01-14 15:10:22,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:10:17" (2/3) ... [2019-01-14 15:10:22,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a614b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:10:22, skipping insertion in model container [2019-01-14 15:10:22,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:10:22" (3/3) ... [2019-01-14 15:10:22,926 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2019-01-14 15:10:22,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:10:22,946 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:10:22,964 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:10:22,998 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:10:22,999 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:10:22,999 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:10:22,999 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:10:22,999 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:10:23,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:10:23,000 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:10:23,000 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:10:23,000 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:10:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-01-14 15:10:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 15:10:23,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:23,032 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] [2019-01-14 15:10:23,035 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-01-14 15:10:23,049 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:23,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:23,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:23,300 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-14 15:10:23,300 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:10:23,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:23,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:23,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:23,325 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-01-14 15:10:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:23,829 INFO L93 Difference]: Finished difference Result 425 states and 725 transitions. [2019-01-14 15:10:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:23,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-14 15:10:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:23,858 INFO L225 Difference]: With dead ends: 425 [2019-01-14 15:10:23,860 INFO L226 Difference]: Without dead ends: 259 [2019-01-14 15:10:23,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-14 15:10:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-14 15:10:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-01-14 15:10:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-14 15:10:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 391 transitions. [2019-01-14 15:10:23,972 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 391 transitions. Word has length 35 [2019-01-14 15:10:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:23,973 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 391 transitions. [2019-01-14 15:10:23,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 391 transitions. [2019-01-14 15:10:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 15:10:23,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:23,980 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:23,980 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-01-14 15:10:23,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:23,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:24,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:10:24,250 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:10:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:24,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:24,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:24,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:24,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:24,263 INFO L87 Difference]: Start difference. First operand 259 states and 391 transitions. Second operand 3 states. [2019-01-14 15:10:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:25,098 INFO L93 Difference]: Finished difference Result 508 states and 778 transitions. [2019-01-14 15:10:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:25,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-14 15:10:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:25,103 INFO L225 Difference]: With dead ends: 508 [2019-01-14 15:10:25,103 INFO L226 Difference]: Without dead ends: 381 [2019-01-14 15:10:25,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-14 15:10:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-14 15:10:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2019-01-14 15:10:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-14 15:10:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 572 transitions. [2019-01-14 15:10:25,136 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 572 transitions. Word has length 52 [2019-01-14 15:10:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:25,137 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 572 transitions. [2019-01-14 15:10:25,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 572 transitions. [2019-01-14 15:10:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 15:10:25,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:25,143 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:25,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:25,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-01-14 15:10:25,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:25,145 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:25,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:25,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 15:10:25,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:10:25,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:25,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:25,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:25,404 INFO L87 Difference]: Start difference. First operand 381 states and 572 transitions. Second operand 3 states. [2019-01-14 15:10:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:27,322 INFO L93 Difference]: Finished difference Result 750 states and 1137 transitions. [2019-01-14 15:10:27,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:27,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-14 15:10:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:27,328 INFO L225 Difference]: With dead ends: 750 [2019-01-14 15:10:27,328 INFO L226 Difference]: Without dead ends: 501 [2019-01-14 15:10:27,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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-14 15:10:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-01-14 15:10:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-01-14 15:10:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-14 15:10:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 752 transitions. [2019-01-14 15:10:27,385 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 752 transitions. Word has length 74 [2019-01-14 15:10:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:27,386 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 752 transitions. [2019-01-14 15:10:27,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 752 transitions. [2019-01-14 15:10:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 15:10:27,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:27,392 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:27,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash -389992972, now seen corresponding path program 1 times [2019-01-14 15:10:27,394 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:27,395 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:27,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:27,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:10:27,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2019-01-14 15:10:27,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:27,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:27,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:27,640 INFO L87 Difference]: Start difference. First operand 501 states and 752 transitions. Second operand 3 states. [2019-01-14 15:10:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:28,797 INFO L93 Difference]: Finished difference Result 994 states and 1503 transitions. [2019-01-14 15:10:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:28,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 15:10:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:28,804 INFO L225 Difference]: With dead ends: 994 [2019-01-14 15:10:28,804 INFO L226 Difference]: Without dead ends: 625 [2019-01-14 15:10:28,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-14 15:10:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-01-14 15:10:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-01-14 15:10:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-01-14 15:10:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 936 transitions. [2019-01-14 15:10:28,837 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 936 transitions. Word has length 98 [2019-01-14 15:10:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:28,837 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 936 transitions. [2019-01-14 15:10:28,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 936 transitions. [2019-01-14 15:10:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 15:10:28,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:28,844 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:28,844 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1069422577, now seen corresponding path program 1 times [2019-01-14 15:10:28,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:28,847 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:29,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:10:29,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:10:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:29,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:29,237 INFO L87 Difference]: Start difference. First operand 625 states and 936 transitions. Second operand 3 states. [2019-01-14 15:10:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:30,937 INFO L93 Difference]: Finished difference Result 1240 states and 1868 transitions. [2019-01-14 15:10:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:30,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-01-14 15:10:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:30,944 INFO L225 Difference]: With dead ends: 1240 [2019-01-14 15:10:30,944 INFO L226 Difference]: Without dead ends: 747 [2019-01-14 15:10:30,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 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-14 15:10:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-01-14 15:10:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-01-14 15:10:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-01-14 15:10:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1117 transitions. [2019-01-14 15:10:30,968 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1117 transitions. Word has length 115 [2019-01-14 15:10:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:30,969 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 1117 transitions. [2019-01-14 15:10:30,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1117 transitions. [2019-01-14 15:10:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-14 15:10:30,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:30,973 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:30,973 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1442794636, now seen corresponding path program 1 times [2019-01-14 15:10:30,975 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:31,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:31,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:10:31,351 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:10:31,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:31,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:31,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:31,356 INFO L87 Difference]: Start difference. First operand 747 states and 1117 transitions. Second operand 3 states. [2019-01-14 15:10:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:32,098 INFO L93 Difference]: Finished difference Result 1485 states and 2232 transitions. [2019-01-14 15:10:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:32,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-01-14 15:10:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:32,105 INFO L225 Difference]: With dead ends: 1485 [2019-01-14 15:10:32,105 INFO L226 Difference]: Without dead ends: 870 [2019-01-14 15:10:32,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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-14 15:10:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-01-14 15:10:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-01-14 15:10:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-01-14 15:10:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1300 transitions. [2019-01-14 15:10:32,132 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1300 transitions. Word has length 127 [2019-01-14 15:10:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:32,133 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1300 transitions. [2019-01-14 15:10:32,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1300 transitions. [2019-01-14 15:10:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 15:10:32,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:32,139 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:10:32,140 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash -75487929, now seen corresponding path program 1 times [2019-01-14 15:10:32,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:32,144 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:32,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:32,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 15:10:32,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:10:32,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:10:32,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:10:32,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:10:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:10:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:10:32,623 INFO L87 Difference]: Start difference. First operand 870 states and 1300 transitions. Second operand 3 states. [2019-01-14 15:10:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:10:33,354 INFO L93 Difference]: Finished difference Result 1729 states and 2593 transitions. [2019-01-14 15:10:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:10:33,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-14 15:10:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:10:33,362 INFO L225 Difference]: With dead ends: 1729 [2019-01-14 15:10:33,362 INFO L226 Difference]: Without dead ends: 991 [2019-01-14 15:10:33,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-14 15:10:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-01-14 15:10:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 989. [2019-01-14 15:10:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-01-14 15:10:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1478 transitions. [2019-01-14 15:10:33,392 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1478 transitions. Word has length 158 [2019-01-14 15:10:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:10:33,392 INFO L480 AbstractCegarLoop]: Abstraction has 989 states and 1478 transitions. [2019-01-14 15:10:33,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:10:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1478 transitions. [2019-01-14 15:10:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-14 15:10:33,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:10:33,398 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:10:33,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:10:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:10:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-01-14 15:10:33,400 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:10:33,401 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:10:33,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:10:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:10:35,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:10:35,912 WARN L181 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 15:10:36,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,048 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-01-14 15:10:36,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-14 15:10:36,247 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-01-14 15:10:36,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,359 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-14 15:10:36,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 44 [2019-01-14 15:10:36,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:36,596 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-14 15:10:36,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2019-01-14 15:10:36,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:36,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:37,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:38,136 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-14 15:10:38,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2019-01-14 15:10:38,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2019-01-14 15:10:38,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-01-14 15:10:38,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,369 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-14 15:10:38,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-14 15:10:38,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:38,983 INFO L303 Elim1Store]: Index analysis took 609 ms [2019-01-14 15:10:38,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 124 [2019-01-14 15:10:38,986 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:39,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:39,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:39,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:39,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:39,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-01-14 15:10:40,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,195 INFO L303 Elim1Store]: Index analysis took 229 ms [2019-01-14 15:10:40,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 124 [2019-01-14 15:10:40,197 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,296 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-01-14 15:10:40,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,605 INFO L303 Elim1Store]: Index analysis took 146 ms [2019-01-14 15:10:40,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 124 [2019-01-14 15:10:40,608 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,670 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,722 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:109, output treesize:82 [2019-01-14 15:10:40,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:10:40,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:10:40,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:40,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:10:40,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:10:40,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:40,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:10:40,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:10:41,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:10:41,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,234 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-14 15:10:41,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:10:41,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:10:41,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:10:41,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:82 [2019-01-14 15:10:41,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:10:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:10:41,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:10:41,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:10:41,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:41,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:10:41,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:41,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:10:41,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2019-01-14 15:10:42,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:42,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2019-01-14 15:10:42,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:42,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:42,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2019-01-14 15:10:42,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-14 15:10:42,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:42,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:42,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:42,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:109 [2019-01-14 15:10:42,739 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 15:10:42,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:42,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:43,271 INFO L303 Elim1Store]: Index analysis took 223 ms [2019-01-14 15:10:43,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 111 [2019-01-14 15:10:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,449 INFO L303 Elim1Store]: Index analysis took 173 ms [2019-01-14 15:10:43,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 155 [2019-01-14 15:10:43,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:43,641 INFO L303 Elim1Store]: Index analysis took 186 ms [2019-01-14 15:10:43,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 195 [2019-01-14 15:10:43,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:43,775 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:43,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:43,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:43,938 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:147, output treesize:109 [2019-01-14 15:10:44,139 INFO L303 Elim1Store]: Index analysis took 148 ms [2019-01-14 15:10:44,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2019-01-14 15:10:44,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:44,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:44,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:44,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2019-01-14 15:10:44,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:44,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:44,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:10:44,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:10:44,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:44,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:44,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:44,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:118 [2019-01-14 15:10:44,729 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-14 15:10:44,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 113 [2019-01-14 15:10:44,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 15:10:44,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:44,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2019-01-14 15:10:44,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:44,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:44,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-14 15:10:44,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 15:10:44,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:44,921 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:45,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-14 15:10:45,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:10:45,050 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,064 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:45,081 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:151, output treesize:28 [2019-01-14 15:10:45,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-14 15:10:45,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:45,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:45,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:10:45,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:45,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-01-14 15:10:45,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-01-14 15:10:45,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:10:45,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:10:45,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 15:10:45,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:5 [2019-01-14 15:10:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:10:45,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:10:45,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 15:10:45,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2019-01-14 15:10:45,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:45,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:45,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:45,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-01-14 15:10:45,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-01-14 15:10:45,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 15:10:45,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:45,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-01-14 15:10:45,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-14 15:10:45,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:10:46,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:46,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:10:46,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,070 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2019-01-14 15:10:46,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,355 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2019-01-14 15:10:46,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-01-14 15:10:46,466 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:10:46,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2019-01-14 15:10:46,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-01-14 15:10:46,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:46,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-01-14 15:10:47,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-01-14 15:10:47,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,625 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:47,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:109 [2019-01-14 15:10:51,052 WARN L181 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-01-14 15:10:51,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:51,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:51,348 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 15:10:51,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:51,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:51,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-01-14 15:10:51,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:130, output treesize:222 [2019-01-14 15:10:52,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:52,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:52,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 15:10:52,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-01-14 15:10:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:10:53,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:10:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-14 15:10:53,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 15:10:53,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 15:10:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=133, Unknown=1, NotChecked=0, Total=182 [2019-01-14 15:10:53,300 INFO L87 Difference]: Start difference. First operand 989 states and 1478 transitions. Second operand 14 states. [2019-01-14 15:10:57,270 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-14 15:12:03,221 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-14 15:12:08,479 WARN L181 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-01-14 15:12:38,389 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-14 15:12:42,016 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-01-14 15:12:42,848 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-14 15:14:36,121 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-14 15:14:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:14:50,547 INFO L93 Difference]: Finished difference Result 4772 states and 7184 transitions. [2019-01-14 15:14:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 15:14:50,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2019-01-14 15:14:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:14:50,570 INFO L225 Difference]: With dead ends: 4772 [2019-01-14 15:14:50,570 INFO L226 Difference]: Without dead ends: 3791 [2019-01-14 15:14:50,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=129, Invalid=290, Unknown=1, NotChecked=0, Total=420 [2019-01-14 15:14:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2019-01-14 15:14:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 1301. [2019-01-14 15:14:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-01-14 15:14:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2054 transitions. [2019-01-14 15:14:50,681 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2054 transitions. Word has length 164 [2019-01-14 15:14:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:14:50,682 INFO L480 AbstractCegarLoop]: Abstraction has 1301 states and 2054 transitions. [2019-01-14 15:14:50,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 15:14:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2054 transitions. [2019-01-14 15:14:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-14 15:14:50,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:14:50,687 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:14:50,687 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:14:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:14:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 632129532, now seen corresponding path program 1 times [2019-01-14 15:14:50,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:14:50,690 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:14:50,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:14:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:14:52,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:14:52,974 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 15:14:53,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:53,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-14 15:14:53,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:53,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:53,199 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-14 15:14:53,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 44 [2019-01-14 15:14:53,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:53,328 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:14:53,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-14 15:14:53,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:53,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:54,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:54,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:54,875 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:55,419 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:55,474 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:55,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2019-01-14 15:14:55,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2019-01-14 15:14:55,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 54 [2019-01-14 15:14:55,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 84 [2019-01-14 15:14:55,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:55,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 134 [2019-01-14 15:14:56,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,231 INFO L303 Elim1Store]: Index analysis took 239 ms [2019-01-14 15:14:56,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 168 [2019-01-14 15:14:56,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,469 INFO L303 Elim1Store]: Index analysis took 232 ms [2019-01-14 15:14:56,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 165 [2019-01-14 15:14:56,471 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,519 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,554 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,581 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,605 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,625 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,647 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,710 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:109, output treesize:82 [2019-01-14 15:14:56,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:14:56,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:56,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:14:56,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:56,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:14:56,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:14:56,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:14:57,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:14:57,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:57,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:57,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2019-01-14 15:14:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2019-01-14 15:14:57,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,558 INFO L303 Elim1Store]: Index analysis took 137 ms [2019-01-14 15:14:57,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2019-01-14 15:14:57,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,625 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:57,712 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:120, output treesize:82 [2019-01-14 15:14:57,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:14:57,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:57,923 INFO L303 Elim1Store]: Index analysis took 161 ms [2019-01-14 15:14:57,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:14:57,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:14:58,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2019-01-14 15:14:58,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:58,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:58,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:58,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2019-01-14 15:14:58,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-01-14 15:14:58,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2019-01-14 15:14:58,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-14 15:14:58,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:58,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2019-01-14 15:14:58,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:58,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-14 15:14:58,598 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:58,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:58,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:58,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:109 [2019-01-14 15:14:59,012 INFO L303 Elim1Store]: Index analysis took 222 ms [2019-01-14 15:14:59,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2019-01-14 15:14:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:59,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:59,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:59,170 INFO L303 Elim1Store]: Index analysis took 156 ms [2019-01-14 15:14:59,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2019-01-14 15:14:59,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:59,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:59,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2019-01-14 15:14:59,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:59,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:59,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:14:59,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2019-01-14 15:14:59,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:14:59,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:14:59,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:14:59,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:147, output treesize:109 [2019-01-14 15:15:00,137 INFO L303 Elim1Store]: Index analysis took 130 ms [2019-01-14 15:15:00,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2019-01-14 15:15:00,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:00,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:00,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:00,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2019-01-14 15:15:00,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:15:00,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:15:00,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:00,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:118 [2019-01-14 15:15:00,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2019-01-14 15:15:00,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-01-14 15:15:00,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:00,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:00,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2019-01-14 15:15:00,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-14 15:15:00,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 99 [2019-01-14 15:15:00,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 15:15:00,915 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:00,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2019-01-14 15:15:00,958 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:00,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:01,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:01,004 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:151, output treesize:28 [2019-01-14 15:15:01,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-14 15:15:01,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:01,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:01,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:15:01,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:01,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:01,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:01,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-01-14 15:15:01,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-01-14 15:15:01,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 15:15:01,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:01,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:15:01,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:15:01,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:15:01,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:01,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:15:01,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:5 [2019-01-14 15:15:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 64 proven. 98 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 15:15:01,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:15:01,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-01-14 15:15:01,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-01-14 15:15:01,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:01,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:01,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:15:01,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2019-01-14 15:15:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 15:15:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:15:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-01-14 15:15:01,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:15:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:15:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:15:01,773 INFO L87 Difference]: Start difference. First operand 1301 states and 2054 transitions. Second operand 10 states. [2019-01-14 15:16:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:24,478 INFO L93 Difference]: Finished difference Result 5780 states and 8990 transitions. [2019-01-14 15:16:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 15:16:24,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2019-01-14 15:16:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:24,499 INFO L225 Difference]: With dead ends: 5780 [2019-01-14 15:16:24,500 INFO L226 Difference]: Without dead ends: 4487 [2019-01-14 15:16:24,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:16:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2019-01-14 15:16:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 1621. [2019-01-14 15:16:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2019-01-14 15:16:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2646 transitions. [2019-01-14 15:16:24,645 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2646 transitions. Word has length 165 [2019-01-14 15:16:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:24,645 INFO L480 AbstractCegarLoop]: Abstraction has 1621 states and 2646 transitions. [2019-01-14 15:16:24,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:16:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2646 transitions. [2019-01-14 15:16:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-14 15:16:24,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:24,652 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:24,652 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash -329499811, now seen corresponding path program 1 times [2019-01-14 15:16:24,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:16:24,653 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:16:24,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:27,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:16:27,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:16:27,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:16:27,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:27,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:27,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:27,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,781 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:16:27,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:16:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:27,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:16:27,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:27,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:16:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:16:27,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:16:27,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:27,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:16:27,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:16:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:16:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:27,873 INFO L87 Difference]: Start difference. First operand 1621 states and 2646 transitions. Second operand 5 states. [2019-01-14 15:16:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:39,847 INFO L93 Difference]: Finished difference Result 4005 states and 6447 transitions. [2019-01-14 15:16:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:16:39,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-01-14 15:16:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:39,858 INFO L225 Difference]: With dead ends: 4005 [2019-01-14 15:16:39,858 INFO L226 Difference]: Without dead ends: 2392 [2019-01-14 15:16:39,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:16:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-01-14 15:16:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1949. [2019-01-14 15:16:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-14 15:16:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3238 transitions. [2019-01-14 15:16:40,018 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3238 transitions. Word has length 170 [2019-01-14 15:16:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:40,018 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 3238 transitions. [2019-01-14 15:16:40,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:16:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3238 transitions. [2019-01-14 15:16:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-14 15:16:40,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:40,029 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:40,029 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash 449764481, now seen corresponding path program 1 times [2019-01-14 15:16:40,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:16:40,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:16:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:43,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:16:43,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:16:43,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:16:43,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:43,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:43,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:43,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:16:43,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:16:43,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:43,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:16:43,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:43,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:16:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 15:16:43,315 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:16:43,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:16:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:16:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:16:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:16:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:16:43,327 INFO L87 Difference]: Start difference. First operand 1949 states and 3238 transitions. Second operand 5 states. [2019-01-14 15:16:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:16:56,034 INFO L93 Difference]: Finished difference Result 4325 states and 7023 transitions. [2019-01-14 15:16:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:16:56,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-01-14 15:16:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:16:56,045 INFO L225 Difference]: With dead ends: 4325 [2019-01-14 15:16:56,045 INFO L226 Difference]: Without dead ends: 2384 [2019-01-14 15:16:56,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:16:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2019-01-14 15:16:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1957. [2019-01-14 15:16:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2019-01-14 15:16:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3246 transitions. [2019-01-14 15:16:56,202 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3246 transitions. Word has length 171 [2019-01-14 15:16:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:16:56,202 INFO L480 AbstractCegarLoop]: Abstraction has 1957 states and 3246 transitions. [2019-01-14 15:16:56,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:16:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3246 transitions. [2019-01-14 15:16:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-14 15:16:56,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:16:56,209 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:16:56,209 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:16:56,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:16:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1432010198, now seen corresponding path program 1 times [2019-01-14 15:16:56,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:16:56,211 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:16:56,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:16:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:16:59,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:16:59,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:16:59,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:16:59,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:59,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:59,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:16:59,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,805 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:16:59,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:16:59,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:16:59,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:16:59,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:16:59,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:16:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 195 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:16:59,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:17:00,053 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:17:00,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:00,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:00,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:17:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:17:00,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:17:00,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:17:00,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:17:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:17:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:17:00,081 INFO L87 Difference]: Start difference. First operand 1957 states and 3246 transitions. Second operand 7 states. [2019-01-14 15:17:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:17:14,000 INFO L93 Difference]: Finished difference Result 5247 states and 8397 transitions. [2019-01-14 15:17:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:17:14,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 183 [2019-01-14 15:17:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:17:14,013 INFO L225 Difference]: With dead ends: 5247 [2019-01-14 15:17:14,014 INFO L226 Difference]: Without dead ends: 3298 [2019-01-14 15:17:14,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:17:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-01-14 15:17:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 2085. [2019-01-14 15:17:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-01-14 15:17:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3438 transitions. [2019-01-14 15:17:14,159 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3438 transitions. Word has length 183 [2019-01-14 15:17:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:17:14,159 INFO L480 AbstractCegarLoop]: Abstraction has 2085 states and 3438 transitions. [2019-01-14 15:17:14,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:17:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3438 transitions. [2019-01-14 15:17:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-14 15:17:14,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:17:14,165 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:17:14,165 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:17:14,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:17:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash 269583330, now seen corresponding path program 1 times [2019-01-14 15:17:14,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:17:14,166 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:17:14,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:17:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:17:14,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:17:14,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-01-14 15:17:14,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2019-01-14 15:17:14,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:17:14,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:17:14,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-01-14 15:17:14,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-01-14 15:17:14,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:17:14,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:17:14,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:14,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2019-01-14 15:17:14,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:14,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2019-01-14 15:17:14,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:17:15,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:17:15,046 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,076 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,098 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,126 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-01-14 15:17:15,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:17:15,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-14 15:17:15,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:15,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 15:17:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-01-14 15:17:15,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:17:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:17:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:17:15,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:17:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:17:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:17:15,443 INFO L87 Difference]: Start difference. First operand 2085 states and 3438 transitions. Second operand 4 states. [2019-01-14 15:17:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:17:22,960 INFO L93 Difference]: Finished difference Result 4805 states and 7815 transitions. [2019-01-14 15:17:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:17:22,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-01-14 15:17:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:17:22,972 INFO L225 Difference]: With dead ends: 4805 [2019-01-14 15:17:22,972 INFO L226 Difference]: Without dead ends: 2728 [2019-01-14 15:17:22,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:17:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2019-01-14 15:17:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2285. [2019-01-14 15:17:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2019-01-14 15:17:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3814 transitions. [2019-01-14 15:17:23,092 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3814 transitions. Word has length 184 [2019-01-14 15:17:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:17:23,093 INFO L480 AbstractCegarLoop]: Abstraction has 2285 states and 3814 transitions. [2019-01-14 15:17:23,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:17:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3814 transitions. [2019-01-14 15:17:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-14 15:17:23,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:17:23,099 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:17:23,099 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:17:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:17:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -872604713, now seen corresponding path program 1 times [2019-01-14 15:17:23,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:17:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:17:23,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:17:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:17:26,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:17:26,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:17:26,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:17:26,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:26,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:26,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:17:26,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,668 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:17:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:17:26,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:26,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:17:26,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:17:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 201 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:17:26,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:17:26,752 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:17:26,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:26,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:17:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:17:26,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:17:26,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:17:26,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:17:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:17:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:17:26,780 INFO L87 Difference]: Start difference. First operand 2285 states and 3814 transitions. Second operand 7 states. [2019-01-14 15:17:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:17:40,417 INFO L93 Difference]: Finished difference Result 5567 states and 8933 transitions. [2019-01-14 15:17:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:17:40,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-01-14 15:17:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:17:40,434 INFO L225 Difference]: With dead ends: 5567 [2019-01-14 15:17:40,434 INFO L226 Difference]: Without dead ends: 3290 [2019-01-14 15:17:40,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:17:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2019-01-14 15:17:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2285. [2019-01-14 15:17:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2019-01-14 15:17:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3782 transitions. [2019-01-14 15:17:40,588 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3782 transitions. Word has length 184 [2019-01-14 15:17:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:17:40,588 INFO L480 AbstractCegarLoop]: Abstraction has 2285 states and 3782 transitions. [2019-01-14 15:17:40,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:17:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3782 transitions. [2019-01-14 15:17:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-14 15:17:40,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:17:40,593 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:17:40,594 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:17:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:17:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1410261865, now seen corresponding path program 1 times [2019-01-14 15:17:40,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:17:40,596 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:17:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:17:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:17:41,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:17:41,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:17:41,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:17:41,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:41,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:41,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:41,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-14 15:17:41,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:17:41,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-14 15:17:41,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:41,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:41,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:41,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 15:17:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-14 15:17:41,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:17:41,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:17:41,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:17:41,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:17:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:17:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:17:41,291 INFO L87 Difference]: Start difference. First operand 2285 states and 3782 transitions. Second operand 4 states. [2019-01-14 15:17:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:17:48,369 INFO L93 Difference]: Finished difference Result 5324 states and 8694 transitions. [2019-01-14 15:17:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:17:48,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-01-14 15:17:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:17:48,385 INFO L225 Difference]: With dead ends: 5324 [2019-01-14 15:17:48,385 INFO L226 Difference]: Without dead ends: 3047 [2019-01-14 15:17:48,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:17:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2019-01-14 15:17:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 2420. [2019-01-14 15:17:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-14 15:17:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3997 transitions. [2019-01-14 15:17:48,520 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3997 transitions. Word has length 184 [2019-01-14 15:17:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:17:48,520 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 3997 transitions. [2019-01-14 15:17:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:17:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3997 transitions. [2019-01-14 15:17:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-14 15:17:48,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:17:48,524 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:17:48,524 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:17:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:17:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1841472668, now seen corresponding path program 1 times [2019-01-14 15:17:48,525 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:17:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:17:48,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:17:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:17:49,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:17:49,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:49,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2019-01-14 15:17:49,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:17:49,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2019-01-14 15:17:49,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:17:49,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:17:49,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-01-14 15:17:49,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:17:49,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-14 15:17:49,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:17:49,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 15:17:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-01-14 15:17:49,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:17:49,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:17:49,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:17:49,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:17:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:17:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:17:49,284 INFO L87 Difference]: Start difference. First operand 2420 states and 3997 transitions. Second operand 4 states. [2019-01-14 15:17:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:17:56,835 INFO L93 Difference]: Finished difference Result 5467 states and 8909 transitions. [2019-01-14 15:17:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:17:56,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-01-14 15:17:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:17:56,844 INFO L225 Difference]: With dead ends: 5467 [2019-01-14 15:17:56,845 INFO L226 Difference]: Without dead ends: 3055 [2019-01-14 15:17:56,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:17:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-01-14 15:17:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2420. [2019-01-14 15:17:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-14 15:17:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3997 transitions. [2019-01-14 15:17:56,970 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3997 transitions. Word has length 185 [2019-01-14 15:17:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:17:56,971 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 3997 transitions. [2019-01-14 15:17:56,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:17:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3997 transitions. [2019-01-14 15:17:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-14 15:17:56,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:17:56,975 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:17:56,975 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:17:56,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:17:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1221446918, now seen corresponding path program 1 times [2019-01-14 15:17:56,976 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:17:56,976 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:17:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:18:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:18:02,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:18:02,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:18:02,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:18:02,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:02,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:02,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:18:02,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,463 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:18:02,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:18:02,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:02,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:18:02,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:18:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 165 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:18:02,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:18:02,560 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:18:02,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:02,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-01-14 15:18:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:18:02,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:18:02,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:18:02,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:18:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:18:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:18:02,612 INFO L87 Difference]: Start difference. First operand 2420 states and 3997 transitions. Second operand 7 states. [2019-01-14 15:18:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:18:14,823 INFO L93 Difference]: Finished difference Result 6029 states and 9659 transitions. [2019-01-14 15:18:14,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:18:14,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-01-14 15:18:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:18:14,836 INFO L225 Difference]: With dead ends: 6029 [2019-01-14 15:18:14,836 INFO L226 Difference]: Without dead ends: 3617 [2019-01-14 15:18:14,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:18:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2019-01-14 15:18:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 2420. [2019-01-14 15:18:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-14 15:18:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3957 transitions. [2019-01-14 15:18:15,026 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3957 transitions. Word has length 185 [2019-01-14 15:18:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:18:15,027 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 3957 transitions. [2019-01-14 15:18:15,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:18:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3957 transitions. [2019-01-14 15:18:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-14 15:18:15,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:18:15,031 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:18:15,031 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:18:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:18:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1305879175, now seen corresponding path program 1 times [2019-01-14 15:18:15,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:18:15,033 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:18:15,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:18:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:18:15,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:18:15,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 15:18:15,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:18:15,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:15,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:15,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:15,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-14 15:18:15,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:18:15,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-14 15:18:15,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:15,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:15,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:15,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 15:18:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-14 15:18:15,616 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 15:18:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:18:15,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:18:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:18:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:18:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:18:15,620 INFO L87 Difference]: Start difference. First operand 2420 states and 3957 transitions. Second operand 4 states. [2019-01-14 15:18:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:18:22,471 INFO L93 Difference]: Finished difference Result 5243 states and 8437 transitions. [2019-01-14 15:18:22,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 15:18:22,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-01-14 15:18:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:18:22,480 INFO L225 Difference]: With dead ends: 5243 [2019-01-14 15:18:22,480 INFO L226 Difference]: Without dead ends: 2831 [2019-01-14 15:18:22,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:18:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2019-01-14 15:18:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2092. [2019-01-14 15:18:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2019-01-14 15:18:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3389 transitions. [2019-01-14 15:18:22,671 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3389 transitions. Word has length 185 [2019-01-14 15:18:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:18:22,672 INFO L480 AbstractCegarLoop]: Abstraction has 2092 states and 3389 transitions. [2019-01-14 15:18:22,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:18:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3389 transitions. [2019-01-14 15:18:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-14 15:18:22,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:18:22,676 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:18:22,676 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:18:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:18:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1601310822, now seen corresponding path program 1 times [2019-01-14 15:18:22,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:18:22,677 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:18:22,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:18:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:18:27,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:18:27,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:18:27,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:18:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:27,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:27,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:18:27,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:18:27,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:18:27,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:27,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:18:27,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:18:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 171 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:18:27,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:18:27,925 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:18:27,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:27,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-01-14 15:18:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:18:27,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:18:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:18:27,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:18:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:18:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:18:27,955 INFO L87 Difference]: Start difference. First operand 2092 states and 3389 transitions. Second operand 7 states. [2019-01-14 15:18:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:18:40,426 INFO L93 Difference]: Finished difference Result 5501 states and 8643 transitions. [2019-01-14 15:18:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:18:40,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-01-14 15:18:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:18:40,437 INFO L225 Difference]: With dead ends: 5501 [2019-01-14 15:18:40,438 INFO L226 Difference]: Without dead ends: 3417 [2019-01-14 15:18:40,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:18:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2019-01-14 15:18:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 2092. [2019-01-14 15:18:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2019-01-14 15:18:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3357 transitions. [2019-01-14 15:18:40,723 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3357 transitions. Word has length 185 [2019-01-14 15:18:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:18:40,724 INFO L480 AbstractCegarLoop]: Abstraction has 2092 states and 3357 transitions. [2019-01-14 15:18:40,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:18:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3357 transitions. [2019-01-14 15:18:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-14 15:18:40,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:18:40,731 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:18:40,733 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:18:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:18:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash 850241563, now seen corresponding path program 1 times [2019-01-14 15:18:40,735 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:18:40,735 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:18:40,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:18:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:18:45,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:18:45,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:18:45,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:18:45,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:45,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:45,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:18:45,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:18:45,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:18:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:18:45,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:18:45,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:45,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:18:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 177 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:18:45,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:18:46,021 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:18:46,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:18:46,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:18:46,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:18:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:18:46,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:18:46,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:18:46,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:18:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:18:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:18:46,050 INFO L87 Difference]: Start difference. First operand 2092 states and 3357 transitions. Second operand 7 states. [2019-01-14 15:18:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:18:57,709 INFO L93 Difference]: Finished difference Result 5501 states and 8571 transitions. [2019-01-14 15:18:57,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:18:57,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2019-01-14 15:18:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:18:57,718 INFO L225 Difference]: With dead ends: 5501 [2019-01-14 15:18:57,718 INFO L226 Difference]: Without dead ends: 3417 [2019-01-14 15:18:57,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:18:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2019-01-14 15:18:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 2092. [2019-01-14 15:18:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2019-01-14 15:18:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3325 transitions. [2019-01-14 15:18:58,009 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3325 transitions. Word has length 186 [2019-01-14 15:18:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:18:58,010 INFO L480 AbstractCegarLoop]: Abstraction has 2092 states and 3325 transitions. [2019-01-14 15:18:58,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:18:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3325 transitions. [2019-01-14 15:18:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-14 15:18:58,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:18:58,013 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:18:58,013 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:18:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:18:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 703611007, now seen corresponding path program 1 times [2019-01-14 15:18:58,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:18:58,015 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:18:58,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:19:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:19:03,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:19:03,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:19:03,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:19:03,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:03,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:03,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:19:03,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:19:03,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:19:03,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:03,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:19:03,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:19:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:19:03,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:19:03,280 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:19:03,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:03,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-01-14 15:19:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:19:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:19:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:19:03,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:19:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:19:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:19:03,309 INFO L87 Difference]: Start difference. First operand 2092 states and 3325 transitions. Second operand 7 states. [2019-01-14 15:19:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:19:15,691 INFO L93 Difference]: Finished difference Result 5501 states and 8499 transitions. [2019-01-14 15:19:15,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:19:15,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-01-14 15:19:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:19:15,697 INFO L225 Difference]: With dead ends: 5501 [2019-01-14 15:19:15,697 INFO L226 Difference]: Without dead ends: 3417 [2019-01-14 15:19:15,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:19:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2019-01-14 15:19:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 2092. [2019-01-14 15:19:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2092 states. [2019-01-14 15:19:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3293 transitions. [2019-01-14 15:19:15,860 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3293 transitions. Word has length 187 [2019-01-14 15:19:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:19:15,861 INFO L480 AbstractCegarLoop]: Abstraction has 2092 states and 3293 transitions. [2019-01-14 15:19:15,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:19:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3293 transitions. [2019-01-14 15:19:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-14 15:19:15,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:19:15,865 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:19:15,865 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:19:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:19:15,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1296202910, now seen corresponding path program 1 times [2019-01-14 15:19:15,868 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:19:15,868 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:19:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:19:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:19:19,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:19:19,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:19:19,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:19:19,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:19,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:19,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:19:19,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,749 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:19:19,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:19:19,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:19,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:19:19,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:19:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 216 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:19:19,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:19:19,874 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:19:19,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:19,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:19:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:19:19,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:19:19,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:19:19,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:19:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:19:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:19:19,933 INFO L87 Difference]: Start difference. First operand 2092 states and 3293 transitions. Second operand 7 states. [2019-01-14 15:19:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:19:42,301 INFO L93 Difference]: Finished difference Result 5561 states and 8554 transitions. [2019-01-14 15:19:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:19:42,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-01-14 15:19:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:19:42,307 INFO L225 Difference]: With dead ends: 5561 [2019-01-14 15:19:42,308 INFO L226 Difference]: Without dead ends: 3737 [2019-01-14 15:19:42,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:19:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2019-01-14 15:19:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 2244. [2019-01-14 15:19:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-14 15:19:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3485 transitions. [2019-01-14 15:19:42,475 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3485 transitions. Word has length 187 [2019-01-14 15:19:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:19:42,475 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 3485 transitions. [2019-01-14 15:19:42,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:19:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3485 transitions. [2019-01-14 15:19:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-14 15:19:42,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:19:42,479 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:19:42,479 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:19:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:19:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1617687904, now seen corresponding path program 1 times [2019-01-14 15:19:42,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:19:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:19:42,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:19:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:19:47,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:19:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:19:47,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:19:47,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:47,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:47,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:19:47,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:47,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,119 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:19:48,267 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 15:19:48,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:19:48,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:19:48,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:19:48,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:19:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:19:48,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:19:48,591 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:19:48,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:19:48,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:19:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:19:48,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:19:48,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:19:48,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:19:48,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:19:48,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:19:48,634 INFO L87 Difference]: Start difference. First operand 2244 states and 3485 transitions. Second operand 7 states. [2019-01-14 15:20:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:20:03,390 INFO L93 Difference]: Finished difference Result 5645 states and 8595 transitions. [2019-01-14 15:20:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:20:03,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-01-14 15:20:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:20:03,396 INFO L225 Difference]: With dead ends: 5645 [2019-01-14 15:20:03,396 INFO L226 Difference]: Without dead ends: 3409 [2019-01-14 15:20:03,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:20:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2019-01-14 15:20:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 2244. [2019-01-14 15:20:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-14 15:20:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3445 transitions. [2019-01-14 15:20:03,597 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3445 transitions. Word has length 188 [2019-01-14 15:20:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:20:03,597 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 3445 transitions. [2019-01-14 15:20:03,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:20:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3445 transitions. [2019-01-14 15:20:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-14 15:20:03,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:20:03,601 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:20:03,602 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:20:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:20:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash -970460454, now seen corresponding path program 1 times [2019-01-14 15:20:03,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:20:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:20:03,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:20:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:20:07,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:20:07,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:20:07,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:20:07,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:07,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:07,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:20:07,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,348 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:20:07,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:20:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:07,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:20:07,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:20:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 222 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:20:07,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:20:07,442 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:20:07,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:07,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:20:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:20:07,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:20:07,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:20:07,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:20:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:20:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:20:07,472 INFO L87 Difference]: Start difference. First operand 2244 states and 3445 transitions. Second operand 7 states. [2019-01-14 15:20:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:20:19,857 INFO L93 Difference]: Finished difference Result 5545 states and 8412 transitions. [2019-01-14 15:20:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:20:19,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-01-14 15:20:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:20:19,863 INFO L225 Difference]: With dead ends: 5545 [2019-01-14 15:20:19,863 INFO L226 Difference]: Without dead ends: 3588 [2019-01-14 15:20:19,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:20:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2019-01-14 15:20:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 2263. [2019-01-14 15:20:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-01-14 15:20:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3450 transitions. [2019-01-14 15:20:20,049 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3450 transitions. Word has length 188 [2019-01-14 15:20:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:20:20,049 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 3450 transitions. [2019-01-14 15:20:20,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:20:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3450 transitions. [2019-01-14 15:20:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-14 15:20:20,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:20:20,053 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:20:20,054 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:20:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:20:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash -419963847, now seen corresponding path program 1 times [2019-01-14 15:20:20,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:20:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:20:20,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:20:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:20:23,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:20:23,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:20:23,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:20:23,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:23,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:23,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:20:23,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,771 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:20:23,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:20:23,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:23,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:20:23,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:20:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 227 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:20:23,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:20:23,885 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:20:23,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:23,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:20:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:20:23,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:20:23,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:20:23,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:20:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:20:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:20:23,916 INFO L87 Difference]: Start difference. First operand 2263 states and 3450 transitions. Second operand 7 states. [2019-01-14 15:20:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:20:39,846 INFO L93 Difference]: Finished difference Result 5689 states and 8557 transitions. [2019-01-14 15:20:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:20:39,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-01-14 15:20:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:20:39,852 INFO L225 Difference]: With dead ends: 5689 [2019-01-14 15:20:39,853 INFO L226 Difference]: Without dead ends: 3725 [2019-01-14 15:20:39,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:20:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2019-01-14 15:20:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 2431. [2019-01-14 15:20:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2019-01-14 15:20:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3650 transitions. [2019-01-14 15:20:40,051 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3650 transitions. Word has length 189 [2019-01-14 15:20:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:20:40,052 INFO L480 AbstractCegarLoop]: Abstraction has 2431 states and 3650 transitions. [2019-01-14 15:20:40,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:20:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3650 transitions. [2019-01-14 15:20:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:20:40,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:20:40,056 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:20:40,056 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:20:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:20:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1020234554, now seen corresponding path program 1 times [2019-01-14 15:20:40,057 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:20:40,058 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:20:40,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:20:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:20:43,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:20:43,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:20:43,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:20:43,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:43,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:43,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:20:43,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,825 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:20:43,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:20:43,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:20:43,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:20:43,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:20:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 234 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:20:43,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:20:43,944 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:20:43,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:20:43,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:20:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:20:43,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:20:43,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:20:43,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:20:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:20:43,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:20:43,977 INFO L87 Difference]: Start difference. First operand 2431 states and 3650 transitions. Second operand 7 states. [2019-01-14 15:20:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:20:59,931 INFO L93 Difference]: Finished difference Result 6265 states and 9305 transitions. [2019-01-14 15:20:59,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:20:59,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-01-14 15:20:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:20:59,937 INFO L225 Difference]: With dead ends: 6265 [2019-01-14 15:20:59,937 INFO L226 Difference]: Without dead ends: 3853 [2019-01-14 15:20:59,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:20:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-01-14 15:21:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 2585. [2019-01-14 15:21:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-01-14 15:21:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3829 transitions. [2019-01-14 15:21:00,149 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3829 transitions. Word has length 192 [2019-01-14 15:21:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:21:00,150 INFO L480 AbstractCegarLoop]: Abstraction has 2585 states and 3829 transitions. [2019-01-14 15:21:00,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:21:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3829 transitions. [2019-01-14 15:21:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-14 15:21:00,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:21:00,154 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:21:00,154 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:21:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:21:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1298666982, now seen corresponding path program 1 times [2019-01-14 15:21:00,155 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:21:00,155 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:21:00,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:21:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:21:03,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:21:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 15:21:03,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 15:21:03,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:21:03,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:21:03,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 15:21:03,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,851 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 15:21:03,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 15:21:03,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:21:03,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 15:21:03,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2019-01-14 15:21:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 241 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:21:03,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-14 15:21:03,968 WARN L307 Elim1Store]: Array PQE input equivalent to true [2019-01-14 15:21:03,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:21:03,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-01-14 15:21:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 15:21:03,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 15:21:03,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 15:21:03,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:21:03,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:21:03,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:21:03,999 INFO L87 Difference]: Start difference. First operand 2585 states and 3829 transitions. Second operand 7 states. [2019-01-14 15:21:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:21:16,051 INFO L93 Difference]: Finished difference Result 6580 states and 9655 transitions. [2019-01-14 15:21:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:21:16,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-01-14 15:21:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:21:16,057 INFO L225 Difference]: With dead ends: 6580 [2019-01-14 15:21:16,057 INFO L226 Difference]: Without dead ends: 4014 [2019-01-14 15:21:16,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:21:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2019-01-14 15:21:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 2760. [2019-01-14 15:21:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-01-14 15:21:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4036 transitions. [2019-01-14 15:21:16,284 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4036 transitions. Word has length 192 [2019-01-14 15:21:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:21:16,284 INFO L480 AbstractCegarLoop]: Abstraction has 2760 states and 4036 transitions. [2019-01-14 15:21:16,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:21:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4036 transitions. [2019-01-14 15:21:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-14 15:21:16,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:21:16,288 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:21:16,289 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:21:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:21:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-01-14 15:21:16,290 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 15:21:16,290 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 15:21:16,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:21:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:21:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 15:21:21,957 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 15:21:22,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:21:22 BoogieIcfgContainer [2019-01-14 15:21:22,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:21:22,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:21:22,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:21:22,149 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:21:22,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:10:22" (3/4) ... [2019-01-14 15:21:22,153 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 15:21:22,320 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:21:22,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:21:22,321 INFO L168 Benchmark]: Toolchain (without parser) took 666084.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -108.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,323 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:21:22,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1046.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,323 INFO L168 Benchmark]: Boogie Preprocessor took 161.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,324 INFO L168 Benchmark]: RCFGBuilder took 5328.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,324 INFO L168 Benchmark]: TraceAbstraction took 659229.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -51.8 MB). Peak memory consumption was 256.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,324 INFO L168 Benchmark]: Witness Printer took 172.11 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:21:22,326 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1046.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 161.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5328.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 659229.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -51.8 MB). Peak memory consumption was 256.5 MB. Max. memory is 11.5 GB. * Witness Printer took 172.11 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-2131222482:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-2131222482:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. UNSAFE Result, 659.1s OverallTime, 28 OverallIterations, 7 TraceHistogramMax, 551.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6666 SDtfs, 9537 SDslu, 11318 SDs, 0 SdLazy, 12289 SolverSat, 1698 SolverUnsat, 105 SolverUnknown, 0 SolverNotchecked, 521.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6917 GetRequests, 6752 SyntacticMatches, 8 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2760occurred in iteration=27, 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: 3.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 23861 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.1s SsaConstructionTime, 63.8s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 4506 NumberOfCodeBlocks, 4506 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6847 ConstructedInterpolants, 285 QuantifiedInterpolants, 8140642 SizeOfPredicates, 162 NumberOfNonLiveVariables, 11508 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 41 InterpolantComputations, 26 PerfectInterpolantSequences, 10190/10587 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...