./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bf79c30a8b941af2e2e52ff71757957757c98e5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bf79c30a8b941af2e2e52ff71757957757c98e5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:15:30,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:15:30,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:15:30,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:15:30,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:15:30,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:15:30,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:15:30,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:15:30,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:15:30,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:15:30,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:15:30,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:15:30,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:15:30,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:15:30,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:15:30,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:15:30,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:15:30,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:15:30,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:15:30,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:15:30,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:15:30,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:15:30,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:15:30,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:15:30,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:15:30,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:15:30,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:15:30,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:15:30,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:15:30,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:15:30,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:15:30,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:15:30,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:15:30,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:15:30,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:15:30,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:15:30,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:15:30,326 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:15:30,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:15:30,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:15:30,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:15:30,329 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:15:30,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:15:30,329 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:15:30,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:15:30,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:15:30,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:15:30,331 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:15:30,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:15:30,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:15:30,331 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:15:30,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:15:30,332 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:15:30,332 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:15:30,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:15:30,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:15:30,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:15:30,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:15:30,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:30,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:15:30,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:15:30,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:15:30,334 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:15:30,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:15:30,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:15:30,335 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bf79c30a8b941af2e2e52ff71757957757c98e5 [2019-01-11 21:15:30,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:15:30,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:15:30,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:15:30,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:15:30,410 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:15:30,410 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:30,459 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beab5af41/3f54a15ef4d042ac8db930aa7f827c4b/FLAGd2d858d9f [2019-01-11 21:15:30,905 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:15:30,907 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:30,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beab5af41/3f54a15ef4d042ac8db930aa7f827c4b/FLAGd2d858d9f [2019-01-11 21:15:31,210 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beab5af41/3f54a15ef4d042ac8db930aa7f827c4b [2019-01-11 21:15:31,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:15:31,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:15:31,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:31,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:15:31,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:15:31,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aee361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31, skipping insertion in model container [2019-01-11 21:15:31,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:15:31,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:15:31,595 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:31,599 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:15:31,664 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:31,682 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:15:31,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31 WrapperNode [2019-01-11 21:15:31,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:31,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:31,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:15:31,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:15:31,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:31,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:15:31,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:15:31,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:15:31,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... [2019-01-11 21:15:31,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:15:31,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:15:31,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:15:31,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:15:31,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:15:31,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:15:32,059 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:15:32,990 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:15:32,990 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:15:32,991 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:15:32,991 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:15:32,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:32 BoogieIcfgContainer [2019-01-11 21:15:32,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:15:32,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:15:32,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:15:32,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:15:32,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:15:31" (1/3) ... [2019-01-11 21:15:32,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29821ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:32, skipping insertion in model container [2019-01-11 21:15:32,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:31" (2/3) ... [2019-01-11 21:15:32,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29821ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:32, skipping insertion in model container [2019-01-11 21:15:32,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:32" (3/3) ... [2019-01-11 21:15:32,999 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:33,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:15:33,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:15:33,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:15:33,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:15:33,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:15:33,059 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:15:33,059 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:15:33,059 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:15:33,060 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:15:33,060 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:15:33,060 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:15:33,060 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:15:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-01-11 21:15:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:15:33,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:33,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:33,088 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-01-11 21:15:33,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:33,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:33,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:33,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:33,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:15:33,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:33,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:33,340 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-01-11 21:15:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:33,658 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-01-11 21:15:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:33,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:15:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:33,676 INFO L225 Difference]: With dead ends: 245 [2019-01-11 21:15:33,676 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 21:15:33,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 21:15:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 21:15:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 21:15:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-01-11 21:15:33,736 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-01-11 21:15:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:33,737 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-01-11 21:15:33,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-01-11 21:15:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 21:15:33,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:33,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:33,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-01-11 21:15:33,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:33,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:33,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:33,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:33,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:33,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:33,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:33,845 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-01-11 21:15:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:34,334 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-01-11 21:15:34,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:34,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-11 21:15:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:34,338 INFO L225 Difference]: With dead ends: 232 [2019-01-11 21:15:34,338 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 21:15:34,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 21:15:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-01-11 21:15:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-11 21:15:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-01-11 21:15:34,352 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-01-11 21:15:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:34,352 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-01-11 21:15:34,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-01-11 21:15:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-11 21:15:34,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:34,354 INFO L402 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-01-11 21:15:34,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:34,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-01-11 21:15:34,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:34,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:34,456 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-01-11 21:15:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:34,708 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-01-11 21:15:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:34,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-11 21:15:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:34,714 INFO L225 Difference]: With dead ends: 264 [2019-01-11 21:15:34,714 INFO L226 Difference]: Without dead ends: 147 [2019-01-11 21:15:34,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-11 21:15:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-01-11 21:15:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-11 21:15:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-01-11 21:15:34,728 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-01-11 21:15:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:34,729 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-01-11 21:15:34,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-01-11 21:15:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 21:15:34,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:34,731 INFO L402 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-01-11 21:15:34,732 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:34,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-01-11 21:15:34,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:34,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:34,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:34,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:34,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:34,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:34,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:34,857 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-01-11 21:15:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:34,901 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-01-11 21:15:34,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:34,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-11 21:15:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:34,905 INFO L225 Difference]: With dead ends: 298 [2019-01-11 21:15:34,905 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 21:15:34,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 21:15:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-01-11 21:15:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 21:15:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-01-11 21:15:34,922 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-01-11 21:15:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:34,923 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-01-11 21:15:34,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-01-11 21:15:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 21:15:34,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:34,926 INFO L402 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-01-11 21:15:34,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-01-11 21:15:34,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:34,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:15:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:35,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:35,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:35,081 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-01-11 21:15:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:35,466 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-01-11 21:15:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:35,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-11 21:15:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:35,470 INFO L225 Difference]: With dead ends: 369 [2019-01-11 21:15:35,471 INFO L226 Difference]: Without dead ends: 213 [2019-01-11 21:15:35,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-11 21:15:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-01-11 21:15:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-11 21:15:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-01-11 21:15:35,490 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-01-11 21:15:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:35,490 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-01-11 21:15:35,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-01-11 21:15:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 21:15:35,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:35,495 INFO L402 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-01-11 21:15:35,495 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-01-11 21:15:35,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:35,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:35,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:15:35,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:35,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:35,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:35,606 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-01-11 21:15:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:35,837 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-01-11 21:15:35,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:35,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-11 21:15:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:35,840 INFO L225 Difference]: With dead ends: 424 [2019-01-11 21:15:35,840 INFO L226 Difference]: Without dead ends: 228 [2019-01-11 21:15:35,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-01-11 21:15:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-01-11 21:15:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-11 21:15:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-01-11 21:15:35,859 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-01-11 21:15:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-01-11 21:15:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-01-11 21:15:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 21:15:35,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:35,862 INFO L402 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-01-11 21:15:35,862 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-01-11 21:15:35,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:35,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:35,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:35,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:15:35,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:35,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:35,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:35,997 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-01-11 21:15:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:36,182 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-01-11 21:15:36,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:36,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-01-11 21:15:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:36,186 INFO L225 Difference]: With dead ends: 463 [2019-01-11 21:15:36,186 INFO L226 Difference]: Without dead ends: 248 [2019-01-11 21:15:36,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-11 21:15:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-01-11 21:15:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-11 21:15:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-01-11 21:15:36,201 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-01-11 21:15:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:36,202 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-01-11 21:15:36,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-01-11 21:15:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 21:15:36,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:36,204 INFO L402 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-01-11 21:15:36,204 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-01-11 21:15:36,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:36,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-11 21:15:36,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:36,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:36,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:36,315 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-01-11 21:15:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:36,587 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-01-11 21:15:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:36,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-11 21:15:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:36,595 INFO L225 Difference]: With dead ends: 694 [2019-01-11 21:15:36,595 INFO L226 Difference]: Without dead ends: 458 [2019-01-11 21:15:36,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-01-11 21:15:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-01-11 21:15:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-01-11 21:15:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-01-11 21:15:36,617 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-01-11 21:15:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:36,618 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-01-11 21:15:36,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-01-11 21:15:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:15:36,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:36,624 INFO L402 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-01-11 21:15:36,624 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-01-11 21:15:36,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:36,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:36,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:36,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:36,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:36,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:36,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:36,759 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-01-11 21:15:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:37,064 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-01-11 21:15:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:37,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:15:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:37,070 INFO L225 Difference]: With dead ends: 673 [2019-01-11 21:15:37,070 INFO L226 Difference]: Without dead ends: 671 [2019-01-11 21:15:37,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-01-11 21:15:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-01-11 21:15:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-01-11 21:15:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-01-11 21:15:37,103 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-01-11 21:15:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:37,104 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-01-11 21:15:37,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-01-11 21:15:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-11 21:15:37,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:37,109 INFO L402 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-01-11 21:15:37,109 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-01-11 21:15:37,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:37,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:37,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-01-11 21:15:37,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:37,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:37,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:37,260 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-01-11 21:15:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:39,139 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-01-11 21:15:39,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:39,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-01-11 21:15:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:39,146 INFO L225 Difference]: With dead ends: 1483 [2019-01-11 21:15:39,147 INFO L226 Difference]: Without dead ends: 818 [2019-01-11 21:15:39,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-01-11 21:15:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-01-11 21:15:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-01-11 21:15:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-01-11 21:15:39,174 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-01-11 21:15:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:39,179 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-01-11 21:15:39,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-01-11 21:15:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 21:15:39,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:39,183 INFO L402 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-01-11 21:15:39,183 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-01-11 21:15:39,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:39,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:39,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-11 21:15:39,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:39,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:39,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:39,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:39,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:39,313 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-01-11 21:15:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:39,826 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-01-11 21:15:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:39,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-11 21:15:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:39,837 INFO L225 Difference]: With dead ends: 1845 [2019-01-11 21:15:39,837 INFO L226 Difference]: Without dead ends: 1015 [2019-01-11 21:15:39,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-01-11 21:15:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-01-11 21:15:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-11 21:15:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-01-11 21:15:39,864 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-01-11 21:15:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:39,865 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-01-11 21:15:39,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-01-11 21:15:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-11 21:15:39,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:39,869 INFO L402 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-01-11 21:15:39,870 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-01-11 21:15:39,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:39,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:39,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:15:39,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-01-11 21:15:40,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:40,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:40,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:40,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:40,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:40,070 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-01-11 21:15:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:40,162 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-01-11 21:15:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:40,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-01-11 21:15:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:40,172 INFO L225 Difference]: With dead ends: 2279 [2019-01-11 21:15:40,172 INFO L226 Difference]: Without dead ends: 1311 [2019-01-11 21:15:40,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-01-11 21:15:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-01-11 21:15:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-01-11 21:15:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-01-11 21:15:40,212 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-01-11 21:15:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:40,212 INFO L480 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-01-11 21:15:40,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-01-11 21:15:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 21:15:40,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:40,217 INFO L402 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-01-11 21:15:40,217 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-01-11 21:15:40,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-01-11 21:15:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:40,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:40,339 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-01-11 21:15:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:40,535 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-01-11 21:15:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:40,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-01-11 21:15:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:40,549 INFO L225 Difference]: With dead ends: 3667 [2019-01-11 21:15:40,549 INFO L226 Difference]: Without dead ends: 2365 [2019-01-11 21:15:40,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-01-11 21:15:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-01-11 21:15:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-01-11 21:15:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-01-11 21:15:40,636 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-01-11 21:15:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:40,636 INFO L480 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-01-11 21:15:40,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-01-11 21:15:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 21:15:40,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:40,644 INFO L402 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-01-11 21:15:40,644 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-01-11 21:15:40,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:40,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:40,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:40,855 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:15:41,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:15:40 BoogieIcfgContainer [2019-01-11 21:15:41,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:15:41,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:15:41,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:15:41,003 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:15:41,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:32" (3/4) ... [2019-01-11 21:15:41,009 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-11 21:15:41,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:15:41,012 INFO L168 Benchmark]: Toolchain (without parser) took 9798.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.1 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -293.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:41,015 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:41,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.25 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:41,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:41,017 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:41,021 INFO L168 Benchmark]: RCFGBuilder took 1136.34 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:41,024 INFO L168 Benchmark]: TraceAbstraction took 8009.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -227.1 MB). Peak memory consumption was 375.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:41,026 INFO L168 Benchmark]: Witness Printer took 8.40 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-01-11 21:15:41,033 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.25 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.11 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1136.34 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8009.23 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -227.1 MB). Peak memory consumption was 375.2 MB. Max. memory is 11.5 GB. * Witness Printer took 8.40 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: 606]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 354. Possible FailurePath: [L615] int __retres1 ; [L8] int s__info_callback = __VERIFIER_nondet_int(); [L9] int s__in_handshake = __VERIFIER_nondet_int(); [L10] int s__state ; [L11] int s__new_session ; [L12] int s__server ; [L13] int s__version = __VERIFIER_nondet_int(); [L14] int s__type ; [L15] int s__init_num ; [L16] int s__bbio = __VERIFIER_nondet_int(); [L17] int s__wbio = __VERIFIER_nondet_int(); [L18] int s__hit = __VERIFIER_nondet_int(); [L19] int s__rwstate ; [L20] int s__init_buf___0 ; [L21] int s__debug = __VERIFIER_nondet_int(); [L22] int s__shutdown ; [L23] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L24] int s__ctx__stats__sess_connect_renegotiate ; [L25] int s__ctx__stats__sess_connect ; [L26] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L27] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L28] int s__s3__change_cipher_spec ; [L29] int s__s3__flags ; [L30] int s__s3__delay_buf_pop_ret ; [L31] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L32] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__next_state___0 ; [L37] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L38] int s__session__cipher ; [L39] int s__session__compress_meth ; [L40] int buf ; [L41] unsigned long tmp ; [L42] unsigned long l ; [L43] int num1 ; [L44] int cb ; [L45] int ret ; [L46] int new_state ; [L47] int state ; [L48] int skip ; [L49] int tmp___0 ; [L50] int tmp___1 = __VERIFIER_nondet_int(); [L51] int tmp___2 = __VERIFIER_nondet_int(); [L52] int tmp___3 = __VERIFIER_nondet_int(); [L53] int tmp___4 = __VERIFIER_nondet_int(); [L54] int tmp___5 = __VERIFIER_nondet_int(); [L55] int tmp___6 = __VERIFIER_nondet_int(); [L56] int tmp___7 = __VERIFIER_nondet_int(); [L57] int tmp___8 = __VERIFIER_nondet_int(); [L58] int tmp___9 = __VERIFIER_nondet_int(); [L59] int blastFlag ; [L60] int ag_X ; [L61] int ag_Y = __VERIFIER_nondet_int(); [L62] int __retres59 ; [L65] s__state = 12292 [L66] blastFlag = 0 [L67] tmp = __VERIFIER_nondet_int() [L68] cb = 0 [L69] ret = -1 [L70] skip = 0 [L71] tmp___0 = 0 [L72] COND TRUE s__info_callback != 0 [L73] cb = s__info_callback [L81] s__in_handshake = s__in_handshake + 1 [L82] COND FALSE !(tmp___1 - 12288) [L92] COND TRUE 1 [L94] state = s__state [L95] COND TRUE s__state == 12292 [L198] s__new_session = 1 [L199] s__state = 4096 [L200] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L205] s__server = 0 [L206] COND TRUE cb != 0 [L211] COND FALSE !(s__version - 65280 != 768) [L217] s__type = 4096 [L218] COND FALSE !(s__init_buf___0 == 0) [L236] COND FALSE !(! tmp___4) [L242] COND FALSE !(! tmp___5) [L248] s__state = 4368 [L249] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L250] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND TRUE blastFlag == 0 [L257] blastFlag = 1 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND TRUE blastFlag == 1 [L282] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND TRUE blastFlag == 2 [L305] blastFlag = 3 [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND TRUE blastFlag == 3 [L322] blastFlag = 4 [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND FALSE !(blastFlag == 5) [L349] COND FALSE !(ret <= 0) [L354] s__state = ag_X ^ ag_Y [L355] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND FALSE !(blastFlag == 0) [L259] COND TRUE blastFlag == 4 [L260] blastFlag = 5 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND FALSE !(blastFlag == 1) [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND FALSE !(blastFlag == 2) [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND FALSE !(blastFlag == 3) [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND TRUE blastFlag == 5 [L606] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. UNSAFE Result, 7.9s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:15:43,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:15:43,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:15:43,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:15:43,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:15:43,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:15:43,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:15:43,350 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:15:43,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:15:43,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:15:43,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:15:43,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:15:43,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:15:43,359 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:15:43,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:15:43,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:15:43,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:15:43,372 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:15:43,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:15:43,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:15:43,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:15:43,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:15:43,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:15:43,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:15:43,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:15:43,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:15:43,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:15:43,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:15:43,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:15:43,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:15:43,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:15:43,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:15:43,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:15:43,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:15:43,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:15:43,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:15:43,395 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-11 21:15:43,423 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:15:43,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:15:43,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:15:43,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:15:43,428 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:15:43,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:15:43,428 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:15:43,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:15:43,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:15:43,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:15:43,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:15:43,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:15:43,429 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-11 21:15:43,429 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-11 21:15:43,430 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:15:43,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:15:43,430 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:15:43,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:15:43,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:15:43,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:15:43,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:15:43,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:15:43,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:43,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:15:43,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:15:43,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:15:43,432 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-11 21:15:43,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:15:43,432 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-11 21:15:43,432 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-11 21:15:43,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bf79c30a8b941af2e2e52ff71757957757c98e5 [2019-01-11 21:15:43,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:15:43,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:15:43,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:15:43,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:15:43,507 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:15:43,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:43,560 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2dffb11/0731f00fdbef49098771e4b49d99a3d9/FLAGc90de3c44 [2019-01-11 21:15:43,949 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:15:43,950 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:43,961 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2dffb11/0731f00fdbef49098771e4b49d99a3d9/FLAGc90de3c44 [2019-01-11 21:15:44,323 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2dffb11/0731f00fdbef49098771e4b49d99a3d9 [2019-01-11 21:15:44,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:15:44,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:15:44,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:44,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:15:44,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:15:44,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:44,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca55695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44, skipping insertion in model container [2019-01-11 21:15:44,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:44,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:15:44,393 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:15:44,723 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:44,735 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:15:44,828 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:44,843 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:15:44,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44 WrapperNode [2019-01-11 21:15:44,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:44,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:44,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:15:44,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:15:44,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:44,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:45,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:15:45,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:15:45,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:15:45,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... [2019-01-11 21:15:45,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:15:45,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:15:45,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:15:45,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:15:45,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:15:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:15:45,342 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:15:46,482 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:15:46,482 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:15:46,483 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:15:46,484 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:15:46,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:46 BoogieIcfgContainer [2019-01-11 21:15:46,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:15:46,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:15:46,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:15:46,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:15:46,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:15:44" (1/3) ... [2019-01-11 21:15:46,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a398ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:46, skipping insertion in model container [2019-01-11 21:15:46,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:44" (2/3) ... [2019-01-11 21:15:46,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a398ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:46, skipping insertion in model container [2019-01-11 21:15:46,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:46" (3/3) ... [2019-01-11 21:15:46,492 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:46,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:15:46,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:15:46,525 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:15:46,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:15:46,557 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:15:46,557 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:15:46,558 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:15:46,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:15:46,558 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:15:46,558 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:15:46,558 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:15:46,558 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:15:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-01-11 21:15:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:15:46,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:46,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:46,585 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2019-01-11 21:15:46,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:46,594 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:46,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:46,764 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:46,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:46,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:46,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:46,786 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-01-11 21:15:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:47,234 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2019-01-11 21:15:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:47,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:15:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:47,248 INFO L225 Difference]: With dead ends: 246 [2019-01-11 21:15:47,249 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 21:15:47,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 21:15:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-11 21:15:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 21:15:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-01-11 21:15:47,305 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2019-01-11 21:15:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:47,306 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-01-11 21:15:47,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-01-11 21:15:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 21:15:47,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:47,308 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:47,309 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2019-01-11 21:15:47,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:47,310 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:47,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:47,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:15:47,401 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:47,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:47,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:47,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:47,409 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-01-11 21:15:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:47,966 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2019-01-11 21:15:47,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:47,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-11 21:15:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:47,969 INFO L225 Difference]: With dead ends: 233 [2019-01-11 21:15:47,969 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 21:15:47,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 21:15:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-01-11 21:15:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 21:15:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-01-11 21:15:47,983 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-01-11 21:15:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:47,983 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-01-11 21:15:47,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-01-11 21:15:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 21:15:47,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:47,985 INFO L402 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, 1] [2019-01-11 21:15:47,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2019-01-11 21:15:47,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:47,987 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:48,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:48,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:48,080 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:15:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:48,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:48,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:48,097 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-01-11 21:15:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:48,401 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2019-01-11 21:15:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:48,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-11 21:15:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:48,405 INFO L225 Difference]: With dead ends: 265 [2019-01-11 21:15:48,405 INFO L226 Difference]: Without dead ends: 148 [2019-01-11 21:15:48,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-11 21:15:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-01-11 21:15:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-11 21:15:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-01-11 21:15:48,428 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-01-11 21:15:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:48,428 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-01-11 21:15:48,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-01-11 21:15:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:15:48,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:48,437 INFO L402 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-01-11 21:15:48,437 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2019-01-11 21:15:48,438 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:48,438 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:48,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:48,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-11 21:15:48,561 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:15:48,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:48,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:48,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:48,566 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2019-01-11 21:15:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:48,680 INFO L93 Difference]: Finished difference Result 409 states and 603 transitions. [2019-01-11 21:15:48,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:48,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:15:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:48,686 INFO L225 Difference]: With dead ends: 409 [2019-01-11 21:15:48,687 INFO L226 Difference]: Without dead ends: 275 [2019-01-11 21:15:48,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-11 21:15:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-01-11 21:15:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-01-11 21:15:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2019-01-11 21:15:48,711 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 67 [2019-01-11 21:15:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:48,712 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2019-01-11 21:15:48,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2019-01-11 21:15:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:15:48,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:48,715 INFO L402 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-01-11 21:15:48,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 511371818, now seen corresponding path program 1 times [2019-01-11 21:15:48,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:48,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:48,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 21:15:48,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:48,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:48,820 INFO L87 Difference]: Start difference. First operand 275 states and 400 transitions. Second operand 3 states. [2019-01-11 21:15:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:48,961 INFO L93 Difference]: Finished difference Result 561 states and 814 transitions. [2019-01-11 21:15:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:48,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:15:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:48,967 INFO L225 Difference]: With dead ends: 561 [2019-01-11 21:15:48,967 INFO L226 Difference]: Without dead ends: 296 [2019-01-11 21:15:48,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-01-11 21:15:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-01-11 21:15:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 21:15:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 427 transitions. [2019-01-11 21:15:49,003 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 427 transitions. Word has length 67 [2019-01-11 21:15:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:49,006 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 427 transitions. [2019-01-11 21:15:49,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 427 transitions. [2019-01-11 21:15:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:49,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:49,010 INFO L402 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, 1] [2019-01-11 21:15:49,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1005277369, now seen corresponding path program 1 times [2019-01-11 21:15:49,011 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:49,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 21:15:49,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:49,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:49,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:49,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:49,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:49,158 INFO L87 Difference]: Start difference. First operand 296 states and 427 transitions. Second operand 3 states. [2019-01-11 21:15:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:49,350 INFO L93 Difference]: Finished difference Result 608 states and 874 transitions. [2019-01-11 21:15:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:49,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:49,356 INFO L225 Difference]: With dead ends: 608 [2019-01-11 21:15:49,356 INFO L226 Difference]: Without dead ends: 322 [2019-01-11 21:15:49,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-11 21:15:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-01-11 21:15:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-11 21:15:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 460 transitions. [2019-01-11 21:15:49,382 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 460 transitions. Word has length 68 [2019-01-11 21:15:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:49,383 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 460 transitions. [2019-01-11 21:15:49,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 460 transitions. [2019-01-11 21:15:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 21:15:49,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:49,387 INFO L402 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, 1, 1] [2019-01-11 21:15:49,392 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 578472264, now seen corresponding path program 1 times [2019-01-11 21:15:49,393 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:49,394 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:49,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:49,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:15:49,532 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:49,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:49,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:49,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:49,535 INFO L87 Difference]: Start difference. First operand 322 states and 460 transitions. Second operand 3 states. [2019-01-11 21:15:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:49,820 INFO L93 Difference]: Finished difference Result 656 states and 956 transitions. [2019-01-11 21:15:49,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:49,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-11 21:15:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:49,832 INFO L225 Difference]: With dead ends: 656 [2019-01-11 21:15:49,832 INFO L226 Difference]: Without dead ends: 370 [2019-01-11 21:15:49,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-11 21:15:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 364. [2019-01-11 21:15:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-01-11 21:15:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 512 transitions. [2019-01-11 21:15:49,870 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 512 transitions. Word has length 85 [2019-01-11 21:15:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:49,870 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 512 transitions. [2019-01-11 21:15:49,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 512 transitions. [2019-01-11 21:15:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:15:49,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:49,872 INFO L402 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, 1] [2019-01-11 21:15:49,872 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2014894528, now seen corresponding path program 1 times [2019-01-11 21:15:49,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:49,873 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:49,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:49,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-11 21:15:50,046 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (9)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:15:50,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:50,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:50,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:50,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:50,052 INFO L87 Difference]: Start difference. First operand 364 states and 512 transitions. Second operand 3 states. [2019-01-11 21:15:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:51,804 INFO L93 Difference]: Finished difference Result 778 states and 1135 transitions. [2019-01-11 21:15:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:15:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:51,809 INFO L225 Difference]: With dead ends: 778 [2019-01-11 21:15:51,809 INFO L226 Difference]: Without dead ends: 450 [2019-01-11 21:15:51,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-01-11 21:15:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 444. [2019-01-11 21:15:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-01-11 21:15:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 602 transitions. [2019-01-11 21:15:51,828 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 602 transitions. Word has length 105 [2019-01-11 21:15:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:51,828 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 602 transitions. [2019-01-11 21:15:51,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 602 transitions. [2019-01-11 21:15:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:15:51,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:51,831 INFO L402 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, 1] [2019-01-11 21:15:51,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:51,832 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2019-01-11 21:15:51,832 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:51,832 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:51,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:51,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:51,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:51,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:51,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:51,996 INFO L87 Difference]: Start difference. First operand 444 states and 602 transitions. Second operand 3 states. [2019-01-11 21:15:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:52,331 INFO L93 Difference]: Finished difference Result 1026 states and 1399 transitions. [2019-01-11 21:15:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:52,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:15:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:52,336 INFO L225 Difference]: With dead ends: 1026 [2019-01-11 21:15:52,336 INFO L226 Difference]: Without dead ends: 618 [2019-01-11 21:15:52,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-01-11 21:15:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-01-11 21:15:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-01-11 21:15:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 838 transitions. [2019-01-11 21:15:52,357 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 838 transitions. Word has length 105 [2019-01-11 21:15:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:52,358 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 838 transitions. [2019-01-11 21:15:52,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 838 transitions. [2019-01-11 21:15:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:15:52,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:52,362 INFO L402 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, 1] [2019-01-11 21:15:52,363 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash -187333376, now seen corresponding path program 1 times [2019-01-11 21:15:52,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:52,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:52,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-11 21:15:52,515 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:52,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:52,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:52,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:52,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:52,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:52,519 INFO L87 Difference]: Start difference. First operand 618 states and 838 transitions. Second operand 3 states. [2019-01-11 21:15:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:52,705 INFO L93 Difference]: Finished difference Result 1225 states and 1660 transitions. [2019-01-11 21:15:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:52,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:15:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:52,710 INFO L225 Difference]: With dead ends: 1225 [2019-01-11 21:15:52,710 INFO L226 Difference]: Without dead ends: 643 [2019-01-11 21:15:52,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-11 21:15:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-01-11 21:15:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-01-11 21:15:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 868 transitions. [2019-01-11 21:15:52,731 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 868 transitions. Word has length 105 [2019-01-11 21:15:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:52,731 INFO L480 AbstractCegarLoop]: Abstraction has 643 states and 868 transitions. [2019-01-11 21:15:52,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 868 transitions. [2019-01-11 21:15:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-11 21:15:52,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:52,735 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:52,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 339712205, now seen corresponding path program 1 times [2019-01-11 21:15:52,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:52,736 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:52,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:52,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 21:15:52,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:52,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:52,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:52,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:52,918 INFO L87 Difference]: Start difference. First operand 643 states and 868 transitions. Second operand 3 states. [2019-01-11 21:15:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:53,926 INFO L93 Difference]: Finished difference Result 1320 states and 1808 transitions. [2019-01-11 21:15:53,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:53,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-11 21:15:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:53,932 INFO L225 Difference]: With dead ends: 1320 [2019-01-11 21:15:53,932 INFO L226 Difference]: Without dead ends: 713 [2019-01-11 21:15:53,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-01-11 21:15:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 700. [2019-01-11 21:15:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-01-11 21:15:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 940 transitions. [2019-01-11 21:15:53,957 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 940 transitions. Word has length 137 [2019-01-11 21:15:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:53,958 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 940 transitions. [2019-01-11 21:15:53,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 940 transitions. [2019-01-11 21:15:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-01-11 21:15:53,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:53,963 INFO L402 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, 1] [2019-01-11 21:15:53,964 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2019-01-11 21:15:53,964 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:53,964 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:54,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:54,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-01-11 21:15:54,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:54,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:54,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,182 INFO L87 Difference]: Start difference. First operand 700 states and 940 transitions. Second operand 3 states. [2019-01-11 21:15:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:54,270 INFO L93 Difference]: Finished difference Result 1573 states and 2116 transitions. [2019-01-11 21:15:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:54,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-01-11 21:15:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:54,275 INFO L225 Difference]: With dead ends: 1573 [2019-01-11 21:15:54,276 INFO L226 Difference]: Without dead ends: 909 [2019-01-11 21:15:54,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-01-11 21:15:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-01-11 21:15:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-01-11 21:15:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1220 transitions. [2019-01-11 21:15:54,300 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1220 transitions. Word has length 173 [2019-01-11 21:15:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:54,301 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 1220 transitions. [2019-01-11 21:15:54,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1220 transitions. [2019-01-11 21:15:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 21:15:54,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:54,304 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 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, 1] [2019-01-11 21:15:54,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash -934053929, now seen corresponding path program 1 times [2019-01-11 21:15:54,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:54,305 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:54,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 21:15:54,492 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:54,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:54,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:54,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,497 INFO L87 Difference]: Start difference. First operand 909 states and 1220 transitions. Second operand 3 states. [2019-01-11 21:15:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:54,648 INFO L93 Difference]: Finished difference Result 2245 states and 3045 transitions. [2019-01-11 21:15:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:54,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-01-11 21:15:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:54,657 INFO L225 Difference]: With dead ends: 2245 [2019-01-11 21:15:54,658 INFO L226 Difference]: Without dead ends: 1393 [2019-01-11 21:15:54,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-01-11 21:15:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1391. [2019-01-11 21:15:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2019-01-11 21:15:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1886 transitions. [2019-01-11 21:15:54,714 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1886 transitions. Word has length 175 [2019-01-11 21:15:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:54,715 INFO L480 AbstractCegarLoop]: Abstraction has 1391 states and 1886 transitions. [2019-01-11 21:15:54,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1886 transitions. [2019-01-11 21:15:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 21:15:54,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:54,723 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 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, 1] [2019-01-11 21:15:54,724 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 871384405, now seen corresponding path program 1 times [2019-01-11 21:15:54,725 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:54,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:54,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-01-11 21:15:54,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:54,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:54,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:54,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:54,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,944 INFO L87 Difference]: Start difference. First operand 1391 states and 1886 transitions. Second operand 3 states. [2019-01-11 21:15:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:55,074 INFO L93 Difference]: Finished difference Result 2167 states and 2924 transitions. [2019-01-11 21:15:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:55,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-01-11 21:15:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:55,082 INFO L225 Difference]: With dead ends: 2167 [2019-01-11 21:15:55,082 INFO L226 Difference]: Without dead ends: 1395 [2019-01-11 21:15:55,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-01-11 21:15:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1393. [2019-01-11 21:15:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2019-01-11 21:15:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1879 transitions. [2019-01-11 21:15:55,124 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1879 transitions. Word has length 175 [2019-01-11 21:15:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:55,124 INFO L480 AbstractCegarLoop]: Abstraction has 1393 states and 1879 transitions. [2019-01-11 21:15:55,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1879 transitions. [2019-01-11 21:15:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 21:15:55,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:55,129 INFO L402 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, 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] [2019-01-11 21:15:55,129 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash 324123553, now seen corresponding path program 1 times [2019-01-11 21:15:55,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:55,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-01-11 21:15:55,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:55,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:55,304 INFO L87 Difference]: Start difference. First operand 1393 states and 1879 transitions. Second operand 3 states. [2019-01-11 21:15:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:55,578 INFO L93 Difference]: Finished difference Result 2911 states and 3999 transitions. [2019-01-11 21:15:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:55,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-01-11 21:15:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:55,586 INFO L225 Difference]: With dead ends: 2911 [2019-01-11 21:15:55,586 INFO L226 Difference]: Without dead ends: 1577 [2019-01-11 21:15:55,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2019-01-11 21:15:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1554. [2019-01-11 21:15:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-01-11 21:15:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2075 transitions. [2019-01-11 21:15:55,632 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2075 transitions. Word has length 175 [2019-01-11 21:15:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:55,632 INFO L480 AbstractCegarLoop]: Abstraction has 1554 states and 2075 transitions. [2019-01-11 21:15:55,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2075 transitions. [2019-01-11 21:15:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-11 21:15:55,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:55,637 INFO L402 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, 1] [2019-01-11 21:15:55,637 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2019-01-11 21:15:55,638 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:15:55,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:56,329 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:15:56,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:15:56 BoogieIcfgContainer [2019-01-11 21:15:56,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:15:56,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:15:56,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:15:56,450 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:15:56,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:46" (3/4) ... [2019-01-11 21:15:56,455 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:15:56,612 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:15:56,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:15:56,616 INFO L168 Benchmark]: Toolchain (without parser) took 12289.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.2 MB). Free memory was 951.3 MB in the beginning and 991.5 MB in the end (delta: -40.2 MB). Peak memory consumption was 233.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:56,617 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:56,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.36 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:56,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:56,618 INFO L168 Benchmark]: Boogie Preprocessor took 37.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:15:56,618 INFO L168 Benchmark]: RCFGBuilder took 1439.75 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: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:56,618 INFO L168 Benchmark]: TraceAbstraction took 9963.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.1 MB). Peak memory consumption was 198.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:56,620 INFO L168 Benchmark]: Witness Printer took 162.29 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 991.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:56,623 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 516.36 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1439.75 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: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9963.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.1 MB). Peak memory consumption was 198.9 MB. Max. memory is 11.5 GB. * Witness Printer took 162.29 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 991.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 606]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L615] int __retres1 ; [L8] int s__info_callback = __VERIFIER_nondet_int(); [L9] int s__in_handshake = __VERIFIER_nondet_int(); [L10] int s__state ; [L11] int s__new_session ; [L12] int s__server ; [L13] int s__version = __VERIFIER_nondet_int(); [L14] int s__type ; [L15] int s__init_num ; [L16] int s__bbio = __VERIFIER_nondet_int(); [L17] int s__wbio = __VERIFIER_nondet_int(); [L18] int s__hit = __VERIFIER_nondet_int(); [L19] int s__rwstate ; [L20] int s__init_buf___0 ; [L21] int s__debug = __VERIFIER_nondet_int(); [L22] int s__shutdown ; [L23] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L24] int s__ctx__stats__sess_connect_renegotiate ; [L25] int s__ctx__stats__sess_connect ; [L26] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L27] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L28] int s__s3__change_cipher_spec ; [L29] int s__s3__flags ; [L30] int s__s3__delay_buf_pop_ret ; [L31] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L32] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__next_state___0 ; [L37] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L38] int s__session__cipher ; [L39] int s__session__compress_meth ; [L40] int buf ; [L41] unsigned long tmp ; [L42] unsigned long l ; [L43] int num1 ; [L44] int cb ; [L45] int ret ; [L46] int new_state ; [L47] int state ; [L48] int skip ; [L49] int tmp___0 ; [L50] int tmp___1 = __VERIFIER_nondet_int(); [L51] int tmp___2 = __VERIFIER_nondet_int(); [L52] int tmp___3 = __VERIFIER_nondet_int(); [L53] int tmp___4 = __VERIFIER_nondet_int(); [L54] int tmp___5 = __VERIFIER_nondet_int(); [L55] int tmp___6 = __VERIFIER_nondet_int(); [L56] int tmp___7 = __VERIFIER_nondet_int(); [L57] int tmp___8 = __VERIFIER_nondet_int(); [L58] int tmp___9 = __VERIFIER_nondet_int(); [L59] int blastFlag ; [L60] int ag_X ; [L61] int ag_Y = __VERIFIER_nondet_int(); [L62] int __retres59 ; [L65] s__state = 12292 [L66] blastFlag = 0 [L67] tmp = __VERIFIER_nondet_int() [L68] cb = 0 [L69] ret = -1 [L70] skip = 0 [L71] tmp___0 = 0 [L72] COND TRUE s__info_callback != 0 [L73] cb = s__info_callback [L81] s__in_handshake = s__in_handshake + 1 [L82] COND FALSE !(tmp___1 - 12288) [L92] COND TRUE 1 [L94] state = s__state [L95] COND TRUE s__state == 12292 [L198] s__new_session = 1 [L199] s__state = 4096 [L200] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L205] s__server = 0 [L206] COND TRUE cb != 0 [L211] COND FALSE !(s__version - 65280 != 768) [L217] s__type = 4096 [L218] COND FALSE !(s__init_buf___0 == 0) [L236] COND FALSE !(! tmp___4) [L242] COND FALSE !(! tmp___5) [L248] s__state = 4368 [L249] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L250] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND TRUE blastFlag == 0 [L257] blastFlag = 1 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND TRUE blastFlag == 1 [L282] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND TRUE blastFlag == 2 [L305] blastFlag = 3 [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND TRUE blastFlag == 3 [L322] blastFlag = 4 [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND FALSE !(blastFlag == 5) [L349] COND FALSE !(ret <= 0) [L354] s__state = ag_X ^ ag_Y [L355] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND FALSE !(blastFlag == 0) [L259] COND TRUE blastFlag == 4 [L260] blastFlag = 5 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND FALSE !(blastFlag == 1) [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND FALSE !(blastFlag == 2) [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND FALSE !(blastFlag == 3) [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND TRUE blastFlag == 5 [L606] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. UNSAFE Result, 9.8s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3101 SDtfs, 728 SDslu, 1809 SDs, 0 SdLazy, 792 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1532 GetRequests, 1517 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1554occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 60 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 324352 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 2563/2563 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...