./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -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 eed6d14b3659ee573ecc9a025ea4a6cd48efa35c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 18:10:50,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:10:50,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:10:50,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:10:50,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:10:50,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:10:50,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:10:50,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:10:50,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:10:50,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:10:50,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:10:50,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:10:50,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:10:50,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:10:50,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:10:50,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:10:50,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:10:50,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:10:50,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:10:50,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:10:50,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:10:50,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:10:50,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:10:50,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:10:50,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:10:50,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:10:50,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:10:50,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:10:50,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:10:50,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:10:50,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:10:50,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:10:50,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:10:50,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:10:50,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:10:50,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:10:50,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:10:50,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:10:50,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:10:50,123 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:10:50,124 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:10:50,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:10:50,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:10:50,127 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:10:50,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:10:50,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:10:50,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:10:50,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:10:50,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:10:50,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:10:50,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:10:50,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:10:50,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:10:50,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:10:50,128 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:10:50,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:10:50,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:10:50,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:10:50,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:10:50,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:10:50,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:10:50,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:10:50,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:10:50,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:10:50,136 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:10:50,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:10:50,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:10:50,137 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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2018-11-28 18:10:50,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:10:50,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:10:50,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:10:50,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:10:50,195 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:10:50,196 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-28 18:10:50,252 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847a2334a/e5728f34fbfa4cfebfbf8e697d3331ba/FLAGfa414ad4a [2018-11-28 18:10:50,787 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:10:50,788 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-28 18:10:50,804 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847a2334a/e5728f34fbfa4cfebfbf8e697d3331ba/FLAGfa414ad4a [2018-11-28 18:10:51,072 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847a2334a/e5728f34fbfa4cfebfbf8e697d3331ba [2018-11-28 18:10:51,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:10:51,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:10:51,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:10:51,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:10:51,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:10:51,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7474da11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51, skipping insertion in model container [2018-11-28 18:10:51,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:10:51,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:10:51,560 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:10:51,585 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:10:51,745 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:10:51,801 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:10:51,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51 WrapperNode [2018-11-28 18:10:51,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:10:51,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:10:51,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:10:51,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:10:51,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:10:51,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:10:51,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:10:51,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:10:51,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... [2018-11-28 18:10:51,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:10:51,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:10:51,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:10:51,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:10:51,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:10:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 18:10:51,961 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 18:10:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:10:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:10:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:10:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:10:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:10:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:10:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:10:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:10:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:10:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:10:51,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:10:51,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:10:52,889 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:10:52,889 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 18:10:52,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:10:52 BoogieIcfgContainer [2018-11-28 18:10:52,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:10:52,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:10:52,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:10:52,894 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:10:52,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:10:51" (1/3) ... [2018-11-28 18:10:52,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cc51ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:10:52, skipping insertion in model container [2018-11-28 18:10:52,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:10:51" (2/3) ... [2018-11-28 18:10:52,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cc51ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:10:52, skipping insertion in model container [2018-11-28 18:10:52,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:10:52" (3/3) ... [2018-11-28 18:10:52,897 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-28 18:10:52,907 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:10:52,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:10:52,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:10:52,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:10:52,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:10:52,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:10:52,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:10:52,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:10:52,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:10:52,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:10:52,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:10:52,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:10:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-28 18:10:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:10:52,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:52,997 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] [2018-11-28 18:10:52,999 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:53,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1233719079, now seen corresponding path program 1 times [2018-11-28 18:10:53,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:53,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:10:53,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:10:53,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:10:53,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:10:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:10:53,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:10:53,195 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-28 18:10:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:53,225 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2018-11-28 18:10:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:10:53,226 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-28 18:10:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:53,236 INFO L225 Difference]: With dead ends: 108 [2018-11-28 18:10:53,237 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 18:10:53,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:10:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 18:10:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-28 18:10:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 18:10:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2018-11-28 18:10:53,290 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2018-11-28 18:10:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:53,290 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2018-11-28 18:10:53,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:10:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-28 18:10:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 18:10:53,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:53,292 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] [2018-11-28 18:10:53,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:53,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash 647017727, now seen corresponding path program 1 times [2018-11-28 18:10:53,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:53,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:10:53,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:10:53,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:10:53,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:10:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:10:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:10:53,467 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 3 states. [2018-11-28 18:10:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:53,561 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-11-28 18:10:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:10:53,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 18:10:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:53,572 INFO L225 Difference]: With dead ends: 75 [2018-11-28 18:10:53,574 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 18:10:53,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:10:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 18:10:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-28 18:10:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 18:10:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2018-11-28 18:10:53,597 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2018-11-28 18:10:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:53,597 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2018-11-28 18:10:53,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:10:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-28 18:10:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:10:53,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:53,600 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] [2018-11-28 18:10:53,600 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:53,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1396303948, now seen corresponding path program 1 times [2018-11-28 18:10:53,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:10:53,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:10:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:10:53,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:10:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:10:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:10:53,698 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 3 states. [2018-11-28 18:10:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:53,771 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2018-11-28 18:10:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:10:53,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 18:10:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:53,773 INFO L225 Difference]: With dead ends: 93 [2018-11-28 18:10:53,773 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 18:10:53,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:10:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 18:10:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-28 18:10:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 18:10:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2018-11-28 18:10:53,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2018-11-28 18:10:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:53,783 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2018-11-28 18:10:53,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:10:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-28 18:10:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:10:53,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:53,785 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] [2018-11-28 18:10:53,785 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:53,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash 578655498, now seen corresponding path program 1 times [2018-11-28 18:10:53,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:53,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:53,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:53,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:53,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:10:53,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:10:53,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:10:53,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:10:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:10:53,970 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 5 states. [2018-11-28 18:10:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:54,355 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2018-11-28 18:10:54,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:10:54,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-28 18:10:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:54,357 INFO L225 Difference]: With dead ends: 82 [2018-11-28 18:10:54,358 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 18:10:54,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:10:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 18:10:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2018-11-28 18:10:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 18:10:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-28 18:10:54,369 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2018-11-28 18:10:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:54,369 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-28 18:10:54,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:10:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-28 18:10:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:10:54,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:54,371 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:10:54,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:54,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2085832645, now seen corresponding path program 1 times [2018-11-28 18:10:54,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:54,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:54,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:54,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:54,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:54,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:10:54,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:10:54,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:10:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:10:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:10:54,535 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 5 states. [2018-11-28 18:10:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:54,931 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-28 18:10:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:10:54,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 18:10:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:54,935 INFO L225 Difference]: With dead ends: 84 [2018-11-28 18:10:54,935 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 18:10:54,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:10:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 18:10:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2018-11-28 18:10:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 18:10:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2018-11-28 18:10:54,944 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2018-11-28 18:10:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:54,944 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2018-11-28 18:10:54,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:10:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2018-11-28 18:10:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:10:54,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:54,946 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:10:54,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:54,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1184431675, now seen corresponding path program 1 times [2018-11-28 18:10:54,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:54,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:54,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:54,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:54,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:10:55,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:10:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:10:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:10:55,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:10:55,191 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 5 states. [2018-11-28 18:10:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:55,533 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-28 18:10:55,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:10:55,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 18:10:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:55,536 INFO L225 Difference]: With dead ends: 84 [2018-11-28 18:10:55,536 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 18:10:55,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:10:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 18:10:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-11-28 18:10:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 18:10:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2018-11-28 18:10:55,544 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2018-11-28 18:10:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:55,545 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2018-11-28 18:10:55,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:10:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2018-11-28 18:10:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 18:10:55,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:55,546 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:10:55,547 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:55,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 240228977, now seen corresponding path program 1 times [2018-11-28 18:10:55,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:55,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:55,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:55,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:55,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:55,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:10:55,915 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 [2018-11-28 18:10:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:56,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:10:56,057 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 6 treesize of output 5 [2018-11-28 18:10:56,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:10:56,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:56,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:56,100 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 11 treesize of output 4 [2018-11-28 18:10:56,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:10:56,123 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 8 treesize of output 7 [2018-11-28 18:10:56,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,145 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-28 18:10:56,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 18:10:56,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:56,186 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 22 treesize of output 14 [2018-11-28 18:10:56,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-28 18:10:56,325 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 19 treesize of output 20 [2018-11-28 18:10:56,331 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 8 treesize of output 7 [2018-11-28 18:10:56,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,349 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. [2018-11-28 18:10:56,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-28 18:10:56,396 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 22 treesize of output 20 [2018-11-28 18:10:56,409 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 3 [2018-11-28 18:10:56,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,430 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 5 treesize of output 1 [2018-11-28 18:10:56,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:56,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 18:10:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:56,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:10:56,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-28 18:10:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:10:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:10:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:10:56,484 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 10 states. [2018-11-28 18:10:57,093 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 18:10:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:57,310 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-28 18:10:57,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:10:57,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 18:10:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:57,313 INFO L225 Difference]: With dead ends: 90 [2018-11-28 18:10:57,313 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 18:10:57,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:10:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 18:10:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-11-28 18:10:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 18:10:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-11-28 18:10:57,327 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 35 [2018-11-28 18:10:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:57,328 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-28 18:10:57,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:10:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2018-11-28 18:10:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 18:10:57,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:57,331 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:10:57,331 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:57,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash -623172687, now seen corresponding path program 1 times [2018-11-28 18:10:57,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:57,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:57,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:57,825 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-28 18:10:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:57,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:10:57,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:10:57,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:57,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:10:57,901 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 6 treesize of output 5 [2018-11-28 18:10:57,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:57,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:57,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:10:57,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:57,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:57,950 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 11 treesize of output 4 [2018-11-28 18:10:57,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:57,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:10:57,971 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 8 treesize of output 7 [2018-11-28 18:10:57,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:57,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:57,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:57,989 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-28 18:10:58,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 18:10:58,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:58,030 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 22 treesize of output 14 [2018-11-28 18:10:58,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-28 18:10:58,074 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 19 treesize of output 20 [2018-11-28 18:10:58,081 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 8 treesize of output 7 [2018-11-28 18:10:58,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,096 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. [2018-11-28 18:10:58,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-28 18:10:58,136 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 22 treesize of output 20 [2018-11-28 18:10:58,140 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 3 [2018-11-28 18:10:58,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,165 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 5 treesize of output 1 [2018-11-28 18:10:58,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:58,208 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 18:10:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:58,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:10:58,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-28 18:10:58,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:10:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:10:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:10:58,237 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 10 states. [2018-11-28 18:10:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:10:58,705 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-28 18:10:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:10:58,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 18:10:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:10:58,709 INFO L225 Difference]: With dead ends: 95 [2018-11-28 18:10:58,709 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 18:10:58,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:10:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 18:10:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-28 18:10:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 18:10:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2018-11-28 18:10:58,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2018-11-28 18:10:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:10:58,718 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2018-11-28 18:10:58,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:10:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2018-11-28 18:10:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 18:10:58,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:10:58,720 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] [2018-11-28 18:10:58,720 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:10:58,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:10:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1019506836, now seen corresponding path program 1 times [2018-11-28 18:10:58,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:10:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:10:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:10:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:10:59,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:10:59,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:10:59,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:10:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:10:59,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:10:59,296 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 6 treesize of output 5 [2018-11-28 18:10:59,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:10:59,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:59,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:10:59,468 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 11 treesize of output 4 [2018-11-28 18:10:59,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 18:10:59,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:10:59,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-28 18:10:59,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:10:59,523 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 [2018-11-28 18:10:59,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-11-28 18:10:59,565 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-11-28 18:10:59,587 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 36 treesize of output 1 [2018-11-28 18:10:59,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,836 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 75 treesize of output 76 [2018-11-28 18:10:59,839 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 36 treesize of output 1 [2018-11-28 18:10:59,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,858 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-28 18:10:59,860 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 20 treesize of output 19 [2018-11-28 18:10:59,861 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,867 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-11-28 18:10:59,904 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 33 [2018-11-28 18:10:59,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 18 [2018-11-28 18:10:59,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,925 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 23 treesize of output 19 [2018-11-28 18:10:59,928 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 19 treesize of output 7 [2018-11-28 18:10:59,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-11-28 18:10:59,941 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 15 treesize of output 11 [2018-11-28 18:10:59,943 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 3 [2018-11-28 18:10:59,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:10:59,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 18:10:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:10:59,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:10:59,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-11-28 18:10:59,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 18:10:59,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 18:10:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:10:59,978 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 15 states. [2018-11-28 18:11:00,823 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 18:11:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:01,165 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2018-11-28 18:11:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:11:01,166 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-28 18:11:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:01,167 INFO L225 Difference]: With dead ends: 99 [2018-11-28 18:11:01,168 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 18:11:01,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:11:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 18:11:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-11-28 18:11:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 18:11:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2018-11-28 18:11:01,175 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2018-11-28 18:11:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:01,175 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2018-11-28 18:11:01,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 18:11:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2018-11-28 18:11:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:11:01,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:01,177 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:11:01,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:01,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1011258456, now seen corresponding path program 2 times [2018-11-28 18:11:01,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:01,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:01,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:11:01,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:01,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:11:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:11:01,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:11:01,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:11:01,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:01,475 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 6 treesize of output 5 [2018-11-28 18:11:01,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 18:11:01,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:01,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 18:11:01,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,612 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:01,616 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 8 treesize of output 7 [2018-11-28 18:11:01,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,632 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-28 18:11:01,676 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 18:11:01,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:01,694 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 22 treesize of output 14 [2018-11-28 18:11:01,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 18:11:01,762 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 19 treesize of output 20 [2018-11-28 18:11:01,767 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 8 treesize of output 7 [2018-11-28 18:11:01,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-11-28 18:11:01,879 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 34 treesize of output 33 [2018-11-28 18:11:01,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:01,898 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 22 treesize of output 14 [2018-11-28 18:11:01,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:01,919 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. [2018-11-28 18:11:01,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-11-28 18:11:01,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:01,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-28 18:11:02,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:02,048 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 2 case distinctions, treesize of input 41 treesize of output 45 [2018-11-28 18:11:02,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 18:11:02,202 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 23 treesize of output 22 [2018-11-28 18:11:02,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:02,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:02,253 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 [2018-11-28 18:11:02,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 18:11:02,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-28 18:11:02,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-28 18:11:02,525 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 22 treesize of output 20 [2018-11-28 18:11:02,530 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 3 [2018-11-28 18:11:02,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:02,538 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 5 treesize of output 1 [2018-11-28 18:11:02,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:02,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:02,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:02,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-28 18:11:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:11:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:11:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-28 18:11:02,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:11:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:11:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:11:02,581 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 17 states. [2018-11-28 18:11:03,693 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-28 18:11:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:04,127 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2018-11-28 18:11:04,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 18:11:04,128 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-28 18:11:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:04,129 INFO L225 Difference]: With dead ends: 131 [2018-11-28 18:11:04,129 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 18:11:04,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 18:11:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 18:11:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2018-11-28 18:11:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 18:11:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2018-11-28 18:11:04,138 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 39 [2018-11-28 18:11:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:04,138 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2018-11-28 18:11:04,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:11:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2018-11-28 18:11:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:11:04,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:04,140 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:11:04,140 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:04,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:04,141 INFO L82 PathProgramCache]: Analyzing trace with hash -444845657, now seen corresponding path program 2 times [2018-11-28 18:11:04,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:04,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:04,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:11:04,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:04,785 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-28 18:11:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:11:04,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:04,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:11:04,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:11:05,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:11:05,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:11:05,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:05,039 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 6 treesize of output 5 [2018-11-28 18:11:05,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 18:11:05,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:05,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:05,056 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 11 treesize of output 4 [2018-11-28 18:11:05,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 18:11:05,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:05,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-11-28 18:11:05,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,178 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:05,180 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 8 treesize of output 7 [2018-11-28 18:11:05,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2018-11-28 18:11:05,209 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-11-28 18:11:05,220 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 36 treesize of output 1 [2018-11-28 18:11:05,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-28 18:11:05,259 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 20 treesize of output 19 [2018-11-28 18:11:05,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,285 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 65 treesize of output 66 [2018-11-28 18:11:05,288 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 36 treesize of output 1 [2018-11-28 18:11:05,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,298 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:133, output treesize:33 [2018-11-28 18:11:05,339 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 37 treesize of output 31 [2018-11-28 18:11:05,365 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:11:05,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-28 18:11:05,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,412 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 21 treesize of output 17 [2018-11-28 18:11:05,415 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:11:05,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 18:11:05,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2018-11-28 18:11:05,445 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 15 treesize of output 11 [2018-11-28 18:11:05,448 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 3 [2018-11-28 18:11:05,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:05,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 18:11:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:11:05,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:11:05,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-11-28 18:11:05,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:11:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:11:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:11:05,477 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand 11 states. [2018-11-28 18:11:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:06,173 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2018-11-28 18:11:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:11:06,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-28 18:11:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:06,176 INFO L225 Difference]: With dead ends: 116 [2018-11-28 18:11:06,176 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 18:11:06,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:11:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 18:11:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2018-11-28 18:11:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 18:11:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2018-11-28 18:11:06,186 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 39 [2018-11-28 18:11:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:06,186 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2018-11-28 18:11:06,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:11:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2018-11-28 18:11:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:11:06,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:06,190 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:11:06,190 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:06,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1771906471, now seen corresponding path program 1 times [2018-11-28 18:11:06,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:06,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:11:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 18:11:06,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:06,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:11:06,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:06,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:06,431 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 6 treesize of output 5 [2018-11-28 18:11:06,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:11:06,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:06,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:06,461 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 11 treesize of output 4 [2018-11-28 18:11:06,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,479 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:06,486 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 8 treesize of output 7 [2018-11-28 18:11:06,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-28 18:11:06,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 18:11:06,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:06,519 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 22 treesize of output 14 [2018-11-28 18:11:06,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-28 18:11:06,545 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 19 treesize of output 20 [2018-11-28 18:11:06,549 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 8 treesize of output 7 [2018-11-28 18:11:06,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,561 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. [2018-11-28 18:11:06,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-28 18:11:06,597 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 22 treesize of output 20 [2018-11-28 18:11:06,601 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 3 [2018-11-28 18:11:06,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,608 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 5 treesize of output 1 [2018-11-28 18:11:06,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:06,614 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 18:11:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 18:11:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:11:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-28 18:11:06,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:11:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:11:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:11:06,648 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 10 states. [2018-11-28 18:11:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:07,103 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2018-11-28 18:11:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:11:07,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-28 18:11:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:07,106 INFO L225 Difference]: With dead ends: 114 [2018-11-28 18:11:07,106 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 18:11:07,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:11:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 18:11:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2018-11-28 18:11:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 18:11:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2018-11-28 18:11:07,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 39 [2018-11-28 18:11:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:07,115 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2018-11-28 18:11:07,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:11:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2018-11-28 18:11:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:11:07,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:07,117 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:11:07,117 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:07,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1472204519, now seen corresponding path program 1 times [2018-11-28 18:11:07,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:07,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:07,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:07,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:07,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:11:07,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:07,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:11:07,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:07,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:07,568 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 6 treesize of output 5 [2018-11-28 18:11:07,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 18:11:07,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:07,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:07,615 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 11 treesize of output 4 [2018-11-28 18:11:07,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 18:11:07,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:11:07,650 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 [2018-11-28 18:11:07,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:11:07,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-28 18:11:07,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-11-28 18:11:07,705 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 120 treesize of output 121 [2018-11-28 18:11:07,716 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 36 treesize of output 1 [2018-11-28 18:11:07,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,738 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2018-11-28 18:11:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-28 18:11:07,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-28 18:11:07,762 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 20 treesize of output 19 [2018-11-28 18:11:07,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,773 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-11-28 18:11:07,792 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 33 [2018-11-28 18:11:07,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 18 [2018-11-28 18:11:07,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,806 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 23 treesize of output 19 [2018-11-28 18:11:07,809 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 19 treesize of output 7 [2018-11-28 18:11:07,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-11-28 18:11:07,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 15 treesize of output 11 [2018-11-28 18:11:07,826 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 3 [2018-11-28 18:11:07,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:07,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 18:11:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:11:07,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:11:07,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-11-28 18:11:07,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 18:11:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 18:11:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:11:07,854 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand 15 states. [2018-11-28 18:11:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:08,455 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-11-28 18:11:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:11:08,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-11-28 18:11:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:08,457 INFO L225 Difference]: With dead ends: 111 [2018-11-28 18:11:08,457 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 18:11:08,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:11:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 18:11:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-11-28 18:11:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 18:11:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2018-11-28 18:11:08,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 39 [2018-11-28 18:11:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:08,464 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2018-11-28 18:11:08,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 18:11:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2018-11-28 18:11:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:11:08,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:08,468 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:11:08,468 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:08,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash -151845160, now seen corresponding path program 2 times [2018-11-28 18:11:08,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:08,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:08,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:08,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:11:08,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:08,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:11:08,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:11:08,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:11:08,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:11:08,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:08,935 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 6 treesize of output 5 [2018-11-28 18:11:08,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:08,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:08,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 18:11:09,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:09,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:09,067 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 11 treesize of output 4 [2018-11-28 18:11:09,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:09,087 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 8 treesize of output 7 [2018-11-28 18:11:09,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-28 18:11:09,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 18:11:09,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:09,147 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 22 treesize of output 14 [2018-11-28 18:11:09,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 18:11:09,212 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 19 treesize of output 20 [2018-11-28 18:11:09,215 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 8 treesize of output 7 [2018-11-28 18:11:09,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-11-28 18:11:09,259 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 34 treesize of output 33 [2018-11-28 18:11:09,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:09,266 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 22 treesize of output 14 [2018-11-28 18:11:09,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,283 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. [2018-11-28 18:11:09,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-11-28 18:11:09,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:09,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-28 18:11:09,362 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 38 treesize of output 26 [2018-11-28 18:11:09,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,469 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 23 treesize of output 22 [2018-11-28 18:11:09,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:09,546 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 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-28 18:11:09,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 18:11:09,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 18:11:09,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-28 18:11:09,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-28 18:11:09,826 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 18:11:09,887 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 22 treesize of output 20 [2018-11-28 18:11:09,889 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 3 [2018-11-28 18:11:09,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,894 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 5 treesize of output 1 [2018-11-28 18:11:09,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:09,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-28 18:11:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:11:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:11:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-28 18:11:09,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:11:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:11:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:11:09,940 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 17 states. [2018-11-28 18:11:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:10,737 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-28 18:11:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 18:11:10,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-28 18:11:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:10,740 INFO L225 Difference]: With dead ends: 130 [2018-11-28 18:11:10,740 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 18:11:10,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 18:11:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 18:11:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2018-11-28 18:11:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 18:11:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2018-11-28 18:11:10,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 39 [2018-11-28 18:11:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:10,747 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-28 18:11:10,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:11:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-28 18:11:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:11:10,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:10,748 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 18:11:10,749 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:10,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1205447571, now seen corresponding path program 3 times [2018-11-28 18:11:10,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:10,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:10,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:11:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:11,119 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-28 18:11:11,545 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-28 18:11:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:11:11,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:11,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:11:11,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:11:11,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 18:11:11,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:11:11,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:11,893 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 6 treesize of output 5 [2018-11-28 18:11:11,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:11,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:11,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 18:11:11,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:11,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:11,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 18:11:11,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:11,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:11,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-28 18:11:11,978 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:11,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-11-28 18:11:12,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 18:11:12,290 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 8 treesize of output 7 [2018-11-28 18:11:12,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-11-28 18:11:12,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 18:11:12,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,456 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 11 treesize of output 12 [2018-11-28 18:11:12,460 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 12 treesize of output 15 [2018-11-28 18:11:12,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,506 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 45 treesize of output 50 [2018-11-28 18:11:12,510 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 19 [2018-11-28 18:11:12,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,552 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 54 treesize of output 55 [2018-11-28 18:11:12,556 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 12 treesize of output 15 [2018-11-28 18:11:12,556 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,568 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,587 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:96, output treesize:63 [2018-11-28 18:11:12,633 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 55 treesize of output 42 [2018-11-28 18:11:12,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,639 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 42 treesize of output 30 [2018-11-28 18:11:12,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 127 [2018-11-28 18:11:12,683 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-28 18:11:12,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,733 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 99 treesize of output 100 [2018-11-28 18:11:12,736 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 18 treesize of output 17 [2018-11-28 18:11:12,737 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:12,769 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:169, output treesize:117 [2018-11-28 18:11:12,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:12,824 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 296 treesize of output 269 [2018-11-28 18:11:12,847 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 68 treesize of output 1 [2018-11-28 18:11:12,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:13,368 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 69 treesize of output 101 [2018-11-28 18:11:13,383 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 64 treesize of output 62 [2018-11-28 18:11:13,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:13,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:13,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 194 [2018-11-28 18:11:13,443 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 68 treesize of output 1 [2018-11-28 18:11:13,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,473 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:306, output treesize:96 [2018-11-28 18:11:13,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:13,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:11:13,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-11-28 18:11:13,565 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-11-28 18:11:13,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 18:11:13,589 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 25 treesize of output 17 [2018-11-28 18:11:13,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:11:13,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:11:13,616 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 56 treesize of output 46 [2018-11-28 18:11:13,619 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 7 [2018-11-28 18:11:13,619 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,631 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 20 treesize of output 11 [2018-11-28 18:11:13,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:13,661 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. [2018-11-28 18:11:13,662 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:114, output treesize:29 [2018-11-28 18:11:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:11:13,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:11:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-11-28 18:11:13,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 18:11:13,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 18:11:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:11:13,854 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 21 states. [2018-11-28 18:11:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:15,140 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2018-11-28 18:11:15,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 18:11:15,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-11-28 18:11:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:15,144 INFO L225 Difference]: With dead ends: 121 [2018-11-28 18:11:15,144 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 18:11:15,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 18:11:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 18:11:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-11-28 18:11:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 18:11:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-28 18:11:15,153 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 41 [2018-11-28 18:11:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-28 18:11:15,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 18:11:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2018-11-28 18:11:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:11:15,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:15,155 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] [2018-11-28 18:11:15,155 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:15,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash 405136595, now seen corresponding path program 1 times [2018-11-28 18:11:15,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:15,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:15,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:15,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:11:15,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:11:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:11:15,212 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:11:15,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:15 BoogieIcfgContainer [2018-11-28 18:11:15,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:11:15,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:11:15,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:11:15,293 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:11:15,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:10:52" (3/4) ... [2018-11-28 18:11:15,303 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:11:15,385 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:11:15,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:11:15,387 INFO L168 Benchmark]: Toolchain (without parser) took 24309.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -296.6 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:15,387 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:11:15,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:15,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.90 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. [2018-11-28 18:11:15,390 INFO L168 Benchmark]: Boogie Preprocessor took 49.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:11:15,390 INFO L168 Benchmark]: RCFGBuilder took 989.89 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: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:15,390 INFO L168 Benchmark]: TraceAbstraction took 22401.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.6 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:15,390 INFO L168 Benchmark]: Witness Printer took 93.41 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:15,392 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.15 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 723.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.90 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 49.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 989.89 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: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22401.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.6 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Witness Printer took 93.41 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, root={17:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={17:0}, n={0:0}, root={17:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={17:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={17:0}, n={17:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={17:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L591] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L598] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={10:0}] [L604] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 1 error locations. UNSAFE Result, 22.3s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 890 SDtfs, 1001 SDslu, 3852 SDs, 0 SdLazy, 2423 SolverSat, 363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 299 SyntacticMatches, 34 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 182 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 835 ConstructedInterpolants, 25 QuantifiedInterpolants, 270009 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1525 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 49/142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...