./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_clnt_1_true-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_1_true-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 efb326e7cdb5d466c12dff4e56d538f4a9b94761 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_1_true-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 efb326e7cdb5d466c12dff4e56d538f4a9b94761 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:15:38,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:15:38,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:15:38,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:15:38,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:15:38,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:15:38,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:15:38,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:15:38,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:15:38,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:15:38,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:15:38,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:15:38,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:15:38,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:15:38,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:15:38,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:15:38,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:15:38,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:15:38,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:15:38,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:15:38,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:15:38,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:15:38,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:15:38,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:15:38,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:15:38,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:15:38,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:15:38,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:15:38,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:15:38,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:15:38,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:15:38,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:15:38,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:15:38,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:15:38,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:15:38,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:15:38,679 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:38,701 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:15:38,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:15:38,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:15:38,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:15:38,703 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:15:38,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:15:38,703 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:15:38,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:15:38,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:15:38,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:15:38,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:15:38,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:15:38,704 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:15:38,704 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:15:38,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:15:38,705 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:15:38,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:15:38,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:15:38,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:15:38,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:15:38,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:15:38,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:38,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:15:38,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:15:38,706 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:15:38,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:15:38,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:15:38,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:15:38,707 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 -> efb326e7cdb5d466c12dff4e56d538f4a9b94761 [2019-01-11 21:15:38,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:15:38,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:15:38,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:15:38,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:15:38,770 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:15:38,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_1_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:38,842 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e79fb35/29336d19444543c5a8ca6c87f5fa501a/FLAGa59f4dc82 [2019-01-11 21:15:39,333 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:15:39,333 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_1_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:39,345 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e79fb35/29336d19444543c5a8ca6c87f5fa501a/FLAGa59f4dc82 [2019-01-11 21:15:39,655 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e79fb35/29336d19444543c5a8ca6c87f5fa501a [2019-01-11 21:15:39,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:15:39,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:15:39,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:39,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:15:39,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:15:39,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:39" (1/1) ... [2019-01-11 21:15:39,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a838c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:39, skipping insertion in model container [2019-01-11 21:15:39,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:39" (1/1) ... [2019-01-11 21:15:39,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:15:39,737 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:15:40,018 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:40,023 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:15:40,077 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:40,093 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:15:40,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:40 WrapperNode [2019-01-11 21:15:40,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:40,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:40,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:15:40,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:15:40,105 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:40" (1/1) ... [2019-01-11 21:15:40,116 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:40" (1/1) ... [2019-01-11 21:15:40,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:40,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:15:40,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:15:40,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:15:40,249 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:40" (1/1) ... [2019-01-11 21:15:40,249 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:40" (1/1) ... [2019-01-11 21:15:40,253 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:40" (1/1) ... [2019-01-11 21:15:40,254 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:40" (1/1) ... [2019-01-11 21:15:40,263 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:40" (1/1) ... [2019-01-11 21:15:40,272 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:40" (1/1) ... [2019-01-11 21:15:40,275 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:40" (1/1) ... [2019-01-11 21:15:40,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:15:40,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:15:40,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:15:40,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:15:40,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:40" (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:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:15:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:15:40,487 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:15:41,528 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:15:41,528 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:15:41,529 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:15:41,530 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:15:41,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:41 BoogieIcfgContainer [2019-01-11 21:15:41,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:15:41,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:15:41,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:15:41,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:15:41,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:15:39" (1/3) ... [2019-01-11 21:15:41,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f77ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:41, skipping insertion in model container [2019-01-11 21:15:41,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:40" (2/3) ... [2019-01-11 21:15:41,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f77ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:41, skipping insertion in model container [2019-01-11 21:15:41,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:41" (3/3) ... [2019-01-11 21:15:41,539 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:41,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:15:41,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:15:41,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:15:41,611 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:15:41,612 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:15:41,612 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:15:41,612 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:15:41,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:15:41,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:15:41,613 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:15:41,613 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:15:41,613 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:15:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-01-11 21:15:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:15:41,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:41,642 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:41,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582915, now seen corresponding path program 1 times [2019-01-11 21:15:41,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:41,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:41,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:41,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:41,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:41,875 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:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:15:41,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:41,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:41,903 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-01-11 21:15:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:42,218 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-01-11 21:15:42,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:42,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:15:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:42,233 INFO L225 Difference]: With dead ends: 247 [2019-01-11 21:15:42,233 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 21:15:42,237 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:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 21:15:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-11 21:15:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 21:15:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-01-11 21:15:42,288 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 23 [2019-01-11 21:15:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:42,289 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-01-11 21:15:42,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-01-11 21:15:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 21:15:42,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:42,291 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:42,291 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:42,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1463943324, now seen corresponding path program 1 times [2019-01-11 21:15:42,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:42,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:42,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:42,405 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:42,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:42,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:42,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:42,410 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-01-11 21:15:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:42,945 INFO L93 Difference]: Finished difference Result 233 states and 355 transitions. [2019-01-11 21:15:42,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:42,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-11 21:15:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:42,949 INFO L225 Difference]: With dead ends: 233 [2019-01-11 21:15:42,949 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 21:15:42,951 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:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 21:15:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-11 21:15:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 21:15:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-01-11 21:15:42,965 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-01-11 21:15:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:42,965 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-01-11 21:15:42,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-01-11 21:15:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 21:15:42,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:42,968 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:42,968 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1876827341, now seen corresponding path program 1 times [2019-01-11 21:15:42,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:42,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:42,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:43,107 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:43,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:43,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:43,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:43,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:43,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:43,109 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-01-11 21:15:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:43,394 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2019-01-11 21:15:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:43,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-11 21:15:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:43,399 INFO L225 Difference]: With dead ends: 266 [2019-01-11 21:15:43,399 INFO L226 Difference]: Without dead ends: 148 [2019-01-11 21:15:43,400 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:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-11 21:15:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-01-11 21:15:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-11 21:15:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-01-11 21:15:43,413 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-01-11 21:15:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:43,414 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-01-11 21:15:43,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-01-11 21:15:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:15:43,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:43,417 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:43,417 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -708368503, now seen corresponding path program 1 times [2019-01-11 21:15:43,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:43,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:43,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:43,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:43,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:43,563 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:43,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:43,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:43,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:43,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:43,565 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2019-01-11 21:15:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:43,934 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-01-11 21:15:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:43,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:15:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:43,938 INFO L225 Difference]: With dead ends: 330 [2019-01-11 21:15:43,938 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 21:15:43,939 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:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 21:15:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2019-01-11 21:15:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 21:15:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2019-01-11 21:15:43,964 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2019-01-11 21:15:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:43,965 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2019-01-11 21:15:43,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2019-01-11 21:15:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:15:43,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:43,974 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:43,975 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1781160459, now seen corresponding path program 1 times [2019-01-11 21:15:43,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:43,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:43,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:43,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:43,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:44,138 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:44,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:44,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:44,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:44,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:44,141 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand 3 states. [2019-01-11 21:15:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:44,401 INFO L93 Difference]: Finished difference Result 384 states and 549 transitions. [2019-01-11 21:15:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:44,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:15:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:44,404 INFO L225 Difference]: With dead ends: 384 [2019-01-11 21:15:44,404 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 21:15:44,406 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:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 21:15:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-01-11 21:15:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-11 21:15:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2019-01-11 21:15:44,419 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2019-01-11 21:15:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:44,419 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2019-01-11 21:15:44,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2019-01-11 21:15:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:15:44,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:44,422 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] [2019-01-11 21:15:44,422 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1647185185, now seen corresponding path program 1 times [2019-01-11 21:15:44,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:44,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:44,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:44,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:44,520 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:44,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:44,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:44,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:44,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:44,525 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 3 states. [2019-01-11 21:15:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:44,702 INFO L93 Difference]: Finished difference Result 423 states and 599 transitions. [2019-01-11 21:15:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:44,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:15:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:44,707 INFO L225 Difference]: With dead ends: 423 [2019-01-11 21:15:44,707 INFO L226 Difference]: Without dead ends: 228 [2019-01-11 21:15:44,708 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:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-01-11 21:15:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2019-01-11 21:15:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 21:15:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2019-01-11 21:15:44,716 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2019-01-11 21:15:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:44,716 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2019-01-11 21:15:44,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2019-01-11 21:15:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 21:15:44,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:44,719 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] [2019-01-11 21:15:44,719 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:44,720 INFO L82 PathProgramCache]: Analyzing trace with hash -629532647, now seen corresponding path program 1 times [2019-01-11 21:15:44,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:44,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:44,807 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:44,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:44,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:44,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:44,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:44,808 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand 3 states. [2019-01-11 21:15:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:44,893 INFO L93 Difference]: Finished difference Result 655 states and 906 transitions. [2019-01-11 21:15:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:44,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-11 21:15:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:44,904 INFO L225 Difference]: With dead ends: 655 [2019-01-11 21:15:44,907 INFO L226 Difference]: Without dead ends: 439 [2019-01-11 21:15:44,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:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-11 21:15:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-01-11 21:15:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-01-11 21:15:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 605 transitions. [2019-01-11 21:15:44,925 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 605 transitions. Word has length 103 [2019-01-11 21:15:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:44,926 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 605 transitions. [2019-01-11 21:15:44,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 605 transitions. [2019-01-11 21:15:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:15:44,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:44,929 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:44,929 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -548026749, now seen corresponding path program 1 times [2019-01-11 21:15:44,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:44,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:45,079 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:45,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:45,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:45,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:45,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:45,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:45,081 INFO L87 Difference]: Start difference. First operand 439 states and 605 transitions. Second operand 3 states. [2019-01-11 21:15:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:45,263 INFO L93 Difference]: Finished difference Result 655 states and 903 transitions. [2019-01-11 21:15:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:45,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:15:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:45,267 INFO L225 Difference]: With dead ends: 655 [2019-01-11 21:15:45,267 INFO L226 Difference]: Without dead ends: 653 [2019-01-11 21:15:45,268 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:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-01-11 21:15:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-01-11 21:15:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-01-11 21:15:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 901 transitions. [2019-01-11 21:15:45,286 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 901 transitions. Word has length 105 [2019-01-11 21:15:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:45,286 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 901 transitions. [2019-01-11 21:15:45,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 901 transitions. [2019-01-11 21:15:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 21:15:45,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:45,289 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:45,289 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 51406530, now seen corresponding path program 1 times [2019-01-11 21:15:45,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:45,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:45,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:15:45,305 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:15:45,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:15:45,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:45,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:45,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:45,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:45,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:45,494 INFO L87 Difference]: Start difference. First operand 653 states and 901 transitions. Second operand 3 states. [2019-01-11 21:15:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:46,245 INFO L93 Difference]: Finished difference Result 1377 states and 1926 transitions. [2019-01-11 21:15:46,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:46,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-01-11 21:15:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:46,251 INFO L225 Difference]: With dead ends: 1377 [2019-01-11 21:15:46,251 INFO L226 Difference]: Without dead ends: 733 [2019-01-11 21:15:46,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-01-11 21:15:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 722. [2019-01-11 21:15:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-01-11 21:15:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 985 transitions. [2019-01-11 21:15:46,275 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 985 transitions. Word has length 130 [2019-01-11 21:15:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:46,276 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 985 transitions. [2019-01-11 21:15:46,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 985 transitions. [2019-01-11 21:15:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-11 21:15:46,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:46,280 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:46,280 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash -837503083, now seen corresponding path program 1 times [2019-01-11 21:15:46,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:15:46,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:15:46,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:46,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:46,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:15:46,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:15:46,305 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:15:46,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:15:46,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:15:46,806 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:15:46,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:15:46 BoogieIcfgContainer [2019-01-11 21:15:46,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:15:46,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:15:46,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:15:46,955 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:15:46,957 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:41" (3/4) ... [2019-01-11 21:15:46,962 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-11 21:15:46,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:15:46,963 INFO L168 Benchmark]: Toolchain (without parser) took 7300.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -102.6 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:46,966 INFO L168 Benchmark]: CDTParser took 0.25 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:46,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 936.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:46,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:46,968 INFO L168 Benchmark]: Boogie Preprocessor took 40.49 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:46,972 INFO L168 Benchmark]: RCFGBuilder took 1250.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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:46,973 INFO L168 Benchmark]: TraceAbstraction took 5422.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:15:46,974 INFO L168 Benchmark]: Witness Printer took 7.46 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:46,981 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.25 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 429.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 936.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 145.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.49 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1250.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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5422.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.46 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 619]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 362, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L628] 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 = __VERIFIER_nondet_int(); [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 ; [L51] int tmp___2 ; [L52] int tmp___3 ; [L53] int tmp___4 ; [L54] int tmp___5 ; [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 ; [L62] int ag_Z ; [L63] unsigned int ag_V ; [L64] unsigned int ag_W ; [L65] int __retres62 ; [L68] ag_V = 2U [L69] ag_W = 5U [L70] s__state = 12292 [L71] blastFlag = 0 [L72] tmp = __VERIFIER_nondet_int() [L73] cb = 0 [L74] ret = -1 [L75] skip = 0 [L76] tmp___0 = 0 [L77] COND TRUE s__info_callback != 0 [L78] cb = s__info_callback [L86] s__in_handshake = s__in_handshake + 1 [L87] tmp___1 = __VERIFIER_nondet_int() [L88] COND FALSE !(tmp___1 & 12288) [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L205] s__new_session = 1 [L206] s__state = 4096 [L207] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L212] s__server = 0 [L213] COND TRUE cb != 0 [L218] COND FALSE !((s__version & 65280) != 768) [L224] s__type = 4096 [L225] COND FALSE !(s__init_buf___0 == 0) [L244] tmp___4 = __VERIFIER_nondet_int() [L245] COND FALSE !(! tmp___4) [L251] tmp___5 = __VERIFIER_nondet_int() [L252] COND FALSE !(! tmp___5) [L258] s__state = 4368 [L259] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L260] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L264] s__shutdown = 0 [L265] ret = __VERIFIER_nondet_int() [L266] COND TRUE blastFlag == 0 [L267] blastFlag = 1 [L271] COND FALSE !(ret <= 0) [L276] s__state = 4384 [L277] s__init_num = 0 [L278] COND TRUE s__bbio != s__wbio [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L297] COND FALSE !(\read(s__hit)) [L300] s__state = 4400 [L302] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND TRUE s__state == 4400 [L306] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L309] ret = __VERIFIER_nondet_int() [L310] COND TRUE blastFlag == 2 [L311] blastFlag = 3 [L315] COND FALSE !(ret <= 0) [L321] s__state = 4416 [L322] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND TRUE s__state == 4416 [L326] ret = __VERIFIER_nondet_int() [L327] COND TRUE blastFlag == 3 [L328] blastFlag = 4 [L332] COND FALSE !(ret <= 0) [L337] s__state = 4432 [L338] s__init_num = 0 [L339] COND FALSE !(! tmp___6) [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L348] ret = __VERIFIER_nondet_int() [L349] COND FALSE !(blastFlag == 5) [L354] COND FALSE !(ret <= 0) [L359] s__state = 4448 [L360] ag_X = 44 [L361] ag_Y = 100 [L362] ag_Z = ag_V << ag_W [L363] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND FALSE !(s__state == 4432) [L144] COND FALSE !(s__state == 4433) [L147] COND TRUE s__state == 4448 [L367] ret = __VERIFIER_nondet_int() [L368] COND TRUE blastFlag == 4 [L369] blastFlag = 5 [L373] COND FALSE !(ret <= 0) [L378] COND TRUE \read(s__s3__tmp__cert_req) [L379] s__state = ag_X * ag_Y + ag_Z [L383] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L348] ret = __VERIFIER_nondet_int() [L349] COND TRUE blastFlag == 5 [L619] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. UNSAFE Result, 5.3s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1540 SDtfs, 402 SDslu, 859 SDs, 0 SdLazy, 738 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 83783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 659/659 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:49,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:15:49,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:15:49,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:15:49,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:15:49,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:15:49,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:15:49,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:15:49,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:15:49,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:15:49,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:15:49,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:15:49,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:15:49,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:15:49,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:15:49,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:15:49,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:15:49,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:15:49,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:15:49,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:15:49,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:15:49,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:15:49,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:15:49,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:15:49,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:15:49,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:15:49,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:15:49,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:15:49,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:15:49,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:15:49,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:15:49,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:15:49,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:15:49,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:15:49,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:15:49,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:15:49,313 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:49,329 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:15:49,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:15:49,331 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:15:49,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:15:49,331 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:15:49,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:15:49,332 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:15:49,332 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:15:49,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:15:49,332 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:15:49,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:15:49,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:15:49,334 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-11 21:15:49,334 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-11 21:15:49,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:15:49,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:15:49,335 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:15:49,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:15:49,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:15:49,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:15:49,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:15:49,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:15:49,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:15:49,336 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:15:49,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:15:49,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:15:49,337 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-11 21:15:49,337 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:15:49,337 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-11 21:15:49,337 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-11 21:15:49,338 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 -> efb326e7cdb5d466c12dff4e56d538f4a9b94761 [2019-01-11 21:15:49,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:15:49,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:15:49,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:15:49,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:15:49,394 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:15:49,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_1_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:49,453 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846da3747/ff6d25bdd7f545d8a2e68b08d633cea6/FLAGb951f0765 [2019-01-11 21:15:49,914 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:15:49,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_1_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:49,935 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846da3747/ff6d25bdd7f545d8a2e68b08d633cea6/FLAGb951f0765 [2019-01-11 21:15:50,266 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846da3747/ff6d25bdd7f545d8a2e68b08d633cea6 [2019-01-11 21:15:50,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:15:50,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:15:50,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:50,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:15:50,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:15:50,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:50" (1/1) ... [2019-01-11 21:15:50,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db5133f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:50, skipping insertion in model container [2019-01-11 21:15:50,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:15:50" (1/1) ... [2019-01-11 21:15:50,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:15:50,337 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:15:50,617 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:50,623 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:15:50,702 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:15:50,725 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:15:50,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:50 WrapperNode [2019-01-11 21:15:50,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:15:50,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:50,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:15:50,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:15:50,736 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:50" (1/1) ... [2019-01-11 21:15:50,747 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:50" (1/1) ... [2019-01-11 21:15:50,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:15:50,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:15:50,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:15:50,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:15:50,890 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:50" (1/1) ... [2019-01-11 21:15:50,890 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:50" (1/1) ... [2019-01-11 21:15:50,898 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:50" (1/1) ... [2019-01-11 21:15:50,899 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:50" (1/1) ... [2019-01-11 21:15:50,922 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:50" (1/1) ... [2019-01-11 21:15:50,938 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:50" (1/1) ... [2019-01-11 21:15:50,945 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:50" (1/1) ... [2019-01-11 21:15:50,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:15:50,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:15:50,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:15:50,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:15:50,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:50" (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:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:15:51,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:15:51,197 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:15:52,136 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:15:52,136 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:15:52,137 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:15:52,138 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:15:52,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:52 BoogieIcfgContainer [2019-01-11 21:15:52,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:15:52,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:15:52,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:15:52,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:15:52,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:15:50" (1/3) ... [2019-01-11 21:15:52,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a801620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:52, skipping insertion in model container [2019-01-11 21:15:52,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:15:50" (2/3) ... [2019-01-11 21:15:52,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a801620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:15:52, skipping insertion in model container [2019-01-11 21:15:52,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:15:52" (3/3) ... [2019-01-11 21:15:52,147 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:15:52,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:15:52,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:15:52,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:15:52,214 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:15:52,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:15:52,216 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:15:52,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:15:52,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:15:52,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:15:52,217 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:15:52,217 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:15:52,217 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:15:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-11 21:15:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:15:52,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:52,246 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:52,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1457700992, now seen corresponding path program 1 times [2019-01-11 21:15:52,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:52,257 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:52,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:52,381 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:52,382 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:52,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:52,404 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-11 21:15:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:52,912 INFO L93 Difference]: Finished difference Result 248 states and 423 transitions. [2019-01-11 21:15:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:52,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:15:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:52,937 INFO L225 Difference]: With dead ends: 248 [2019-01-11 21:15:52,937 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 21:15:52,943 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:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 21:15:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-11 21:15:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 21:15:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-01-11 21:15:53,019 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 24 [2019-01-11 21:15:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:53,021 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-01-11 21:15:53,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-01-11 21:15:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 21:15:53,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:53,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:53,027 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1997570754, now seen corresponding path program 1 times [2019-01-11 21:15:53,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:53,031 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:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:53,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:53,198 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:53,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:53,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:53,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:53,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:53,207 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-01-11 21:15:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:53,793 INFO L93 Difference]: Finished difference Result 234 states and 356 transitions. [2019-01-11 21:15:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:53,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-11 21:15:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:53,796 INFO L225 Difference]: With dead ends: 234 [2019-01-11 21:15:53,796 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 21:15:53,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 21:15:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-01-11 21:15:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-11 21:15:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-01-11 21:15:53,810 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 37 [2019-01-11 21:15:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:53,811 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-01-11 21:15:53,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-01-11 21:15:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 21:15:53,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:53,814 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, 1] [2019-01-11 21:15:53,814 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:53,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1599062901, now seen corresponding path program 1 times [2019-01-11 21:15:53,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:53,816 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:53,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:53,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:53,919 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:53,919 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:53,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:53,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:53,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:53,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:53,932 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-01-11 21:15:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:54,252 INFO L93 Difference]: Finished difference Result 267 states and 402 transitions. [2019-01-11 21:15:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:54,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-11 21:15:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:54,256 INFO L225 Difference]: With dead ends: 267 [2019-01-11 21:15:54,256 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 21:15:54,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 21:15:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-01-11 21:15:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-11 21:15:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-01-11 21:15:54,270 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 51 [2019-01-11 21:15:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:54,271 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-01-11 21:15:54,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-01-11 21:15:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:54,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:54,275 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:54,275 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash -771507572, now seen corresponding path program 1 times [2019-01-11 21:15:54,277 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:54,278 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:54,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:54,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:54,453 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:54,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:54,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:54,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:54,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:54,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,462 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-01-11 21:15:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:54,594 INFO L93 Difference]: Finished difference Result 412 states and 606 transitions. [2019-01-11 21:15:54,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:54,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:54,601 INFO L225 Difference]: With dead ends: 412 [2019-01-11 21:15:54,601 INFO L226 Difference]: Without dead ends: 277 [2019-01-11 21:15:54,603 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:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-11 21:15:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-01-11 21:15:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-11 21:15:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 402 transitions. [2019-01-11 21:15:54,649 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 402 transitions. Word has length 68 [2019-01-11 21:15:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:54,649 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 402 transitions. [2019-01-11 21:15:54,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 402 transitions. [2019-01-11 21:15:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:54,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:54,659 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:54,660 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -630958962, now seen corresponding path program 1 times [2019-01-11 21:15:54,661 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:54,661 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:54,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:54,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:54,782 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:54,783 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:54,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:54,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,790 INFO L87 Difference]: Start difference. First operand 277 states and 402 transitions. Second operand 3 states. [2019-01-11 21:15:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:54,847 INFO L93 Difference]: Finished difference Result 565 states and 818 transitions. [2019-01-11 21:15:54,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:54,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:54,851 INFO L225 Difference]: With dead ends: 565 [2019-01-11 21:15:54,852 INFO L226 Difference]: Without dead ends: 298 [2019-01-11 21:15:54,853 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:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-11 21:15:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-01-11 21:15:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:15:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 429 transitions. [2019-01-11 21:15:54,869 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 429 transitions. Word has length 68 [2019-01-11 21:15:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:54,870 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 429 transitions. [2019-01-11 21:15:54,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 429 transitions. [2019-01-11 21:15:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 21:15:54,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:54,873 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:54,873 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -207312240, now seen corresponding path program 1 times [2019-01-11 21:15:54,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:54,874 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:54,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:54,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:54,990 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:54,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:54,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:54,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:54,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:54,994 INFO L87 Difference]: Start difference. First operand 298 states and 429 transitions. Second operand 3 states. [2019-01-11 21:15:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:55,062 INFO L93 Difference]: Finished difference Result 613 states and 879 transitions. [2019-01-11 21:15:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:55,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-11 21:15:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:55,066 INFO L225 Difference]: With dead ends: 613 [2019-01-11 21:15:55,066 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 21:15:55,067 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:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 21:15:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-01-11 21:15:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-11 21:15:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 463 transitions. [2019-01-11 21:15:55,081 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 463 transitions. Word has length 68 [2019-01-11 21:15:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:55,081 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 463 transitions. [2019-01-11 21:15:55,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 463 transitions. [2019-01-11 21:15:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 21:15:55,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:55,084 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, 1] [2019-01-11 21:15:55,084 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash -745334804, now seen corresponding path program 1 times [2019-01-11 21:15:55,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:55,086 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:55,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:55,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:55,199 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:55,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:55,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:55,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:55,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:55,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:55,204 INFO L87 Difference]: Start difference. First operand 325 states and 463 transitions. Second operand 3 states. [2019-01-11 21:15:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:55,741 INFO L93 Difference]: Finished difference Result 661 states and 961 transitions. [2019-01-11 21:15:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:55,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-11 21:15:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:55,752 INFO L225 Difference]: With dead ends: 661 [2019-01-11 21:15:55,753 INFO L226 Difference]: Without dead ends: 373 [2019-01-11 21:15:55,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-01-11 21:15:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 367. [2019-01-11 21:15:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 21:15:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 515 transitions. [2019-01-11 21:15:55,771 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 515 transitions. Word has length 86 [2019-01-11 21:15:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:55,772 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 515 transitions. [2019-01-11 21:15:55,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 515 transitions. [2019-01-11 21:15:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:15:55,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:55,775 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, 1] [2019-01-11 21:15:55,775 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash 944105636, now seen corresponding path program 1 times [2019-01-11 21:15:55,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:55,776 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:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:55,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:55,937 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:55,937 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:55,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:55,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:55,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:55,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:55,946 INFO L87 Difference]: Start difference. First operand 367 states and 515 transitions. Second operand 3 states. [2019-01-11 21:15:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:56,538 INFO L93 Difference]: Finished difference Result 783 states and 1140 transitions. [2019-01-11 21:15:56,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:56,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:15:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:56,544 INFO L225 Difference]: With dead ends: 783 [2019-01-11 21:15:56,545 INFO L226 Difference]: Without dead ends: 453 [2019-01-11 21:15:56,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-01-11 21:15:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 447. [2019-01-11 21:15:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-11 21:15:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 605 transitions. [2019-01-11 21:15:56,573 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 605 transitions. Word has length 106 [2019-01-11 21:15:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:56,573 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 605 transitions. [2019-01-11 21:15:56,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 605 transitions. [2019-01-11 21:15:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:15:56,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:56,579 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, 1] [2019-01-11 21:15:56,579 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1389287002, now seen corresponding path program 1 times [2019-01-11 21:15:56,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:56,582 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:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:56,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:56,761 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:56,762 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:56,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:56,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:56,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:56,768 INFO L87 Difference]: Start difference. First operand 447 states and 605 transitions. Second operand 3 states. [2019-01-11 21:15:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:57,018 INFO L93 Difference]: Finished difference Result 1048 states and 1426 transitions. [2019-01-11 21:15:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:57,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:15:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:57,024 INFO L225 Difference]: With dead ends: 1048 [2019-01-11 21:15:57,024 INFO L226 Difference]: Without dead ends: 638 [2019-01-11 21:15:57,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-01-11 21:15:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-01-11 21:15:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-01-11 21:15:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 863 transitions. [2019-01-11 21:15:57,047 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 863 transitions. Word has length 106 [2019-01-11 21:15:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:57,048 INFO L480 AbstractCegarLoop]: Abstraction has 638 states and 863 transitions. [2019-01-11 21:15:57,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 863 transitions. [2019-01-11 21:15:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:15:57,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:57,051 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, 1] [2019-01-11 21:15:57,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1523300508, now seen corresponding path program 1 times [2019-01-11 21:15:57,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:57,055 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:57,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:57,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:57,265 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:57,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:57,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:57,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:57,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:57,272 INFO L87 Difference]: Start difference. First operand 638 states and 863 transitions. Second operand 3 states. [2019-01-11 21:15:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:57,467 INFO L93 Difference]: Finished difference Result 1264 states and 1709 transitions. [2019-01-11 21:15:57,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:57,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:15:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:57,482 INFO L225 Difference]: With dead ends: 1264 [2019-01-11 21:15:57,482 INFO L226 Difference]: Without dead ends: 663 [2019-01-11 21:15:57,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-01-11 21:15:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-01-11 21:15:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-01-11 21:15:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 893 transitions. [2019-01-11 21:15:57,515 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 893 transitions. Word has length 106 [2019-01-11 21:15:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:57,516 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 893 transitions. [2019-01-11 21:15:57,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 893 transitions. [2019-01-11 21:15:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-11 21:15:57,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:57,522 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:57,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash 888668032, now seen corresponding path program 1 times [2019-01-11 21:15:57,525 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:57,525 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:57,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:57,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:15:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-11 21:15:57,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:15:57,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:15:57,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:15:57,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:15:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:15:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:57,707 INFO L87 Difference]: Start difference. First operand 663 states and 893 transitions. Second operand 3 states. [2019-01-11 21:15:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:15:59,232 INFO L93 Difference]: Finished difference Result 1369 states and 1875 transitions. [2019-01-11 21:15:59,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:15:59,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-01-11 21:15:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:15:59,238 INFO L225 Difference]: With dead ends: 1369 [2019-01-11 21:15:59,238 INFO L226 Difference]: Without dead ends: 743 [2019-01-11 21:15:59,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:15:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-01-11 21:15:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 732. [2019-01-11 21:15:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-01-11 21:15:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 977 transitions. [2019-01-11 21:15:59,261 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 977 transitions. Word has length 131 [2019-01-11 21:15:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:15:59,262 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 977 transitions. [2019-01-11 21:15:59,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:15:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 977 transitions. [2019-01-11 21:15:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-11 21:15:59,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:15:59,266 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:15:59,266 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:15:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:15:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2026196904, now seen corresponding path program 1 times [2019-01-11 21:15:59,267 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:15:59,267 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:59,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:15:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:15:59,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 164 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-11 21:16:00,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:16:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 164 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-11 21:16:00,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:16:00,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-11 21:16:00,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 21:16:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 21:16:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:16:00,601 INFO L87 Difference]: Start difference. First operand 732 states and 977 transitions. Second operand 8 states. [2019-01-11 21:16:00,832 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-11 21:16:04,313 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 21:16:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:04,927 INFO L93 Difference]: Finished difference Result 1888 states and 2578 transitions. [2019-01-11 21:16:04,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 21:16:04,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-01-11 21:16:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:04,936 INFO L225 Difference]: With dead ends: 1888 [2019-01-11 21:16:04,936 INFO L226 Difference]: Without dead ends: 1193 [2019-01-11 21:16:04,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 21:16:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-01-11 21:16:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1064. [2019-01-11 21:16:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-01-11 21:16:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1459 transitions. [2019-01-11 21:16:04,982 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1459 transitions. Word has length 152 [2019-01-11 21:16:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:04,982 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1459 transitions. [2019-01-11 21:16:04,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 21:16:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1459 transitions. [2019-01-11 21:16:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-11 21:16:04,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:04,988 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:04,988 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1473884731, now seen corresponding path program 1 times [2019-01-11 21:16:04,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:04,990 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:16:05,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:05,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-01-11 21:16:05,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:16:05,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:05,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:05,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:05,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:05,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:05,189 INFO L87 Difference]: Start difference. First operand 1064 states and 1459 transitions. Second operand 3 states. [2019-01-11 21:16:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:06,242 INFO L93 Difference]: Finished difference Result 2206 states and 3087 transitions. [2019-01-11 21:16:06,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:06,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-01-11 21:16:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:06,249 INFO L225 Difference]: With dead ends: 2206 [2019-01-11 21:16:06,249 INFO L226 Difference]: Without dead ends: 1200 [2019-01-11 21:16:06,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 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:16:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-01-11 21:16:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1188. [2019-01-11 21:16:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-01-11 21:16:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1603 transitions. [2019-01-11 21:16:06,290 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1603 transitions. Word has length 153 [2019-01-11 21:16:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:06,291 INFO L480 AbstractCegarLoop]: Abstraction has 1188 states and 1603 transitions. [2019-01-11 21:16:06,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1603 transitions. [2019-01-11 21:16:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-11 21:16:06,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:06,297 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:06,297 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1438144605, now seen corresponding path program 1 times [2019-01-11 21:16:06,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:06,298 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:16:06,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:06,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-01-11 21:16:06,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:16:06,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:06,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:06,484 INFO L87 Difference]: Start difference. First operand 1188 states and 1603 transitions. Second operand 3 states. [2019-01-11 21:16:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:06,574 INFO L93 Difference]: Finished difference Result 3388 states and 4589 transitions. [2019-01-11 21:16:06,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:06,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-01-11 21:16:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:06,586 INFO L225 Difference]: With dead ends: 3388 [2019-01-11 21:16:06,587 INFO L226 Difference]: Without dead ends: 2258 [2019-01-11 21:16:06,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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:16:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-01-11 21:16:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2040. [2019-01-11 21:16:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2019-01-11 21:16:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2754 transitions. [2019-01-11 21:16:06,660 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2754 transitions. Word has length 183 [2019-01-11 21:16:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:06,661 INFO L480 AbstractCegarLoop]: Abstraction has 2040 states and 2754 transitions. [2019-01-11 21:16:06,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2754 transitions. [2019-01-11 21:16:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-11 21:16:06,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:06,668 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:06,668 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1304131099, now seen corresponding path program 1 times [2019-01-11 21:16:06,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:06,671 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:16:06,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:06,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-11 21:16:06,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (16)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:16:06,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:06,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:06,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:06,888 INFO L87 Difference]: Start difference. First operand 2040 states and 2754 transitions. Second operand 3 states. [2019-01-11 21:16:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:07,718 INFO L93 Difference]: Finished difference Result 4292 states and 5913 transitions. [2019-01-11 21:16:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-01-11 21:16:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:07,731 INFO L225 Difference]: With dead ends: 4292 [2019-01-11 21:16:07,731 INFO L226 Difference]: Without dead ends: 2310 [2019-01-11 21:16:07,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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:16:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-01-11 21:16:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2296. [2019-01-11 21:16:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-01-11 21:16:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3045 transitions. [2019-01-11 21:16:07,804 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3045 transitions. Word has length 183 [2019-01-11 21:16:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:07,804 INFO L480 AbstractCegarLoop]: Abstraction has 2296 states and 3045 transitions. [2019-01-11 21:16:07,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3045 transitions. [2019-01-11 21:16:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-11 21:16:07,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:07,811 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:07,812 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash 724153907, now seen corresponding path program 1 times [2019-01-11 21:16:07,815 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:07,816 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:16:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:07,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-11 21:16:08,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:16:08,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:08,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:08,044 INFO L87 Difference]: Start difference. First operand 2296 states and 3045 transitions. Second operand 3 states. [2019-01-11 21:16:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:08,304 INFO L93 Difference]: Finished difference Result 4680 states and 6273 transitions. [2019-01-11 21:16:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:08,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-01-11 21:16:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:08,313 INFO L225 Difference]: With dead ends: 4680 [2019-01-11 21:16:08,314 INFO L226 Difference]: Without dead ends: 2442 [2019-01-11 21:16:08,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 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:16:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-01-11 21:16:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2428. [2019-01-11 21:16:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-01-11 21:16:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3197 transitions. [2019-01-11 21:16:08,387 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3197 transitions. Word has length 207 [2019-01-11 21:16:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:08,388 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 3197 transitions. [2019-01-11 21:16:08,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3197 transitions. [2019-01-11 21:16:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-11 21:16:08,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:08,395 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:08,396 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1349903484, now seen corresponding path program 1 times [2019-01-11 21:16:08,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:08,398 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:16:08,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:08,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-01-11 21:16:08,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:16:08,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:08,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:08,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:08,591 INFO L87 Difference]: Start difference. First operand 2428 states and 3197 transitions. Second operand 3 states. [2019-01-11 21:16:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:08,888 INFO L93 Difference]: Finished difference Result 5071 states and 6816 transitions. [2019-01-11 21:16:08,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:08,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-01-11 21:16:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:08,900 INFO L225 Difference]: With dead ends: 5071 [2019-01-11 21:16:08,900 INFO L226 Difference]: Without dead ends: 2701 [2019-01-11 21:16:08,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 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:16:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-01-11 21:16:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2687. [2019-01-11 21:16:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-01-11 21:16:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3491 transitions. [2019-01-11 21:16:08,978 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3491 transitions. Word has length 218 [2019-01-11 21:16:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:08,979 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 3491 transitions. [2019-01-11 21:16:08,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3491 transitions. [2019-01-11 21:16:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-11 21:16:08,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:08,988 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,988 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1407048053, now seen corresponding path program 1 times [2019-01-11 21:16:08,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:08,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:16:09,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:09,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-01-11 21:16:09,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (19)] Exception during sending of exit command (exit): Broken pipe [2019-01-11 21:16:09,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:09,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:09,157 INFO L87 Difference]: Start difference. First operand 2687 states and 3491 transitions. Second operand 3 states. [2019-01-11 21:16:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:09,450 INFO L93 Difference]: Finished difference Result 5610 states and 7446 transitions. [2019-01-11 21:16:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:09,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-01-11 21:16:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:09,463 INFO L225 Difference]: With dead ends: 5610 [2019-01-11 21:16:09,463 INFO L226 Difference]: Without dead ends: 2981 [2019-01-11 21:16:09,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 252 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:16:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-01-11 21:16:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2974. [2019-01-11 21:16:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-01-11 21:16:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3813 transitions. [2019-01-11 21:16:09,544 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3813 transitions. Word has length 254 [2019-01-11 21:16:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:09,545 INFO L480 AbstractCegarLoop]: Abstraction has 2974 states and 3813 transitions. [2019-01-11 21:16:09,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3813 transitions. [2019-01-11 21:16:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-11 21:16:09,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:09,554 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:09,554 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1463744687, now seen corresponding path program 1 times [2019-01-11 21:16:09,556 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:09,556 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:16:09,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:09,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-01-11 21:16:09,769 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:16:09,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:09,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:09,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:09,771 INFO L87 Difference]: Start difference. First operand 2974 states and 3813 transitions. Second operand 3 states. [2019-01-11 21:16:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:09,902 INFO L93 Difference]: Finished difference Result 8491 states and 10932 transitions. [2019-01-11 21:16:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:09,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-01-11 21:16:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:09,921 INFO L225 Difference]: With dead ends: 8491 [2019-01-11 21:16:09,921 INFO L226 Difference]: Without dead ends: 5575 [2019-01-11 21:16:09,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 253 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:16:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2019-01-11 21:16:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 5573. [2019-01-11 21:16:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5573 states. [2019-01-11 21:16:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 7172 transitions. [2019-01-11 21:16:10,053 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 7172 transitions. Word has length 255 [2019-01-11 21:16:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:10,054 INFO L480 AbstractCegarLoop]: Abstraction has 5573 states and 7172 transitions. [2019-01-11 21:16:10,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 7172 transitions. [2019-01-11 21:16:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-11 21:16:10,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:10,067 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:10,067 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1523402678, now seen corresponding path program 1 times [2019-01-11 21:16:10,070 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:16:10,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:10,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-01-11 21:16:10,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:16:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-01-11 21:16:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:16:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-11 21:16:10,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:16:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:16:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:16:10,382 INFO L87 Difference]: Start difference. First operand 5573 states and 7172 transitions. Second operand 6 states. [2019-01-11 21:16:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:11,741 INFO L93 Difference]: Finished difference Result 14910 states and 19273 transitions. [2019-01-11 21:16:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 21:16:11,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 291 [2019-01-11 21:16:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:11,778 INFO L225 Difference]: With dead ends: 14910 [2019-01-11 21:16:11,778 INFO L226 Difference]: Without dead ends: 9757 [2019-01-11 21:16:11,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 21:16:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9757 states. [2019-01-11 21:16:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9757 to 7261. [2019-01-11 21:16:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7261 states. [2019-01-11 21:16:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 9367 transitions. [2019-01-11 21:16:11,936 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 9367 transitions. Word has length 291 [2019-01-11 21:16:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:11,937 INFO L480 AbstractCegarLoop]: Abstraction has 7261 states and 9367 transitions. [2019-01-11 21:16:11,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:16:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 9367 transitions. [2019-01-11 21:16:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-11 21:16:11,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:11,951 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:11,951 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 330111059, now seen corresponding path program 1 times [2019-01-11 21:16:11,954 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:16:11,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:12,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-01-11 21:16:12,198 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-11 21:16:12,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:12,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:12,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:12,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:12,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:12,201 INFO L87 Difference]: Start difference. First operand 7261 states and 9367 transitions. Second operand 3 states. [2019-01-11 21:16:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:12,845 INFO L93 Difference]: Finished difference Result 14318 states and 18892 transitions. [2019-01-11 21:16:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:12,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-01-11 21:16:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:12,852 INFO L225 Difference]: With dead ends: 14318 [2019-01-11 21:16:12,853 INFO L226 Difference]: Without dead ends: 3160 [2019-01-11 21:16:12,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 328 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:16:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2019-01-11 21:16:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 2965. [2019-01-11 21:16:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2019-01-11 21:16:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3709 transitions. [2019-01-11 21:16:12,929 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3709 transitions. Word has length 330 [2019-01-11 21:16:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:12,929 INFO L480 AbstractCegarLoop]: Abstraction has 2965 states and 3709 transitions. [2019-01-11 21:16:12,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3709 transitions. [2019-01-11 21:16:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-01-11 21:16:12,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:12,936 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:16:12,937 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:12,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:12,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1274750431, now seen corresponding path program 1 times [2019-01-11 21:16:12,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-11 21:16:12,938 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-11 21:16:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:13,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1286 proven. 14 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2019-01-11 21:16:13,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 21:16:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 1286 proven. 14 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2019-01-11 21:16:13,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:16:13,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-11 21:16:13,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 21:16:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 21:16:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:16:13,646 INFO L87 Difference]: Start difference. First operand 2965 states and 3709 transitions. Second operand 6 states. [2019-01-11 21:16:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:13,988 INFO L93 Difference]: Finished difference Result 3178 states and 3979 transitions. [2019-01-11 21:16:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:16:13,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 441 [2019-01-11 21:16:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:13,992 INFO L225 Difference]: With dead ends: 3178 [2019-01-11 21:16:13,992 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:16:13,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:16:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:16:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:16:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:16:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:16:13,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-01-11 21:16:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:13,997 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:16:13,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 21:16:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:16:13,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:16:14,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:16:14,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,187 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-01-11 21:16:14,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,560 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 112 [2019-01-11 21:16:14,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:14,981 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-01-11 21:16:15,106 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-11 21:16:15,234 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 21:16:15,547 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-11 21:16:15,692 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-01-11 21:16:15,892 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-01-11 21:16:16,040 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-11 21:16:16,182 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-01-11 21:16:16,349 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-11 21:16:17,293 WARN L181 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-01-11 21:16:17,536 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-01-11 21:16:18,378 WARN L181 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-01-11 21:16:18,721 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-01-11 21:16:18,974 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-11 21:16:18,977 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 535) no Hoare annotation was computed. [2019-01-11 21:16:18,977 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 239) no Hoare annotation was computed. [2019-01-11 21:16:18,977 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 554) no Hoare annotation was computed. [2019-01-11 21:16:18,977 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 565) no Hoare annotation was computed. [2019-01-11 21:16:18,977 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 576) no Hoare annotation was computed. [2019-01-11 21:16:18,977 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 504) no Hoare annotation was computed. [2019-01-11 21:16:18,978 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 477) no Hoare annotation was computed. [2019-01-11 21:16:18,978 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 466 477) no Hoare annotation was computed. [2019-01-11 21:16:18,978 INFO L451 ceAbstractionStarter]: At program point L202(lines 201 543) the Hoare annotation is: true [2019-01-11 21:16:18,978 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 555) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3))) [2019-01-11 21:16:18,979 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 576) the Hoare annotation is: (let ((.cse0 (= (_ bv12292 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse2) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse3 .cse2) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse1 .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L401(lines 401 405) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L368-2(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 474) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 553) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 564) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 575) no Hoare annotation was computed. [2019-01-11 21:16:18,979 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 565) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,980 INFO L451 ceAbstractionStarter]: At program point L635(lines 627 637) the Hoare annotation is: true [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 442) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L438-2(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 306 320) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 552) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 563) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 574) no Hoare annotation was computed. [2019-01-11 21:16:18,980 INFO L444 ceAbstractionStarter]: At program point L208(lines 105 575) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and .cse0 .cse1 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse3) (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,981 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 553) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3))) [2019-01-11 21:16:18,981 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 412) no Hoare annotation was computed. [2019-01-11 21:16:18,981 INFO L448 ceAbstractionStarter]: For program point L407-2(lines 407 412) no Hoare annotation was computed. [2019-01-11 21:16:18,981 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 85) no Hoare annotation was computed. [2019-01-11 21:16:18,981 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 551) no Hoare annotation was computed. [2019-01-11 21:16:18,981 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 562) no Hoare annotation was computed. [2019-01-11 21:16:18,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2019-01-11 21:16:18,982 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 573) no Hoare annotation was computed. [2019-01-11 21:16:18,982 INFO L444 ceAbstractionStarter]: At program point L541(lines 99 607) the Hoare annotation is: (let ((.cse7 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse8 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse14 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse12 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse13 (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32))) (.cse10 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32))) (.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32))) (.cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse8 .cse5) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse1 (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse5) (and .cse9 .cse10 .cse1 .cse5) (and .cse9 .cse1 .cse11 .cse5) (and .cse1 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse5) (and .cse9 .cse1 .cse2 .cse5) (and .cse9 .cse12 .cse1 .cse13 .cse5) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5) (and (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse1 .cse2 .cse5 .cse14) (and .cse9 (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse1 .cse6 .cse5) (and .cse9 .cse1 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14) (and (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0) (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse1 .cse2 .cse5) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294962832 32)) (_ bv0 32)) .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-01-11 21:16:18,982 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 314) no Hoare annotation was computed. [2019-01-11 21:16:18,982 INFO L448 ceAbstractionStarter]: For program point L310-2(lines 308 320) no Hoare annotation was computed. [2019-01-11 21:16:18,982 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 563) the Hoare annotation is: (let ((.cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,982 INFO L451 ceAbstractionStarter]: At program point L608(lines 98 609) the Hoare annotation is: true [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 282) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 250) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 84) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L80-2(lines 77 85) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 382) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 550) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 561) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L213-2(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 572) no Hoare annotation was computed. [2019-01-11 21:16:18,983 INFO L448 ceAbstractionStarter]: For program point L577(lines 577 605) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 551) the Hoare annotation is: (let ((.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse3))) [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 602) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L512-1(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 616) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 588) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L612-2(lines 612 616) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L579-2(lines 578 600) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 549) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 560) no Hoare annotation was computed. [2019-01-11 21:16:18,984 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 571) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 353) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 561) the Hoare annotation is: (let ((.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32))) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32))) (.cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32))) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and .cse4 .cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse1 .cse2 .cse5 .cse6 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse5 .cse6 .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 585) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 454) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L444 ceAbstractionStarter]: At program point L350(lines 67 625) the Hoare annotation is: false [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point L483(lines 483 487) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2019-01-11 21:16:18,985 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 548) no Hoare annotation was computed. [2019-01-11 21:16:18,986 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 559) no Hoare annotation was computed. [2019-01-11 21:16:18,986 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 570) no Hoare annotation was computed. [2019-01-11 21:16:18,986 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 517 521) no Hoare annotation was computed. [2019-01-11 21:16:18,986 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-01-11 21:16:18,986 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 549) the Hoare annotation is: (let ((.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse4 .cse1 .cse3)))) [2019-01-11 21:16:18,986 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 571) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and .cse0 .cse1 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse3) (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,986 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 97) no Hoare annotation was computed. [2019-01-11 21:16:18,986 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 547) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 558) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 569) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 394) no Hoare annotation was computed. [2019-01-11 21:16:18,987 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 243) no Hoare annotation was computed. [2019-01-11 21:16:18,988 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 546) no Hoare annotation was computed. [2019-01-11 21:16:18,988 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 557) no Hoare annotation was computed. [2019-01-11 21:16:18,988 INFO L448 ceAbstractionStarter]: For program point L225-2(lines 225 243) no Hoare annotation was computed. [2019-01-11 21:16:18,988 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 568) no Hoare annotation was computed. [2019-01-11 21:16:18,988 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 547) the Hoare annotation is: (let ((.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse6 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32))) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32))) (.cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32))) (.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse3 .cse7 .cse8 .cse4) (and (or (and .cse1 .cse2 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (and .cse5 .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,988 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 569) the Hoare annotation is: (let ((.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32))) (.cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32))) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse6 .cse7 .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and .cse0 .cse5 .cse1 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse3))) [2019-01-11 21:16:18,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:16:18,988 INFO L451 ceAbstractionStarter]: At program point L623(lines 67 625) the Hoare annotation is: true [2019-01-11 21:16:18,989 INFO L448 ceAbstractionStarter]: For program point L590(lines 590 596) no Hoare annotation was computed. [2019-01-11 21:16:18,992 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-01-11 21:16:18,992 INFO L448 ceAbstractionStarter]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2019-01-11 21:16:18,992 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-01-11 21:16:18,992 INFO L451 ceAbstractionStarter]: At program point L624(lines 7 626) the Hoare annotation is: true [2019-01-11 21:16:18,992 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 463) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 331) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L327-2(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 545) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 556) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 567) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 545) the Hoare annotation is: (let ((.cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32))) (.cse4 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32))) (.cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse7 (= (_ bv3 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse1 .cse2 .cse6))) [2019-01-11 21:16:18,993 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 559) the Hoare annotation is: (let ((.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3) (and .cse2 (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse3)))) [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-11 21:16:18,993 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L297-2(lines 297 301) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 544) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 555) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 566) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 67 625) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 496 508) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 434) no Hoare annotation was computed. [2019-01-11 21:16:18,994 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 544) the Hoare annotation is: true [2019-01-11 21:16:18,994 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 567) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_V~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_W~0 (_ bv4294967291 32)) (_ bv0 32)))) (or (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3) (and (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Y~0 (_ bv4294967196 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd ULTIMATE.start_ssl3_connect_~ag_Z~0 (_ bv4294967232 32)) (_ bv0 32)) (= (bvadd ULTIMATE.start_ssl3_connect_~ag_X~0 (_ bv4294967252 32)) (_ bv0 32)) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))))) [2019-01-11 21:16:18,994 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:16:18,995 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 270) no Hoare annotation was computed. [2019-01-11 21:16:18,995 INFO L448 ceAbstractionStarter]: For program point L266-2(lines 203 540) no Hoare annotation was computed. [2019-01-11 21:16:19,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:16:19 BoogieIcfgContainer [2019-01-11 21:16:19,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:16:19,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:16:19,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:16:19,035 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:16:19,036 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:52" (3/4) ... [2019-01-11 21:16:19,040 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:16:19,059 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-11 21:16:19,060 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:16:19,061 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-11 21:16:19,199 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:16:19,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:16:19,204 INFO L168 Benchmark]: Toolchain (without parser) took 28934.28 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 480.8 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -255.4 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:16:19,206 INFO L168 Benchmark]: CDTParser took 0.21 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:16:19,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.72 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:16:19,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:16:19,206 INFO L168 Benchmark]: Boogie Preprocessor took 86.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:16:19,207 INFO L168 Benchmark]: RCFGBuilder took 1185.89 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:16:19,207 INFO L168 Benchmark]: TraceAbstraction took 26894.58 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 400.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -201.9 MB). Peak memory consumption was 684.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:16:19,207 INFO L168 Benchmark]: Witness Printer took 168.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:16:19,213 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.21 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 452.72 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 139.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1185.89 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26894.58 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 400.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -201.9 MB). Peak memory consumption was 684.3 MB. Max. memory is 11.5 GB. * Witness Printer took 168.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && !(4400bv32 == s__state)) && blastFlag == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (!(4400bv32 == s__state) && ((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || (((~bvadd64(ag_V, 4294967294bv32) == 0bv32 && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((12292bv32 == s__state && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && blastFlag == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((12292bv32 == s__state && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((((12292bv32 == s__state && ~bvadd64(ag_Y, 4294967196bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(blastFlag, 4294967295bv32) == 0bv32) && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967295bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && !(4400bv32 == s__state)) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && !(4400bv32 == s__state)) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && 4496bv32 == s__state) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4352bv32 == s__state) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && 4480bv32 == s__state)) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && 4560bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4384bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 4528bv32 == s__state) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4512bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((~bvadd64(ag_V, 4294967294bv32) == 0bv32 && 4368bv32 == s__state) && blastFlag == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 3bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4512bv32 == s__state) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((4432bv32 == s__state && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 3bv32 == s__s3__tmp__next_state___0) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4352bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4560bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || ((((4416bv32 == s__state && ~bvadd64(blastFlag, 4294967293bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 3bv32 == s__state) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(s__state, 4294962832bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && 4528bv32 == s__state) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4560bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) && !(4400bv32 == s__state))) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && !(4432bv32 == s__s3__tmp__next_state___0)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || (0bv32 == s__hit && ((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((!(4432bv32 == s__state) && ~bvadd64(blastFlag, 4294967294bv32) == 0bv32) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) || ((((!(4432bv32 == s__state) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && !(4400bv32 == s__state)) && blastFlag == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && !(4432bv32 == s__state)) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4352bv32 == s__state) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32) || (((((((~bvadd64(ag_Y, 4294967196bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4352bv32 == s__state) && 0bv32 == s__hit) && ~bvadd64(ag_Z, 4294967232bv32) == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && ~bvadd64(ag_X, 4294967252bv32) == 0bv32) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4352bv32 == s__state) && 0bv32 == s__hit) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32)) || ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 3bv32 == s__s3__tmp__next_state___0) && ~bvadd64(ag_V, 4294967294bv32) == 0bv32) && 4352bv32 == s__state) && ~bvadd64(ag_W, 4294967291bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. SAFE Result, 26.7s OverallTime, 22 OverallIterations, 16 TraceHistogramMax, 14.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4290 SDtfs, 1910 SDslu, 3058 SDs, 0 SdLazy, 2784 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4394 GetRequests, 4350 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7261occurred in iteration=20, 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: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 3131 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 284 NumberOfFragments, 1766 HoareAnnotationTreeSize, 23 FomulaSimplifications, 18506 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 23 FomulaSimplificationsInter, 2897 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3518 NumberOfCodeBlocks, 3518 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4377 ConstructedInterpolants, 0 QuantifiedInterpolants, 1864382 SizeOfPredicates, 22 NumberOfNonLiveVariables, 4755 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 11799/12191 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...