./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.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 a72fcebcfa7a668c9bb314320ec142761ff8c6a6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:08:25,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:08:25,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:08:25,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:08:25,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:08:25,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:08:25,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:08:25,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:08:25,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:08:25,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:08:25,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:08:25,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:08:25,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:08:25,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:08:25,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:08:25,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:08:25,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:08:25,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:08:25,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:08:25,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:08:25,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:08:25,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:08:25,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:08:25,812 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:08:25,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:08:25,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:08:25,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:08:25,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:08:25,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:08:25,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:08:25,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:08:25,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:08:25,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:08:25,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:08:25,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:08:25,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:08:25,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:08:25,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:08:25,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:08:25,855 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:08:25,855 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:08:25,855 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:08:25,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:08:25,856 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:08:25,856 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:08:25,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:08:25,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:08:25,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:08:25,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:08:25,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:08:25,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:08:25,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:08:25,857 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:08:25,858 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:08:25,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:08:25,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:08:25,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:08:25,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:08:25,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:25,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:08:25,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:08:25,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:08:25,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:08:25,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:08:25,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:08:25,861 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 -> a72fcebcfa7a668c9bb314320ec142761ff8c6a6 [2018-12-30 16:08:25,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:08:25,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:08:25,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:08:25,955 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:08:25,956 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:08:25,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:26,025 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5194e4bd/1fb6631a7fcd4c3faa0eb40b23f0ce87/FLAGb2759a6bf [2018-12-30 16:08:26,520 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:08:26,521 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:26,532 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5194e4bd/1fb6631a7fcd4c3faa0eb40b23f0ce87/FLAGb2759a6bf [2018-12-30 16:08:26,841 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5194e4bd/1fb6631a7fcd4c3faa0eb40b23f0ce87 [2018-12-30 16:08:26,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:08:26,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:08:26,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:26,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:08:26,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:08:26,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:26" (1/1) ... [2018-12-30 16:08:26,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4129fb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:26, skipping insertion in model container [2018-12-30 16:08:26,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:26" (1/1) ... [2018-12-30 16:08:26,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:08:26,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:08:27,273 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:27,278 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:08:27,362 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:27,383 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:08:27,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27 WrapperNode [2018-12-30 16:08:27,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:27,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:27,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:08:27,386 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:08:27,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:27,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:08:27,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:08:27,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:08:27,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... [2018-12-30 16:08:27,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:08:27,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:08:27,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:08:27,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:08:27,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:08:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:08:27,811 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:08:27,812 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:08:28,933 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:08:28,934 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:08:28,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:28 BoogieIcfgContainer [2018-12-30 16:08:28,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:08:28,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:08:28,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:08:28,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:08:28,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:08:26" (1/3) ... [2018-12-30 16:08:28,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f5a34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:28, skipping insertion in model container [2018-12-30 16:08:28,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:27" (2/3) ... [2018-12-30 16:08:28,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f5a34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:28, skipping insertion in model container [2018-12-30 16:08:28,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:28" (3/3) ... [2018-12-30 16:08:28,945 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-30 16:08:28,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:08:28,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:08:28,984 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:08:29,027 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:08:29,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:08:29,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:08:29,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:08:29,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:08:29,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:08:29,029 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:08:29,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:08:29,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:08:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-12-30 16:08:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:08:29,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:29,061 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] [2018-12-30 16:08:29,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:29,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2018-12-30 16:08:29,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:29,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:29,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:29,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:29,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:29,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:29,307 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2018-12-30 16:08:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:29,709 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2018-12-30 16:08:29,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:29,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:08:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:29,724 INFO L225 Difference]: With dead ends: 249 [2018-12-30 16:08:29,724 INFO L226 Difference]: Without dead ends: 113 [2018-12-30 16:08:29,728 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 [2018-12-30 16:08:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-30 16:08:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-30 16:08:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-30 16:08:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2018-12-30 16:08:29,781 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2018-12-30 16:08:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:29,782 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2018-12-30 16:08:29,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2018-12-30 16:08:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:08:29,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:29,784 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] [2018-12-30 16:08:29,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:29,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:29,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2018-12-30 16:08:29,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:29,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:29,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:29,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:29,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:29,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:29,940 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2018-12-30 16:08:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:30,642 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2018-12-30 16:08:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:30,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-30 16:08:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:30,644 INFO L225 Difference]: With dead ends: 235 [2018-12-30 16:08:30,646 INFO L226 Difference]: Without dead ends: 131 [2018-12-30 16:08:30,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-30 16:08:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-12-30 16:08:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-30 16:08:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2018-12-30 16:08:30,662 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2018-12-30 16:08:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:30,663 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2018-12-30 16:08:30,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2018-12-30 16:08:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-30 16:08:30,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:30,665 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] [2018-12-30 16:08:30,665 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2018-12-30 16:08:30,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:30,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:30,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:08:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:30,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:30,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:30,785 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2018-12-30 16:08:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:31,101 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2018-12-30 16:08:31,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:31,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-30 16:08:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:31,111 INFO L225 Difference]: With dead ends: 268 [2018-12-30 16:08:31,111 INFO L226 Difference]: Without dead ends: 149 [2018-12-30 16:08:31,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-30 16:08:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-12-30 16:08:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-30 16:08:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2018-12-30 16:08:31,129 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2018-12-30 16:08:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:31,132 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2018-12-30 16:08:31,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2018-12-30 16:08:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:08:31,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:31,138 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] [2018-12-30 16:08:31,138 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2018-12-30 16:08:31,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:31,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:31,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:31,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:31,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:31,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:31,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:31,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:31,350 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2018-12-30 16:08:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:31,752 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2018-12-30 16:08:31,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:31,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:08:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:31,756 INFO L225 Difference]: With dead ends: 332 [2018-12-30 16:08:31,757 INFO L226 Difference]: Without dead ends: 195 [2018-12-30 16:08:31,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-30 16:08:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2018-12-30 16:08:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-30 16:08:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2018-12-30 16:08:31,778 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2018-12-30 16:08:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:31,781 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2018-12-30 16:08:31,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2018-12-30 16:08:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:08:31,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:31,786 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] [2018-12-30 16:08:31,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2018-12-30 16:08:31,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:08:31,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:31,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:31,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:31,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:31,861 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2018-12-30 16:08:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:32,127 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2018-12-30 16:08:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:32,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:08:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:32,131 INFO L225 Difference]: With dead ends: 386 [2018-12-30 16:08:32,132 INFO L226 Difference]: Without dead ends: 209 [2018-12-30 16:08:32,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-30 16:08:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-12-30 16:08:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-30 16:08:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2018-12-30 16:08:32,145 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2018-12-30 16:08:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:32,146 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2018-12-30 16:08:32,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2018-12-30 16:08:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:08:32,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:32,155 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] [2018-12-30 16:08:32,155 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2018-12-30 16:08:32,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 16:08:32,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:32,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:32,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:32,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,237 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2018-12-30 16:08:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:32,406 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2018-12-30 16:08:32,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:32,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:08:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:32,410 INFO L225 Difference]: With dead ends: 425 [2018-12-30 16:08:32,410 INFO L226 Difference]: Without dead ends: 229 [2018-12-30 16:08:32,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-30 16:08:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-12-30 16:08:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-30 16:08:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2018-12-30 16:08:32,421 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2018-12-30 16:08:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:32,421 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2018-12-30 16:08:32,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2018-12-30 16:08:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-30 16:08:32,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:32,424 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] [2018-12-30 16:08:32,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2018-12-30 16:08:32,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:32,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:32,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:32,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-30 16:08:32,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:32,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:32,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:32,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,537 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2018-12-30 16:08:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:32,649 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2018-12-30 16:08:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:32,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-30 16:08:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:32,655 INFO L225 Difference]: With dead ends: 658 [2018-12-30 16:08:32,661 INFO L226 Difference]: Without dead ends: 441 [2018-12-30 16:08:32,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-12-30 16:08:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-12-30 16:08:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-12-30 16:08:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2018-12-30 16:08:32,690 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2018-12-30 16:08:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:32,690 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2018-12-30 16:08:32,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2018-12-30 16:08:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:08:32,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:32,693 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] [2018-12-30 16:08:32,693 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2018-12-30 16:08:32,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:08:32,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:32,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:32,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:32,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:32,855 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2018-12-30 16:08:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:33,040 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2018-12-30 16:08:33,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:33,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:08:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:33,045 INFO L225 Difference]: With dead ends: 658 [2018-12-30 16:08:33,045 INFO L226 Difference]: Without dead ends: 656 [2018-12-30 16:08:33,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-12-30 16:08:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-12-30 16:08:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-12-30 16:08:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2018-12-30 16:08:33,064 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2018-12-30 16:08:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:33,064 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2018-12-30 16:08:33,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2018-12-30 16:08:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-30 16:08:33,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:33,067 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] [2018-12-30 16:08:33,067 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2018-12-30 16:08:33,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:33,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:08:33,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:33,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:33,172 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2018-12-30 16:08:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:34,159 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2018-12-30 16:08:34,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:34,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-12-30 16:08:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:34,164 INFO L225 Difference]: With dead ends: 1383 [2018-12-30 16:08:34,164 INFO L226 Difference]: Without dead ends: 736 [2018-12-30 16:08:34,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-12-30 16:08:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2018-12-30 16:08:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-30 16:08:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2018-12-30 16:08:34,190 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2018-12-30 16:08:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:34,190 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2018-12-30 16:08:34,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2018-12-30 16:08:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-30 16:08:34,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:34,194 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] [2018-12-30 16:08:34,194 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2018-12-30 16:08:34,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:34,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-30 16:08:34,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:34,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:34,320 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2018-12-30 16:08:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:35,843 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2018-12-30 16:08:35,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:35,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-12-30 16:08:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:35,851 INFO L225 Difference]: With dead ends: 1594 [2018-12-30 16:08:35,851 INFO L226 Difference]: Without dead ends: 875 [2018-12-30 16:08:35,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-30 16:08:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2018-12-30 16:08:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-12-30 16:08:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2018-12-30 16:08:35,876 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2018-12-30 16:08:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:35,877 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2018-12-30 16:08:35,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2018-12-30 16:08:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-30 16:08:35,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:35,882 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2018-12-30 16:08:35,882 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2018-12-30 16:08:35,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:35,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:35,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-30 16:08:36,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:36,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:36,007 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2018-12-30 16:08:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:36,375 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2018-12-30 16:08:36,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:36,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-12-30 16:08:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:36,384 INFO L225 Difference]: With dead ends: 1765 [2018-12-30 16:08:36,385 INFO L226 Difference]: Without dead ends: 932 [2018-12-30 16:08:36,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-12-30 16:08:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2018-12-30 16:08:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-12-30 16:08:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2018-12-30 16:08:36,410 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2018-12-30 16:08:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:36,410 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2018-12-30 16:08:36,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2018-12-30 16:08:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-30 16:08:36,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:36,415 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2018-12-30 16:08:36,416 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2018-12-30 16:08:36,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:36,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-30 16:08:36,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:36,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:36,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:36,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:36,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:36,538 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2018-12-30 16:08:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:36,901 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2018-12-30 16:08:36,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:36,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-12-30 16:08:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:36,907 INFO L225 Difference]: With dead ends: 1945 [2018-12-30 16:08:36,907 INFO L226 Difference]: Without dead ends: 1028 [2018-12-30 16:08:36,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-12-30 16:08:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2018-12-30 16:08:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-12-30 16:08:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2018-12-30 16:08:36,933 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2018-12-30 16:08:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:36,933 INFO L480 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2018-12-30 16:08:36,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2018-12-30 16:08:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-30 16:08:36,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:36,939 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:36,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2018-12-30 16:08:36,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:36,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:36,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-30 16:08:37,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:37,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:37,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:37,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:37,108 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2018-12-30 16:08:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:37,230 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2018-12-30 16:08:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:37,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-30 16:08:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:37,241 INFO L225 Difference]: With dead ends: 3036 [2018-12-30 16:08:37,242 INFO L226 Difference]: Without dead ends: 2026 [2018-12-30 16:08:37,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2018-12-30 16:08:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2018-12-30 16:08:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2018-12-30 16:08:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2018-12-30 16:08:37,351 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2018-12-30 16:08:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:37,351 INFO L480 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2018-12-30 16:08:37,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2018-12-30 16:08:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-30 16:08:37,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:37,358 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:37,358 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2018-12-30 16:08:37,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:37,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-30 16:08:37,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:37,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:37,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:37,494 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2018-12-30 16:08:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:39,141 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2018-12-30 16:08:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:39,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-30 16:08:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:39,153 INFO L225 Difference]: With dead ends: 4264 [2018-12-30 16:08:39,153 INFO L226 Difference]: Without dead ends: 2249 [2018-12-30 16:08:39,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-12-30 16:08:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2018-12-30 16:08:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2018-12-30 16:08:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2018-12-30 16:08:39,223 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2018-12-30 16:08:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:39,223 INFO L480 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2018-12-30 16:08:39,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2018-12-30 16:08:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-30 16:08:39,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:39,232 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:39,232 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2018-12-30 16:08:39,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:39,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:39,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:39,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:39,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-12-30 16:08:39,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:39,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:39,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:39,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:39,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:39,393 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2018-12-30 16:08:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:40,095 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2018-12-30 16:08:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:40,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-12-30 16:08:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:40,108 INFO L225 Difference]: With dead ends: 4576 [2018-12-30 16:08:40,108 INFO L226 Difference]: Without dead ends: 2348 [2018-12-30 16:08:40,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2018-12-30 16:08:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2018-12-30 16:08:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2018-12-30 16:08:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2018-12-30 16:08:40,173 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2018-12-30 16:08:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:40,174 INFO L480 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2018-12-30 16:08:40,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2018-12-30 16:08:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-30 16:08:40,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:40,184 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:40,184 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2018-12-30 16:08:40,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:40,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:40,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:40,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:08:40,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:40,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:40,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:40,339 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2018-12-30 16:08:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:41,073 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2018-12-30 16:08:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:41,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-12-30 16:08:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:41,086 INFO L225 Difference]: With dead ends: 4963 [2018-12-30 16:08:41,087 INFO L226 Difference]: Without dead ends: 2636 [2018-12-30 16:08:41,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2018-12-30 16:08:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2018-12-30 16:08:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2018-12-30 16:08:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2018-12-30 16:08:41,144 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2018-12-30 16:08:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:41,144 INFO L480 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2018-12-30 16:08:41,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2018-12-30 16:08:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-30 16:08:41,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:41,154 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] [2018-12-30 16:08:41,154 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2018-12-30 16:08:41,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:41,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:41,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:08:41,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:41,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:41,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-30 16:08:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:41,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:41,768 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2018-12-30 16:08:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:45,368 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2018-12-30 16:08:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:08:45,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2018-12-30 16:08:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:45,395 INFO L225 Difference]: With dead ends: 8082 [2018-12-30 16:08:45,395 INFO L226 Difference]: Without dead ends: 5509 [2018-12-30 16:08:45,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2018-12-30 16:08:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2018-12-30 16:08:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2018-12-30 16:08:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2018-12-30 16:08:45,543 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2018-12-30 16:08:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:45,544 INFO L480 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2018-12-30 16:08:45,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2018-12-30 16:08:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-30 16:08:45,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:45,557 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, 1] [2018-12-30 16:08:45,557 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2018-12-30 16:08:45,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:45,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:45,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:45,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2018-12-30 16:08:45,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:45,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:45,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:45,744 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2018-12-30 16:08:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:45,984 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2018-12-30 16:08:45,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:45,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-12-30 16:08:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:46,038 INFO L225 Difference]: With dead ends: 12402 [2018-12-30 16:08:46,044 INFO L226 Difference]: Without dead ends: 7294 [2018-12-30 16:08:46,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2018-12-30 16:08:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2018-12-30 16:08:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2018-12-30 16:08:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2018-12-30 16:08:46,288 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2018-12-30 16:08:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:46,289 INFO L480 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2018-12-30 16:08:46,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2018-12-30 16:08:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-30 16:08:46,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:46,304 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, 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] [2018-12-30 16:08:46,306 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2018-12-30 16:08:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:46,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:46,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:46,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-30 16:08:46,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:46,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:46,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:46,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:46,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:46,469 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2018-12-30 16:08:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:47,828 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2018-12-30 16:08:47,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:47,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-12-30 16:08:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:47,851 INFO L225 Difference]: With dead ends: 14569 [2018-12-30 16:08:47,851 INFO L226 Difference]: Without dead ends: 7286 [2018-12-30 16:08:47,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2018-12-30 16:08:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2018-12-30 16:08:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2018-12-30 16:08:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2018-12-30 16:08:47,992 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2018-12-30 16:08:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:47,993 INFO L480 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2018-12-30 16:08:47,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2018-12-30 16:08:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-12-30 16:08:48,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:48,005 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:48,005 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:48,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2018-12-30 16:08:48,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:48,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:48,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:48,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:48,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:48,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:48,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:48,158 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2018-12-30 16:08:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:48,996 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2018-12-30 16:08:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:48,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2018-12-30 16:08:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:49,014 INFO L225 Difference]: With dead ends: 13675 [2018-12-30 16:08:49,015 INFO L226 Difference]: Without dead ends: 7415 [2018-12-30 16:08:49,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2018-12-30 16:08:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2018-12-30 16:08:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2018-12-30 16:08:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2018-12-30 16:08:49,176 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2018-12-30 16:08:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:49,177 INFO L480 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2018-12-30 16:08:49,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2018-12-30 16:08:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-12-30 16:08:49,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:49,192 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:49,192 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2018-12-30 16:08:49,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:49,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-30 16:08:49,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:49,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:49,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:49,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-12-30 16:08:49,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:08:49,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:08:49,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:08:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:08:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:49,850 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 5 states. [2018-12-30 16:08:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:50,902 INFO L93 Difference]: Finished difference Result 17553 states and 22618 transitions. [2018-12-30 16:08:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:08:50,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 371 [2018-12-30 16:08:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:50,925 INFO L225 Difference]: With dead ends: 17553 [2018-12-30 16:08:50,925 INFO L226 Difference]: Without dead ends: 10934 [2018-12-30 16:08:50,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:08:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2018-12-30 16:08:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2018-12-30 16:08:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2018-12-30 16:08:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2018-12-30 16:08:51,118 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 371 [2018-12-30 16:08:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:51,119 INFO L480 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2018-12-30 16:08:51,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:08:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2018-12-30 16:08:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-12-30 16:08:51,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:51,200 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:08:51,200 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2018-12-30 16:08:51,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:51,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:51,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:51,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-30 16:08:51,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:51,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:51,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:51,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:51,414 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2018-12-30 16:08:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:53,061 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2018-12-30 16:08:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:53,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2018-12-30 16:08:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:53,073 INFO L225 Difference]: With dead ends: 18222 [2018-12-30 16:08:53,073 INFO L226 Difference]: Without dead ends: 3798 [2018-12-30 16:08:53,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2018-12-30 16:08:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2018-12-30 16:08:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2018-12-30 16:08:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2018-12-30 16:08:53,151 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2018-12-30 16:08:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:53,151 INFO L480 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2018-12-30 16:08:53,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2018-12-30 16:08:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-12-30 16:08:53,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:53,160 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 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, 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] [2018-12-30 16:08:53,160 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2018-12-30 16:08:53,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:53,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-30 16:08:53,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:08:53,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:08:53,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:53,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:08:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-30 16:08:53,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:08:53,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:08:53,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:08:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:08:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:08:53,831 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2018-12-30 16:08:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:54,466 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2018-12-30 16:08:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:08:54,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2018-12-30 16:08:54,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:54,468 INFO L225 Difference]: With dead ends: 3784 [2018-12-30 16:08:54,468 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:08:54,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:08:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:08:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:08:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:08:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:08:54,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2018-12-30 16:08:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:54,471 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:08:54,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:08:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:08:54,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:08:54,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:08:54,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,917 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 97 [2018-12-30 16:08:54,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:54,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:08:55,807 WARN L181 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2018-12-30 16:08:56,103 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-12-30 16:08:56,824 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-12-30 16:08:57,240 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2018-12-30 16:08:57,571 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2018-12-30 16:08:58,076 WARN L181 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-30 16:08:58,229 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 18 [2018-12-30 16:08:58,333 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-12-30 16:08:58,430 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-12-30 16:08:58,431 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-30 16:08:58,431 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-12-30 16:08:58,431 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-12-30 16:08:58,431 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-12-30 16:08:58,431 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-30 16:08:58,431 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-30 16:08:58,432 INFO L444 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2018-12-30 16:08:58,432 INFO L451 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-12-30 16:08:58,432 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-12-30 16:08:58,432 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-12-30 16:08:58,432 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-12-30 16:08:58,433 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-12-30 16:08:58,433 INFO L444 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1) (and .cse0 .cse1))) [2018-12-30 16:08:58,433 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-12-30 16:08:58,433 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-12-30 16:08:58,433 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-12-30 16:08:58,433 INFO L444 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L448 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-12-30 16:08:58,434 INFO L444 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-12-30 16:08:58,435 INFO L444 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2018-12-30 16:08:58,435 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-12-30 16:08:58,436 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-12-30 16:08:58,436 INFO L448 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-12-30 16:08:58,436 INFO L451 ceAbstractionStarter]: At program point L544(lines 11 546) the Hoare annotation is: true [2018-12-30 16:08:58,436 INFO L444 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: false [2018-12-30 16:08:58,436 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-12-30 16:08:58,436 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-12-30 16:08:58,436 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-12-30 16:08:58,436 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-30 16:08:58,437 INFO L444 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2018-12-30 16:08:58,437 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-30 16:08:58,437 INFO L444 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse11 (= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse10 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse2 .cse3) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4480) .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse5) (and .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse8 .cse5 .cse7) (and .cse9 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10) (and .cse11 .cse2) (and .cse6 .cse4 .cse7) (and .cse4 .cse3 .cse5) (and .cse11 .cse4 .cse5) (and .cse9 .cse10 .cse4 .cse8 .cse5 .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4464) .cse4 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse2) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4368) .cse2) (and .cse2 .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4496) .cse4 .cse5))) [2018-12-30 16:08:58,437 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-12-30 16:08:58,437 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-12-30 16:08:58,437 INFO L448 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-12-30 16:08:58,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:08:58,438 INFO L444 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)))) [2018-12-30 16:08:58,439 INFO L444 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-12-30 16:08:58,439 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-12-30 16:08:58,440 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L444 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse1 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (and .cse0 .cse4 .cse3))) [2018-12-30 16:08:58,441 INFO L444 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L451 ceAbstractionStarter]: At program point L555(lines 547 557) the Hoare annotation is: true [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-12-30 16:08:58,441 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-12-30 16:08:58,442 INFO L444 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse4 .cse3) (and .cse0 .cse2 .cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2))) [2018-12-30 16:08:58,442 INFO L444 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2018-12-30 16:08:58,442 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L448 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-12-30 16:08:58,443 INFO L451 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-12-30 16:08:58,443 INFO L444 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-12-30 16:08:58,444 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-12-30 16:08:58,445 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-12-30 16:08:58,445 INFO L444 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2018-12-30 16:08:58,445 INFO L444 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~0 12292))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse0))) [2018-12-30 16:08:58,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:08:58 BoogieIcfgContainer [2018-12-30 16:08:58,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:08:58,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:08:58,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:08:58,478 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:08:58,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:28" (3/4) ... [2018-12-30 16:08:58,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:08:58,503 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:08:58,504 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:08:58,677 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:08:58,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:08:58,679 INFO L168 Benchmark]: Toolchain (without parser) took 31832.51 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 565.2 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -90.0 MB). Peak memory consumption was 475.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,679 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:08:58,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 931.1 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,682 INFO L168 Benchmark]: Boogie Preprocessor took 57.16 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. [2018-12-30 16:08:58,683 INFO L168 Benchmark]: RCFGBuilder took 1329.32 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,683 INFO L168 Benchmark]: TraceAbstraction took 29541.11 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 450.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -16.5 MB). Peak memory consumption was 434.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,683 INFO L168 Benchmark]: Witness Printer took 199.93 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:08:58,686 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 163.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 931.1 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.16 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 1329.32 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29541.11 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 450.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -16.5 MB). Peak memory consumption was 434.4 MB. Max. memory is 11.5 GB. * Witness Printer took 199.93 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 139]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state == 12292) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) && s__state == 12292) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && s__hit == 0) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4480 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (s__state == 4512 && blastFlag <= 2)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__new_cipher__algorithms == 256 && s__state == 4528) && s__hit == 0)) || ((s__state == 4512 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4464 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (s__state == 4384 && blastFlag <= 2)) || (s__state == 4368 && blastFlag <= 2)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4496 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((4560 <= s__state && blastFlag <= 2) && s__hit == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && s__hit == 0) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0)) || (blastFlag <= 2 && s__hit == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && s__hit == 0) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && s__hit == 0) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && s__hit == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. SAFE Result, 29.4s OverallTime, 23 OverallIterations, 18 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4460 SDtfs, 1516 SDslu, 2672 SDs, 0 SdLazy, 2748 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1181 GetRequests, 1149 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=21, 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.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 12271 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1807 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 5652 NumberOfCodeBlocks, 5652 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5626 ConstructedInterpolants, 0 QuantifiedInterpolants, 2278652 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1911 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 18665/18734 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...