./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 425afc8b22e60c0a2f2550983f32b043f3f437d4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 425afc8b22e60c0a2f2550983f32b043f3f437d4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-27 22:33:55,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:33:55,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:33:55,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:33:55,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:33:55,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:33:55,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:33:55,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:33:55,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:33:55,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:33:55,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:33:55,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:33:55,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:33:55,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:33:55,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:33:55,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:33:55,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:33:55,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:33:55,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:33:55,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:33:55,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:33:55,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:33:55,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:33:55,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:33:55,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:33:55,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:33:55,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:33:55,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:33:55,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:33:55,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:33:55,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:33:55,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:33:55,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:33:55,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:33:55,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:33:55,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:33:55,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:33:55,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:33:55,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:33:55,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:33:55,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:33:55,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:33:55,271 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:33:55,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:33:55,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:33:55,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:33:55,276 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:33:55,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:33:55,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:33:55,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:33:55,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:33:55,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:33:55,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:33:55,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:33:55,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:33:55,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:33:55,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:33:55,280 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:33:55,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:33:55,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:33:55,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:33:55,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:33:55,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:33:55,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:33:55,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:33:55,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:33:55,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:33:55,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:33:55,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:33:55,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:33:55,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-27 22:33:55,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:33:55,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:33:55,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:33:55,617 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:33:55,618 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:33:55,619 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-27 22:33:55,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d757d82df/920c0fbd063247d5bf1a55b7dcdf726e/FLAG4b6dcfadc [2019-11-27 22:33:56,151 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:33:56,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-27 22:33:56,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d757d82df/920c0fbd063247d5bf1a55b7dcdf726e/FLAG4b6dcfadc [2019-11-27 22:33:56,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d757d82df/920c0fbd063247d5bf1a55b7dcdf726e [2019-11-27 22:33:56,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:33:56,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:33:56,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:33:56,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:33:56,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:33:56,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:33:56" (1/1) ... [2019-11-27 22:33:56,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15bea4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:56, skipping insertion in model container [2019-11-27 22:33:56,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:33:56" (1/1) ... [2019-11-27 22:33:56,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:33:56,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:33:56,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:33:56,927 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:33:56,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:33:57,012 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:33:57,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57 WrapperNode [2019-11-27 22:33:57,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:33:57,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:33:57,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:33:57,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:33:57,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:33:57,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:33:57,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:33:57,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:33:57,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... [2019-11-27 22:33:57,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:33:57,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:33:57,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:33:57,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:33:57,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:33:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:33:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:33:57,316 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:33:57,881 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:33:57,881 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:33:57,885 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:33:57,886 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:33:57,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:57 BoogieIcfgContainer [2019-11-27 22:33:57,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:33:57,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:33:57,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:33:57,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:33:57,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:33:56" (1/3) ... [2019-11-27 22:33:57,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0ba32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:33:57, skipping insertion in model container [2019-11-27 22:33:57,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:33:57" (2/3) ... [2019-11-27 22:33:57,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0ba32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:33:57, skipping insertion in model container [2019-11-27 22:33:57,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:57" (3/3) ... [2019-11-27 22:33:57,897 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-27 22:33:57,908 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:33:57,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:33:57,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:33:57,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:33:57,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:33:57,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:33:57,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:33:57,961 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:33:57,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:33:57,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:33:57,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:33:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-27 22:33:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:33:57,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:57,993 INFO L410 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] [2019-11-27 22:33:57,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-27 22:33:58,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:58,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225093502] [2019-11-27 22:33:58,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:58,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225093502] [2019-11-27 22:33:58,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:58,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:33:58,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925547982] [2019-11-27 22:33:58,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:58,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:58,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:58,228 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-27 22:33:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:58,455 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-27 22:33:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:58,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:33:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:58,471 INFO L225 Difference]: With dead ends: 245 [2019-11-27 22:33:58,472 INFO L226 Difference]: Without dead ends: 111 [2019-11-27 22:33:58,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-27 22:33:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-27 22:33:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-27 22:33:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-27 22:33:58,527 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-27 22:33:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:58,528 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-27 22:33:58,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-27 22:33:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 22:33:58,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:58,530 INFO L410 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] [2019-11-27 22:33:58,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-27 22:33:58,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:58,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684198027] [2019-11-27 22:33:58,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:33:58,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684198027] [2019-11-27 22:33:58,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:58,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:33:58,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988455824] [2019-11-27 22:33:58,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:58,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:58,631 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-27 22:33:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:58,829 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-27 22:33:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:58,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-27 22:33:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:58,831 INFO L225 Difference]: With dead ends: 232 [2019-11-27 22:33:58,832 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 22:33:58,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 22:33:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-27 22:33:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-27 22:33:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-27 22:33:58,865 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-27 22:33:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:58,866 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-27 22:33:58,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-27 22:33:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-27 22:33:58,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:58,870 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:33:58,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:58,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-27 22:33:58,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:58,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561717509] [2019-11-27 22:33:58,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:33:59,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561717509] [2019-11-27 22:33:59,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:59,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:33:59,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454582675] [2019-11-27 22:33:59,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:59,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,031 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-27 22:33:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:59,177 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-27 22:33:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:59,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-27 22:33:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:59,180 INFO L225 Difference]: With dead ends: 264 [2019-11-27 22:33:59,180 INFO L226 Difference]: Without dead ends: 147 [2019-11-27 22:33:59,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-27 22:33:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-27 22:33:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-27 22:33:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-27 22:33:59,193 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-27 22:33:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:59,194 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-27 22:33:59,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-27 22:33:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-27 22:33:59,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:59,196 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:33:59,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-27 22:33:59,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:59,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359352539] [2019-11-27 22:33:59,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:33:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359352539] [2019-11-27 22:33:59,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:59,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:33:59,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939998018] [2019-11-27 22:33:59,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:59,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,329 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-27 22:33:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:59,356 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-27 22:33:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:59,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-27 22:33:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:59,359 INFO L225 Difference]: With dead ends: 298 [2019-11-27 22:33:59,359 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 22:33:59,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 22:33:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-27 22:33:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-27 22:33:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-27 22:33:59,373 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-27 22:33:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:59,374 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-27 22:33:59,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-27 22:33:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-27 22:33:59,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:59,377 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:33:59,377 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-27 22:33:59,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:59,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450398062] [2019-11-27 22:33:59,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:33:59,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450398062] [2019-11-27 22:33:59,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:59,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:33:59,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603585568] [2019-11-27 22:33:59,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:59,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,466 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-11-27 22:33:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:59,669 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-11-27 22:33:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:59,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-27 22:33:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:59,672 INFO L225 Difference]: With dead ends: 369 [2019-11-27 22:33:59,672 INFO L226 Difference]: Without dead ends: 213 [2019-11-27 22:33:59,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-27 22:33:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-11-27 22:33:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-27 22:33:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-11-27 22:33:59,685 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-11-27 22:33:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:59,686 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-11-27 22:33:59,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-11-27 22:33:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-27 22:33:59,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:59,692 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:33:59,694 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-11-27 22:33:59,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:59,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181568124] [2019-11-27 22:33:59,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:33:59,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181568124] [2019-11-27 22:33:59,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:59,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:33:59,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574634041] [2019-11-27 22:33:59,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:59,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:59,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,768 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-11-27 22:33:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:33:59,896 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-11-27 22:33:59,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:33:59,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-27 22:33:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:33:59,899 INFO L225 Difference]: With dead ends: 424 [2019-11-27 22:33:59,899 INFO L226 Difference]: Without dead ends: 228 [2019-11-27 22:33:59,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-27 22:33:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-11-27 22:33:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-27 22:33:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-11-27 22:33:59,909 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-11-27 22:33:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:33:59,910 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-11-27 22:33:59,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:33:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-11-27 22:33:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-27 22:33:59,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:33:59,912 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:33:59,912 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:33:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:33:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-11-27 22:33:59,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:33:59,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809812084] [2019-11-27 22:33:59,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:33:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:33:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:33:59,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809812084] [2019-11-27 22:33:59,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:33:59,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:33:59,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139672910] [2019-11-27 22:33:59,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:33:59,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:33:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:33:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:33:59,973 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-11-27 22:34:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,126 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-11-27 22:34:00,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-27 22:34:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,129 INFO L225 Difference]: With dead ends: 463 [2019-11-27 22:34:00,130 INFO L226 Difference]: Without dead ends: 248 [2019-11-27 22:34:00,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-27 22:34:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-11-27 22:34:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-27 22:34:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-27 22:34:00,141 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-11-27 22:34:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,142 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-27 22:34:00,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-27 22:34:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-27 22:34:00,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,144 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:00,144 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-27 22:34:00,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062857617] [2019-11-27 22:34:00,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:34:00,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062857617] [2019-11-27 22:34:00,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:00,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:00,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133609663] [2019-11-27 22:34:00,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,221 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-11-27 22:34:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,285 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-11-27 22:34:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-27 22:34:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,289 INFO L225 Difference]: With dead ends: 694 [2019-11-27 22:34:00,289 INFO L226 Difference]: Without dead ends: 458 [2019-11-27 22:34:00,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-27 22:34:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-11-27 22:34:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-27 22:34:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-11-27 22:34:00,307 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-11-27 22:34:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,307 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-11-27 22:34:00,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-11-27 22:34:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:34:00,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,310 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:00,310 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-27 22:34:00,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243222093] [2019-11-27 22:34:00,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:34:00,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243222093] [2019-11-27 22:34:00,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:00,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:00,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645256600] [2019-11-27 22:34:00,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,363 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-11-27 22:34:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,409 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-11-27 22:34:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:34:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,414 INFO L225 Difference]: With dead ends: 673 [2019-11-27 22:34:00,415 INFO L226 Difference]: Without dead ends: 671 [2019-11-27 22:34:00,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-27 22:34:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-27 22:34:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-27 22:34:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-27 22:34:00,434 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-11-27 22:34:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,435 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-27 22:34:00,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-27 22:34:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-27 22:34:00,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,438 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:00,439 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,439 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-27 22:34:00,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481431484] [2019-11-27 22:34:00,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-27 22:34:00,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481431484] [2019-11-27 22:34:00,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:00,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:00,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043194127] [2019-11-27 22:34:00,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,505 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-27 22:34:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:00,684 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-11-27 22:34:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:00,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-27 22:34:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:00,690 INFO L225 Difference]: With dead ends: 1483 [2019-11-27 22:34:00,691 INFO L226 Difference]: Without dead ends: 818 [2019-11-27 22:34:00,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-27 22:34:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-11-27 22:34:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-27 22:34:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-11-27 22:34:00,715 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-11-27 22:34:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-11-27 22:34:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-11-27 22:34:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-27 22:34:00,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:00,720 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:00,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-11-27 22:34:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:00,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901276515] [2019-11-27 22:34:00,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-27 22:34:00,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901276515] [2019-11-27 22:34:00,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:00,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:00,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717202968] [2019-11-27 22:34:00,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:00,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:00,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:00,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:00,784 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-11-27 22:34:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,013 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-11-27 22:34:01,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-27 22:34:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,020 INFO L225 Difference]: With dead ends: 1845 [2019-11-27 22:34:01,021 INFO L226 Difference]: Without dead ends: 1015 [2019-11-27 22:34:01,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-27 22:34:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-11-27 22:34:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-27 22:34:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-11-27 22:34:01,066 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-11-27 22:34:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,067 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-11-27 22:34:01,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-11-27 22:34:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:34:01,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,075 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:01,075 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-27 22:34:01,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098466929] [2019-11-27 22:34:01,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-27 22:34:01,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098466929] [2019-11-27 22:34:01,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:01,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:01,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363844704] [2019-11-27 22:34:01,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:01,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,287 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-11-27 22:34:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,334 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-11-27 22:34:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:34:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,346 INFO L225 Difference]: With dead ends: 2279 [2019-11-27 22:34:01,346 INFO L226 Difference]: Without dead ends: 1311 [2019-11-27 22:34:01,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-27 22:34:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-11-27 22:34:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-27 22:34:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-11-27 22:34:01,391 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-11-27 22:34:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,392 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-11-27 22:34:01,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-11-27 22:34:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-27 22:34:01,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,398 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:01,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-11-27 22:34:01,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132044299] [2019-11-27 22:34:01,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-27 22:34:01,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132044299] [2019-11-27 22:34:01,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:01,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:01,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907142028] [2019-11-27 22:34:01,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:01,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,520 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-11-27 22:34:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:01,594 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-11-27 22:34:01,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:01,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-27 22:34:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:01,608 INFO L225 Difference]: With dead ends: 3667 [2019-11-27 22:34:01,608 INFO L226 Difference]: Without dead ends: 2365 [2019-11-27 22:34:01,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-11-27 22:34:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-11-27 22:34:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-27 22:34:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-11-27 22:34:01,741 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-11-27 22:34:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:01,742 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-11-27 22:34:01,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-11-27 22:34:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-27 22:34:01,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:01,752 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:01,753 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-27 22:34:01,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:01,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726186259] [2019-11-27 22:34:01,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:02,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:34:02,006 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:02,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:02 BoogieIcfgContainer [2019-11-27 22:34:02,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:02,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:02,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:02,133 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:02,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:33:57" (3/4) ... [2019-11-27 22:34:02,137 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 22:34:02,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:02,140 INFO L168 Benchmark]: Toolchain (without parser) took 5637.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -281.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:02,141 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:02,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:02,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:02,144 INFO L168 Benchmark]: Boogie Preprocessor took 51.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:02,154 INFO L168 Benchmark]: RCFGBuilder took 755.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:02,155 INFO L168 Benchmark]: TraceAbstraction took 4243.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -196.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:02,156 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:02,164 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 509.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 755.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4243.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -196.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 607]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 355. Possible FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.0s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:04,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:04,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:04,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:04,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:04,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:04,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:04,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:04,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:04,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:04,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:04,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:04,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:04,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:04,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:04,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:04,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:04,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:04,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:04,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:04,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:04,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:04,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:04,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:04,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:04,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:04,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:04,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:04,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:04,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:04,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:04,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:04,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:04,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:04,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:04,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:04,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:04,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:04,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:04,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:04,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:04,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 22:34:04,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:04,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:04,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:04,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:04,222 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:04,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:04,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:04,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:04,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:04,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:04,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:04,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:04,225 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:34:04,226 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:34:04,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:04,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:04,226 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:04,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:04,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:04,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:04,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:04,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:04,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:04,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:04,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:04,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:04,229 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:34:04,230 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:34:04,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:04,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:34:04,231 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-27 22:34:04,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:04,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:04,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:04,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:04,557 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:04,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-27 22:34:04,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2040c2fe/fd57482a529f424a82717070938dc53b/FLAGae2ed601a [2019-11-27 22:34:05,054 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:05,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-27 22:34:05,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2040c2fe/fd57482a529f424a82717070938dc53b/FLAGae2ed601a [2019-11-27 22:34:05,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2040c2fe/fd57482a529f424a82717070938dc53b [2019-11-27 22:34:05,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:05,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:05,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:05,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:05,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:05,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:05,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300b3d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05, skipping insertion in model container [2019-11-27 22:34:05,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:05,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:05,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:05,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:05,794 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:05,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:05,930 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:05,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05 WrapperNode [2019-11-27 22:34:05,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:05,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:05,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:05,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:05,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:05,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:05,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:05,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:05,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:05,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:06,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... [2019-11-27 22:34:06,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:06,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:06,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:06,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:06,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:06,376 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:34:07,052 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:34:07,052 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:34:07,056 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:07,057 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:07,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:07 BoogieIcfgContainer [2019-11-27 22:34:07,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:07,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:07,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:07,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:07,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:05" (1/3) ... [2019-11-27 22:34:07,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfa75cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:07, skipping insertion in model container [2019-11-27 22:34:07,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:05" (2/3) ... [2019-11-27 22:34:07,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfa75cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:07, skipping insertion in model container [2019-11-27 22:34:07,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:07" (3/3) ... [2019-11-27 22:34:07,067 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-27 22:34:07,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:07,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:07,099 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:07,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:07,126 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:07,126 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:07,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:07,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:07,127 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:07,127 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:07,127 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-27 22:34:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:34:07,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:07,157 INFO L410 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] [2019-11-27 22:34:07,158 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-27 22:34:07,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:07,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028497097] [2019-11-27 22:34:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:07,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:07,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:07,357 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:07,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028497097] [2019-11-27 22:34:07,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:07,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 22:34:07,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856598382] [2019-11-27 22:34:07,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:07,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:07,408 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-27 22:34:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:07,669 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-27 22:34:07,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:07,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:34:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:07,684 INFO L225 Difference]: With dead ends: 245 [2019-11-27 22:34:07,685 INFO L226 Difference]: Without dead ends: 111 [2019-11-27 22:34:07,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-27 22:34:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-27 22:34:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-27 22:34:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-27 22:34:07,751 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-27 22:34:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:07,751 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-27 22:34:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-27 22:34:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 22:34:07,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:07,754 INFO L410 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] [2019-11-27 22:34:07,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:34:07,956 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:07,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:07,956 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-27 22:34:07,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:07,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655286526] [2019-11-27 22:34:07,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:08,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:08,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:08,033 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:08,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655286526] [2019-11-27 22:34:08,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:08,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:08,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262218740] [2019-11-27 22:34:08,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:08,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:08,043 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-27 22:34:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:08,205 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-27 22:34:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:08,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-27 22:34:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:08,208 INFO L225 Difference]: With dead ends: 232 [2019-11-27 22:34:08,208 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 22:34:08,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 22:34:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-27 22:34:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-27 22:34:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-27 22:34:08,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-27 22:34:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:08,223 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-27 22:34:08,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-27 22:34:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-27 22:34:08,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:08,225 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:08,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:34:08,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-27 22:34:08,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:08,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534534151] [2019-11-27 22:34:08,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:08,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:08,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:08,529 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:08,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534534151] [2019-11-27 22:34:08,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:08,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:08,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042473678] [2019-11-27 22:34:08,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:08,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:08,540 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-27 22:34:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:08,723 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-27 22:34:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:08,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-27 22:34:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:08,728 INFO L225 Difference]: With dead ends: 264 [2019-11-27 22:34:08,728 INFO L226 Difference]: Without dead ends: 147 [2019-11-27 22:34:08,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-27 22:34:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-27 22:34:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-27 22:34:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-27 22:34:08,753 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-27 22:34:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:08,754 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-27 22:34:08,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-27 22:34:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-27 22:34:08,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:08,761 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:08,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:34:08,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-27 22:34:08,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:08,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535707673] [2019-11-27 22:34:08,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:09,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:09,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:09,085 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:09,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535707673] [2019-11-27 22:34:09,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586834274] [2019-11-27 22:34:09,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:09,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:09,099 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-27 22:34:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:09,128 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-27 22:34:09,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:09,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-27 22:34:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:09,131 INFO L225 Difference]: With dead ends: 298 [2019-11-27 22:34:09,131 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 22:34:09,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 22:34:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-27 22:34:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-27 22:34:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-27 22:34:09,156 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-27 22:34:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:09,157 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-27 22:34:09,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-27 22:34:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-27 22:34:09,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:09,163 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:09,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:34:09,376 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-27 22:34:09,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:09,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593938078] [2019-11-27 22:34:09,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:09,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:09,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:09,476 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:09,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593938078] [2019-11-27 22:34:09,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:09,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:34:09,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555062328] [2019-11-27 22:34:09,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:09,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:09,490 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-11-27 22:34:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:09,794 INFO L93 Difference]: Finished difference Result 390 states and 587 transitions. [2019-11-27 22:34:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:09,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-27 22:34:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:09,797 INFO L225 Difference]: With dead ends: 390 [2019-11-27 22:34:09,797 INFO L226 Difference]: Without dead ends: 235 [2019-11-27 22:34:09,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-27 22:34:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-11-27 22:34:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-27 22:34:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2019-11-27 22:34:09,812 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 66 [2019-11-27 22:34:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:09,812 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2019-11-27 22:34:09,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2019-11-27 22:34:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:09,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:09,814 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:10,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 22:34:10,024 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:10,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1464883036, now seen corresponding path program 1 times [2019-11-27 22:34:10,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:10,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003768119] [2019-11-27 22:34:10,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:10,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:10,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:10,137 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:10,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003768119] [2019-11-27 22:34:10,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:10,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:10,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897640173] [2019-11-27 22:34:10,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:10,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:10,145 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand 3 states. [2019-11-27 22:34:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:10,293 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2019-11-27 22:34:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:10,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:34:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:10,296 INFO L225 Difference]: With dead ends: 468 [2019-11-27 22:34:10,296 INFO L226 Difference]: Without dead ends: 250 [2019-11-27 22:34:10,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-27 22:34:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2019-11-27 22:34:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-27 22:34:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 347 transitions. [2019-11-27 22:34:10,308 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 347 transitions. Word has length 67 [2019-11-27 22:34:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:10,309 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 347 transitions. [2019-11-27 22:34:10,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 347 transitions. [2019-11-27 22:34:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:34:10,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:10,310 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:10,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 22:34:10,522 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1271135886, now seen corresponding path program 1 times [2019-11-27 22:34:10,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:10,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024371649] [2019-11-27 22:34:10,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:10,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:10,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:34:10,630 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:34:10,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024371649] [2019-11-27 22:34:10,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:10,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169926258] [2019-11-27 22:34:10,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:10,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:10,641 INFO L87 Difference]: Start difference. First operand 246 states and 347 transitions. Second operand 3 states. [2019-11-27 22:34:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:10,822 INFO L93 Difference]: Finished difference Result 507 states and 723 transitions. [2019-11-27 22:34:10,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:10,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:34:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:10,824 INFO L225 Difference]: With dead ends: 507 [2019-11-27 22:34:10,825 INFO L226 Difference]: Without dead ends: 270 [2019-11-27 22:34:10,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-27 22:34:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-11-27 22:34:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-27 22:34:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 373 transitions. [2019-11-27 22:34:10,845 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 373 transitions. Word has length 83 [2019-11-27 22:34:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:10,847 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 373 transitions. [2019-11-27 22:34:10,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 373 transitions. [2019-11-27 22:34:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-27 22:34:10,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:10,850 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:11,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,052 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-27 22:34:11,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:11,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623426563] [2019-11-27 22:34:11,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:11,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:11,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:34:11,153 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:34:11,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623426563] [2019-11-27 22:34:11,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:11,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:34:11,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381417277] [2019-11-27 22:34:11,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:11,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:11,177 INFO L87 Difference]: Start difference. First operand 267 states and 373 transitions. Second operand 4 states. [2019-11-27 22:34:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:11,269 INFO L93 Difference]: Finished difference Result 784 states and 1095 transitions. [2019-11-27 22:34:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:11,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-27 22:34:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:11,277 INFO L225 Difference]: With dead ends: 784 [2019-11-27 22:34:11,277 INFO L226 Difference]: Without dead ends: 526 [2019-11-27 22:34:11,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-27 22:34:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2019-11-27 22:34:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-11-27 22:34:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2019-11-27 22:34:11,329 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 102 [2019-11-27 22:34:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:11,330 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2019-11-27 22:34:11,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2019-11-27 22:34:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-27 22:34:11,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:11,335 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:11,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,549 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash 302681874, now seen corresponding path program 1 times [2019-11-27 22:34:11,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:11,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626936355] [2019-11-27 22:34:11,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:11,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:11,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-27 22:34:11,690 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-27 22:34:11,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626936355] [2019-11-27 22:34:11,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:11,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 22:34:11,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610341608] [2019-11-27 22:34:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:11,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:11,721 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand 3 states. [2019-11-27 22:34:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:11,767 INFO L93 Difference]: Finished difference Result 1069 states and 1477 transitions. [2019-11-27 22:34:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:11,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-27 22:34:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:11,782 INFO L225 Difference]: With dead ends: 1069 [2019-11-27 22:34:11,785 INFO L226 Difference]: Without dead ends: 552 [2019-11-27 22:34:11,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-11-27 22:34:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-11-27 22:34:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-27 22:34:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 761 transitions. [2019-11-27 22:34:11,817 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 761 transitions. Word has length 103 [2019-11-27 22:34:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:11,818 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 761 transitions. [2019-11-27 22:34:11,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 761 transitions. [2019-11-27 22:34:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:34:11,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:11,822 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:12,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:12,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-27 22:34:12,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:12,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332316510] [2019-11-27 22:34:12,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:12,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:12,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:34:12,149 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:34:12,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332316510] [2019-11-27 22:34:12,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:12,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:34:12,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485911309] [2019-11-27 22:34:12,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:12,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:12,174 INFO L87 Difference]: Start difference. First operand 552 states and 761 transitions. Second operand 4 states. [2019-11-27 22:34:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:12,258 INFO L93 Difference]: Finished difference Result 1519 states and 2112 transitions. [2019-11-27 22:34:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:12,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-27 22:34:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:12,264 INFO L225 Difference]: With dead ends: 1519 [2019-11-27 22:34:12,264 INFO L226 Difference]: Without dead ends: 1002 [2019-11-27 22:34:12,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-11-27 22:34:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2019-11-27 22:34:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-11-27 22:34:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1391 transitions. [2019-11-27 22:34:12,301 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1391 transitions. Word has length 104 [2019-11-27 22:34:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:12,301 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1391 transitions. [2019-11-27 22:34:12,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1391 transitions. [2019-11-27 22:34:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-27 22:34:12,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:12,305 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:12,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,517 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-27 22:34:12,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:12,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647020283] [2019-11-27 22:34:12,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:12,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:12,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-27 22:34:12,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-27 22:34:12,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647020283] [2019-11-27 22:34:12,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:12,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:34:12,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158237489] [2019-11-27 22:34:12,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:12,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:12,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:12,724 INFO L87 Difference]: Start difference. First operand 1002 states and 1391 transitions. Second operand 4 states. [2019-11-27 22:34:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:12,990 INFO L93 Difference]: Finished difference Result 2090 states and 2937 transitions. [2019-11-27 22:34:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:12,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-27 22:34:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:12,997 INFO L225 Difference]: With dead ends: 2090 [2019-11-27 22:34:12,997 INFO L226 Difference]: Without dead ends: 1123 [2019-11-27 22:34:12,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-27 22:34:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1094. [2019-11-27 22:34:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-11-27 22:34:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1499 transitions. [2019-11-27 22:34:13,033 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1499 transitions. Word has length 172 [2019-11-27 22:34:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:13,034 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1499 transitions. [2019-11-27 22:34:13,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1499 transitions. [2019-11-27 22:34:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:34:13,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:13,038 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:13,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 22:34:13,251 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-27 22:34:13,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:13,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083108391] [2019-11-27 22:34:13,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:13,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:13,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-27 22:34:13,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-27 22:34:13,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083108391] [2019-11-27 22:34:13,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:13,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:13,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697914421] [2019-11-27 22:34:13,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:13,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:13,447 INFO L87 Difference]: Start difference. First operand 1094 states and 1499 transitions. Second operand 3 states. [2019-11-27 22:34:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:13,499 INFO L93 Difference]: Finished difference Result 2408 states and 3303 transitions. [2019-11-27 22:34:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:13,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:34:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:13,507 INFO L225 Difference]: With dead ends: 2408 [2019-11-27 22:34:13,507 INFO L226 Difference]: Without dead ends: 1349 [2019-11-27 22:34:13,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-11-27 22:34:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2019-11-27 22:34:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-11-27 22:34:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1846 transitions. [2019-11-27 22:34:13,569 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1846 transitions. Word has length 193 [2019-11-27 22:34:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:13,570 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 1846 transitions. [2019-11-27 22:34:13,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1846 transitions. [2019-11-27 22:34:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-27 22:34:13,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:13,575 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:13,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 22:34:13,789 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-27 22:34:13,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:13,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591823473] [2019-11-27 22:34:13,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:14,225 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-27 22:34:14,226 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:14,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 22:34:14,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:14 BoogieIcfgContainer [2019-11-27 22:34:14,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:14,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:14,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:14,529 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:14,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:07" (3/4) ... [2019-11-27 22:34:14,534 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:34:14,694 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:14,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:14,699 INFO L168 Benchmark]: Toolchain (without parser) took 9234.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 955.0 MB in the beginning and 990.9 MB in the end (delta: -35.9 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:14,700 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:14,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:14,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:14,701 INFO L168 Benchmark]: Boogie Preprocessor took 40.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:14,702 INFO L168 Benchmark]: RCFGBuilder took 1026.39 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:14,702 INFO L168 Benchmark]: TraceAbstraction took 7469.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.8 MB). Peak memory consumption was 237.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:14,702 INFO L168 Benchmark]: Witness Printer took 168.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 990.9 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:14,704 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.37 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. * Boogie Preprocessor took 40.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1026.39 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7469.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.8 MB). Peak memory consumption was 237.0 MB. Max. memory is 11.5 GB. * Witness Printer took 168.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 990.9 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.3s, OverallIterations: 13, TraceHistogramMax: 11, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2277 SDtfs, 1035 SDslu, 1531 SDs, 0 SdLazy, 923 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2102 GetRequests, 2086 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1349occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1258 NumberOfCodeBlocks, 1258 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2102 ConstructedInterpolants, 0 QuantifiedInterpolants, 455437 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 3388/3388 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...